From answer set logic programming to circumscription via logic of GK

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 441-446

  Lin, Fangzhen ^a   Zhou, Yi ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL LOGIC; DEFAULT LOGIC; EQUILIBRIUM LOGIC; FIRST-ORDER; LOGIC PROGRAMS; MODAL LOGIC; NONMONOTONIC; PROPOSITIONAL LOGIC;

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING; MAPPING;

FORMAL LOGIC;

EID: 84880870740     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. T. Eiter, M. Fink, H. Tompits, P. Traxler, and S. Woltran. Replacements in non-ground answer-set programming. In KR'2006, pages 340-351, 2006.
2. P. Ferraris. Answer sets for propositional theories. In LPNMR, pages 119-131, 2005.
3. P. Ferraris and V. Lifschitz. Mathematical foundations of answer set programming. In We Will Show Them! (1), pages 615-664. 2005.
4. P. Ferraris, J. Lee, and V. Lifschitz. A new perspective on stable models. In Proceedings of IJCAI'07 (this volume), 2007.
5. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
6. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 2006. To appear.
7. V. Lifschitz, L. R. Tang, and H. Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369-389, 1999.
8. V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2(4):526-541, 2001.
9. V. Lifschitz. Action languages, answer sets and planning. In The Logic Programming Paradigm: A 25-Year Perspective. K.R. Apt, V.W. Marek, M. Truszczynski, D.S. Warren, eds, Springer-Verlag, 1999.
10. F. Lin and Y. Chen. Discovering classes of strongly equivalent logic programs. In Proc. of IJCAI'95, pages 516-521, 2005.
11. F. Lin and Y. Shoham. A logic of knowledge and justified assumptions. Artificial Intelligence, 57:271-289, 1992.
12. F. Lin. Reducing strong equivalence of logic programs to entailment in classical propositional logic. In Proc. of KR'02, pages 170-176, 2002.
13. V. W. Marek and M. Truszczynski. Stable logic programming - an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective. K.R. Apt, V.W. Marek, M. Truszczynski, D.S. Warren, eds, Springer-Verlag, 1999.
14. J. McCarthy. Applications of circumscription to formalizing commonsense knowledge. Artificial Intelligence, 28:89-118, 1986.
15. R. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25(1):75-94, 1985.
16. I. Niemelä; and P. Simons. Extending the smodels system with cardinality and weight constraints. pages 491-521, 2000.
17. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. and AI, 25(3-4):241-273, 1999.
18. D. Pearce, H. Tompits, and S. Woltran. Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In Proc. EPIA-01: 306-320, 2001.
19. D. Pearce. A new logical characterisation of stable models and answer sets. In Non-Monotonic Extensions of Logic Programming: 57-70, 1997.
20. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81-132, 1980.