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, 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.

PS

In Proceedings of International Conference on Logic Programming (ICLP'08), 377-391, 2008. Springer.

@Inproceedings{lier08, title={Abstract Answer Set Solvers}, author={Yuliya Lierler}, booktitle={Proceedings of International Conference on Logic Programming (ICLP'08)}, publisher={Springer}, pages={377-391}, url="http://www.cs.utexas.edu/users/ai-lab/?lier08", year={2008} }