Computing Logic Programs with Ordered Disjunction Using asprin
Computing Logic Programs with Ordered Disjunction Using asprin
复制标题
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Joohyung Lee;Zhun Yang
中科院分区：
文献类型：
--
作者：
Joohyung Lee;Zhun Yang
具有有序分离的逻辑程序（LPOD）是标准答案集程序的扩展，该程序使用有序分离的高级构造来处理偏好，而Asprin是最近提出的，一般，灵活的，可扩展的框架答案集编程的偏好。我们在ASPRIN的语言中介绍了LPOD的编码，并根据编码为LPOD2ASPRIN的LPOD实现。与仅适用于LPOD片段的已知方法不同，我们的翻译是一般，直接和简单的。它还可以使用ASPRIN对LPOD进行更有效的计算。
Logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the high-level construct of ordered disjunction whereas asprin is a recently proposed, general, flexible, and extensible framework that provides low-level constructs for representing preference in answer set programming. We present an encoding of LPOD in the language of asprin and the implementation of LPOD called LPOD2ASPRIN based on the encoding. Unlike the known method that applies only to a fragment of LPOD, our translation is general, direct, and simpler. It also leads to more efficient computation of LPOD using asprin .