Abstract answer set solvers with backjumping and learning

Theory and Practice of Logic Programming

Volumn 11, Issue 2-3, 2011, Pages 135-169

  Lierler, Yuliya ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

answer set programming; inference; learning

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; C-MODELS; DAVIS-PUTNAM-LOGEMANN-LOVELAND PROCEDURES; INFERENCE; LEARNING; LOGIC PROGRAMS; PSEUDO-CODE; SAT MODULO THEORIES; SMODELS; TRANSITION SYSTEM;

ALGORITHMS; LOGIC PROGRAMMING;

ABSTRACTING;

EID: 79960354986     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068410000578     Document Type: Conference Paper

References (26)

1. Clark, K. 1978. Negation as failure. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum Press, New York, NY, USA, 293-322.
2. Davis, M., Logemann, G. and Loveland, D. 1962. A machine program for theorem proving. Communications of the ACM 5 (7), 394-397.
3. Fages, F. 1994. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51-60.
4. Gebser, M., Kaufmann, B., Neumann, A. and Schaub, T. 2007. Conflict-driven answer set solving. In Proceedings of 20th International Joint Conference on Artificial Intelligence (IJCAI'07). MIT Press, Cambridge, MA, USA, 386-392.
5. Gebser, M. and Schaub, T. 2006. Tableau calculi for answer set programming. In Proceedings of 22nd International Conference on Logic Programming (ICLP'06). Springer, New Mexico, USA, 11-25. (Pubitemid 44492579)
6. Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of International Logic Programming Conference and Symposium, R. Kowalski and K. Bowen, Eds. MIT Press, Cambridge, MA, USA, 1070-1080.
7. Giunchiglia, E., Lierler, Y. and Maratea, M. 2006. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36, 345-377. (Pubitemid 46046675)
8. Giunchiglia, E. and Maratea, M. 2005. On the relation between answer set and SAT procedures (or, between smodels and cmodels). In Proceedings of 21st International Conference on Logic Programming (ICLP'05). Springer, New Mexico, USA, 37-51. (Pubitemid 41491592)
9. Gomes, C. P., Kautz, H., Sabharwal, A. and Selman, B. 2008. Satisfiability solvers. In Handbook of Knowledge Representation, F. van Harmelen, V. Lifschitz and B. Porter, Eds. Elsevier, Missouri, USA, 89-134.
10. Lee, J. 2005. A model-theoretic counterpart of loop formulas. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI). Professional Book Center, Denver CO, USA, 503-508.
11. Lierler, Y. 2008. Abstract answer set solvers. In Proceedings of International Conference on Logic Programming (ICLP'08). Springer, New Mexico, USA, 377-391.
12. Lierler, Y. 2010. Abstract answer set solvers with learning (long version). arxiv:1001.0820v1 [cs.ai].
13. Lifschitz, V. 2008. What is answer set programming? In Proceedings of the AAAI Conference on Artificial Intelligence. MIT Press, Cambridge, MA, USA, 1594-1597.
14. Lin, F. and Zhao, Y. 2002. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proceedings of National Conference on Artificial Intelligence (AAAI). MIT Press, Cambridge, MA, USA, 112-117.
15. Lin, F. and Zhao, Y. 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157, 115-137.
16. Lin, Z., Zhang, Y. and Hernandez, H. 2006. Fast SAT-based answer set solver. In Proceedings of National Conference on Artificial Intelligence (AAAI). MIT Press, Cambridge, MA, USA, 92-97. (Pubitemid 44705269)
17. Marques-Silva, J. P. and Sakallah, K. A. 1996. Conflict analysis in search algorithms for propositional satisfiability. In Proceedings of 8th International Conference on Tools with Artificial Intelligence (ICTAI'96). IEEE Computer Society, Toulouse, France, 467-469.
18. Mitchell, D. G. 2005. A SAT solver primer. EATCS Bulletin (The Logic in Computer Science Column) 85, 112-133.
19. Nieuwenhuis, R., Oliveras, A. and Tinelli, C. 2006. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM 53 (6), 937-977. (Pubitemid 46276962)
20. Ricca, F., Faber, W. and Leone, N. 2006. A backjumping technique for disjunctive logic programming. AI Communications 19 (2), 155-172. (Pubitemid 43848926)
21. Saccá, D. and Zaniolo, C. 1990. Stable models and non-determinism in logic programs with negation. In Proceedings of ACM Symposium on Principles of Database Systems (PODS), April 2-4, Nashville, TN, USA. ACM Press, 205-217.
22. Simons, P. 2000. Extending and Implementing the Stable Model Semantics. Ph.D. thesis, Helsinki University of Technology, Adviser-Niemelä, Ilkka.
23. Van Gelder, A., Ross, K. and Schlipf, J. 1991. The well-founded semantics for general logic programs. Journal of ACM 38 (3), 620-650.
24. Ward, J. 2004. Answer Set Programming with Clause Learning. Ph.D. thesis, The University of Cincinnati, Cincinnati, OH, USA. URL: http://www.nku.edu/ ~wardj1RresearchTthesis.pd, accessed 10 January 2010.
25. Ward, J. and Schlipf, J. 2004. Answer set programming with clause learning. In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04), Fort Lauderdale, FL, USA, January 6-8, 302-313. (Pubitemid 38050686)
26. Zhang, L., Madigan, C. F., Moskewicz, M. W. and Malik, S. 2001. Efficient conflict driven learning in a Boolean satisfiability solver. In Proceedings of International Conference on Computer-Aided Design (ICCAD-01), November 2001, 279-285. (Pubitemid 33148971)