Abstract
We elaborate upon a recently proposed approach to finding an answer set of a logic program based on concepts from constraint processing and satisfiability checking. We extend this approach and propose a new algorithm for enumerating answer sets. The algorithm, which to our knowledge is novel even in the context of satisfiability checking, is implemented in the clasp answer set solver. We contrast our new approach to alternative systems and different options of clasp, and provide an empirical evaluation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181–234 (2002)
Leone, N., et al.: The DLV system for knowledge representation and reasoning. ACM TOCL 7(3), 499–562 (2006)
Mitchell, D.: A SAT solver primer. Bulletin of EATCS 85, 112–133 (2005)
Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2), 115–137 (2004)
Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning, To appear (2007)
Gebser, M., et al.: Conflict-driven answer set solving. In: Proceedings IJCAI’07, pp. 386–392. AAAI Press, Menlo Park (2007)
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Plenum Press, New York (1978)
Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann, San Francisco (1987)
Fages, F.: Consistency of Clark’s completion and the existence of stable models. Journal of Methods of Logic in Computer Science 1, 51–60 (1994)
Lee, J.: A model-theoretic counterpart of loop formulas. In: Proceedings IJCAI’05, pp. 503–508. Professional Book Center (2005)
Dechter, R., Frost, D.: Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence 136(2), 147–188 (2002)
Ryan, L.: Efficient algorithms for clause-learning SAT solvers. MSc thesis, Simon Fraser University (2004)
Bayardo, R., Schrag, R.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings AAAI’97, pp. 203–208. AAAI Press, Menlo Park (1997)
Ward, J., Schlipf, J.: Answer Set Programming with Clause Learning. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 302–313. Springer, Heidelberg (2003)
Sang, T., et al.: Combining component caching and clause learning for effective model counting. In: Proceedings SAT’04 (2004)
Lin, Z., Zhang, Y., Hernandez, H.: Fast SAT-based answer set solver. In: Proceedings AAAI’06, AAAI Press, Menlo Park (2006)
Ricca, F., Faber, W., Leone, N.: A backjumping technique for disjunctive logic programming. AI Communications 19(2), 155–172 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Gebser, M., Kaufmann, B., Neumann, A., Schaub, T. (2007). Conflict-Driven Answer Set Enumeration. In: Baral, C., Brewka, G., Schlipf, J. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2007. Lecture Notes in Computer Science(), vol 4483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72200-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-72200-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72199-4
Online ISBN: 978-3-540-72200-7
eBook Packages: Computer ScienceComputer Science (R0)