arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1507.05388cs.CCcs.AIcs.LO
收藏

双重正规逻辑程序--被遗忘的类

Dual-normal Logic Programs - the Forgotten Class

TU Wien(维也纳工业大学);University of Potsdam(波茨坦大学);University of Kentucky(肯塔基大学)

Johannes K. Fichte, Miroslaw Truszczynski, Stefan Woltran

摘要:

析取答案集编程是一种功能强大的声明式编程范式,其复杂性超过NP。从理论的角度来看,识别类的程序的一致性问题是在NP是感兴趣的,并可能导致改进的答案集编程求解器的设计。其中一类由双正规程序组成,其中正体原子的数量在适当的规则是最多一个。与其他类型的程序不同,双正规程序到目前为止很少受到关注。在本文中,我们研究这个类。我们涉及到双正常程序的命题理论和正常的程序,提出了几个翻译。随着从双正规程序到正规程序的翻译,我们引入了一类新的体循环自由程序,它在许多方面都是头循环自由程序的对偶。我们建立的表达能力的双正常程序的SE-和UE-模型,并比较它们正常的程序。我们还讨论了判定对偶正规规划是否强一致等价的复杂性。

英文摘要:

Disjunctive Answer Set Programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretical standpoint and can potentially lead to improvements in the design of answer set programming solvers. One of such classes consists of dual-normal programs, where the number of positive body atoms in proper rules is at most one. Unlike other classes of programs, dual-normal programs have received little attention so far. In this paper we study this class. We relate dual-normal programs to propositional theories and to normal programs by presenting several inter-translations. With the translation from dual-normal to normal programs at hand, we introduce the novel class of body-cycle free programs, which are in many respects dual to head-cycle free programs. We establish the expressive power of dual-normal programs in terms of SE- and UE-models, and compare them to normal programs. We also discuss the complexity of deciding whether dual-normal programs are strongly and uniformly equivalent.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑