Abstract
We describe the conflict-driven answer set solver clasp, which is based on concepts from constraint processing (CSP) and satisfiability checking (SAT). We detail its system architecture and major features, and provide a systematic empirical evaluation of its features.
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)
Gebser, M., et al.: Conflict-driven answer set solving. In: Veloso, M. (ed.) Proceedings IJCAI’07, AAAI Press, Menlo Park (2007)
Gebser, M., et al.: Conflict-driven answer set enumeration. Submitted.
Ryan, L.: Efficient algorithms for clause-learning SAT solvers. Master’s thesis, SFU (2004)
Moskewicz, M., et al.: Chaff: Engineering an efficient SAT solver. In: DAC’01, pp. 530–535 (2001)
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)
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 Transactions on Computational Logic 7(3), 499–562 (2006)
Mitchell, D.: A SAT solver primer. Bulletin EATCS 85, 112–133 (2005)
Syrjänen, T.: Lparse 1.0 user’s manual, http://www.tcs.hut.fi/Software/smodels/lparse.ps.gz
Simons, P.: Extending and Implementing the Stable Model Semantics. Diss., HUT (2000)
Anger, C., Gebser, M., Schaub, T.: Approaching the core of unfounded sets. In: NMR’06, pp. 58–66 (2006)
Freeman, J.: Improvements to propositional satisfiability search algorithms. PhD thesis, UPenn (1995)
Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT solver. In: DATE’02, pp. 142–149 (2002)
Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of las vegas algorithms. Information Processing Letters 47(4), 173–180 (1993)
Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Huang, J.: The effect of restarts on the efficiency of clause learning. In: Veloso, M. (ed.) Proceedings IJCAI’07, AAAI Press, Menlo Park (2007)
Veloso, M. (ed.): Proceedings IJCAI’07. AAAI Press, Menlo Park (2007)
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). clasp: A Conflict-Driven Answer Set Solver. 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_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-72200-7_23
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)