Document Type
Conference Proceeding
Publication Date
2008
Abstract
Nieuwenhuis, Oliveras, and Tinelli showed how to describe enhancements of the Davis-Putnam-Logemann-Loveland algorithm using transition systems, instead of pseudocode. We design a similar framework for three algorithms that generate answer sets for logic programs: SMODELS, ASP-SAT with Backtracking, and a newly designed and implemented algorithm SUP. This approach to describing 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" (2008). Computer Science Faculty Proceedings & Presentations. 6.
https://digitalcommons.unomaha.edu/compsicfacproc/6
Comments
24th International Conference on Logic Programming