Computing loops with at most one external support rule

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2008, Pages 401-410

  Chen, Xiaoping ^a   Ji, Jianmin ^a   Lin, Fangzhen ^b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING;

ANSWER SET; C-MODELS; LOGIC PROGRAMS; LOOP FORMULAS; PROGRAM COMPLETION; SMODELS; UNIT PROPAGATION; WELL-FOUNDED MODELS;

COMPUTER CIRCUITS;

EID: 69949165723     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
2. Brass, S., and Dix, J. 1999. Semantics of (disjunctive) logic programs based on partial evaluation. The Journal of Logic Programming 40(1):1-46.
3. Chen, Y.; Lin, F.; Wang, Y.; and Zhang, M. 2006. First-order loop formulas for normal logic programs. In Proceedings of the Tenth International Conference on Principles of Knowledge Representation and Reasoning (KR2006), 298-307.
4. Clark, K. L. 1978. Negation as failure. In Gallaire, H., and Minker, J., eds., Logic and Databases. New York: Plenum Press. 293-322.
5. Ferraris, P.; Lee, J.; and Lifschitz, V. 2006. A generalization of the lin-zhao theorem. Annals of Mathematics and Artificial Intelligence 47(1-2):79-101.
6. Gebser, M.; Kaufmann, B.; Neumann, A.; and Schaub, T. 2007. Conflict-driven answer set solving. In Proceddings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), 386-392.
7. Gelfond, M., and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of the Fifth International Conference on Logic Programming (ICLP- 88), 1070-1080.
8. Giunchiglia, E.; Lierler, Y.; and Maratea, M. 2006. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36(4):345-377.
9. Lee, J., and Lifschitz, V. 2003. Loop formulas for disjunctive logic programs. In Proceedings of the Nineteenth International Conference on Logic Programming (ICLP-03), 451-465.
10. Lee, J., and Lin, F. 2006. Loop formulas for circumscription. Artificial Intelligence 170(2):160-185.
11. Leone, N.; Pfeifer, G.; Faber, W.; Eiter, T.; Gottlob, G.; Perri, S.; and Scarcello, F. 2006. The dlv system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7(3):499-562.
12. Leone, N.; Rullo, P.; and Scarcello, F. 1997. Disjunctive stablemodels: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135(2):69- 112.
13. Lifschitz, V., and Razborov, A. 2006. Why are there so many loop formulas? ACM Transactions on Computational Logic 7(2):261-268.
14. Lin, F., and Chen, Y. 2007. Discovering Classes of Strongly Equivalent Logic Programs. Journal of Artificial Intelligence Research 28:431-451.
15. Lin, F., and Zhao, Y. 2004. ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2):115-137.
16. Lobo, J.; Minker, J.; and Rajasekar, A. 1992. Foundations of Disjunctive Logic Programming. MIT Press.
17. Niemel̈a, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3):241-273.
18. Przymusinski, T. 1995. Static semantics of logic programs. Annals of Mathematics and Artificial Intelligence 14:323- 357.
19. Simons, P.; Niemel̈a, I.; and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2):181-234.
20. Van Gelder, A.; Ross, K.; and Schlipf, J. S. 1991. The wellfounded semantics for general logic programs. Journal of the ACM 38(3):620-650.
21. Van Gelder, A. 1989. The alternating fixpoint of logic programs with negation. In Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (PODS-89), 1-10.
22. Wang, K., and Zhou, L. 2005. Comparisons and computation of well-founded semantics for disjunctive logic programs. ACM Transactions on Computational Logic 6(2):295-327.