Document Type
Article
Publication Date
3-2011
Publication Title
Theory and Practice of Logic Programming
Volume
11
Issue
2-3
First Page
135
Last Page
169
Abstract
Nieuwenhuis et al. (2006. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). Journal of the ACM 53(6), 937977 showed how to describe enhancements of the Davis–Putnam–Logemann–Loveland algorithm using transition systems, instead of pseudocode. We design a similar framework for several algorithms that generate answer sets for logic programs: SMODELS, SMODELScc, asp-sat with Learning (CMODELS), and a newly designed and implemented algorithm sup. This approach to describe answer set solvers makes it easier to prove their correctness, to compare them, and to design new systems.
Recommended Citation
Lierler, Yuliya, "Abstract Answer Set Solvers with Backjumping and Learning" (2011). Computer Science Faculty Publications. 4.
https://digitalcommons.unomaha.edu/compscifacpub/4
Comments
YULIYA LIERLER (2011). Abstract answer set solvers with backjumping and learning. Theory and Practice of Logic Programming, 11, pp 135-169. doi:10.1017/S1471068410000578. Copyright © Cambridge University Press 2011. This journal can be found at http://journals.cambridge.org/action/displayJournal?jid=TLP.