Guarded resolution for answer set programming

Theory and Practice of Logic Programming

Volumn 11, Issue 1, 2011, Pages 111-123

  Marek, V W ^a   Remmel, J B ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

guarded resolution; proof theory for Answer Set Programming

Indexed keywords

ANSWER SET PROGRAMMING; GUARDED RESOLUTION; LOGIC PROGRAMS; PROOF SYSTEM; PROOF-THEORY FOR ANSWER SET PROGRAMMING; PROPOSITIONAL THEORIES; STABLE MODEL; STABLE SEMANTICS;

LOGIC PROGRAMMING;

SEMANTICS;

EID: 79951855082     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068410000062     Document Type: Article

References (19)

1. Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving, Cambridge University Press.
2. Brass, J. and Dix, J. 1999. Semantics of (Disjunctive) logic programs based on partial evaluation. Journal of Logic Programming 40, 1-46.
3. Davis, M., Logemann, G. and Loveland, D. W. 1962. A machine program for theoremproving. Communications of the ACM 5 (7), 394-397.
4. Dowling, W. F. and Gallier, J. H. 1984. Linear time algorithms for testing satisfiability of propositional Horn formulae. Journal of Logic Programming 1, 267-284.
5. Dung, P. M. and Kanchansut, K. 1989. A fixpoint approach to declarative semantics of logic programs. In Proc. of North American Conference on Logic Programming, E. L. Lusk and R. A. Overbeek, Eds. MIT Press, 604-625.
6. Erdem, E. and Lifschitz, V. 2003. Tight logic programs. Theory and Practice of Logic Programming 3, 499-518.
7. Fages, F. 1994. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51-60.
8. Ferraris, P., Lee, J. and Lifschitz, V. 2006. A generalization of Lin-Zhao theorem. Annals of Mathematics and Artificial Intelligence 47, 79-101.
9. Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proc. of the Fifth International Conference and Symposium on Logic Programming. R. A. Kowalski and K. A. Bowen, Eds. MIT Press, 1070-1080.
10. Karp, C. 1964. Languages with Expressions of Infinitary length. North-Holland, Amsterdam.
11. Lifschitz, V. 2008. Twelve definitions of a stable model. In 24th International Conference on Logic Programming, ICLP 2008, M. Garcia de la Banda and E. Pontelli, Eds. Lecture Notes in Computer Science, vol. 5366. Springer, 37-51.
12. Lifschitz, V., Pearce, D. and Valverde, A. 2001. Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 526-541.
13. Lifschitz, V. and Razborov, A. 2006. Why are there so many loop formulas. Annals of Mathematics and Artificial Intelligence 7, 261-268.
14. Lin, F. and Zhao, Y. 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157 (1-2), 115-137.
15. Marek, V. W. and Remmel, J. B. 2010. An application of proof-theory in answer set programming. Preliminary version at arXiv:0905.4076.
16. Marek, V. W. and Truszczyński, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm, Series Artificial Intelligence, Springer-Verlag, 375-398.
17. Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L. and Mali, S. 2001. Chaff: Engineering an efficient SAT solver. In Proc. of the 38th Design Automation Conference, DAC 2001, ACM Press, 530-535. (Pubitemid 32841010)
18. Niemelä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25 (3,4), 241-273.
19. Truszczynski, M. 2006. Strong and uniform equivalence of nonmonotonic theories - an algebraic approach. Annals of Mathematics and Artificial Intelligence 48 (3-4), 245-265.