论文信息 - Some Results on Order-Consistent Logic Programs

Some Results on Order-Consistent Logic Programs

Logic programming is a prominent approach for knowledge representation and reasoning. Answer set semantics of logic programs provides a promising constraint programming paradigm. Consistency is a significant issue in answer set programming. We investigated the order consistent logic programs and showed that the class of order consistent logic programs is identical to the call consistent one for finite logic programs, order consistency is decidable in polynomial time and Lifschitz's order consistency is identical to Sato's definition.

Xinqiang Ma | Yisong Wang | Yisong Wang | Xinqiang Ma

[1] Adrian Walker,et al. Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[2] G. Brewka. Principles of Knowledge Representation , 1996 .

[3] Stefania Costantini,et al. Under Consideration for Publication in Theory and Practice of Logic Programming on the Existence of Stable Models of Non-stratified Logic Programs , 2022 .

[4] V. Lifschitz,et al. Foundations of Logic Programming , 1997 .

[5] Taisuke Sato,et al. Completed Logic Programs and their Consistency , 1990, J. Log. Program..

[6] Mihalis Yannakakis,et al. Tie-breaking semantics and structural totality , 1992, PODS '92.

[7] François Fages,et al. Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[8] Fangzhen Lin,et al. On Odd and Even Cycles in Normal Logic Programs , 2004, AAAI.

[9] Alex M. Andrew,et al. Knowledge Representation, Reasoning and Declarative Problem Solving , 2004 .