Abstract Answer Set Solvers

Authors:
Yuliya Lierler
Affiliations:
University of Texas at Austin,
Venue:
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Year:
2008

Citing 9
Cited 6

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation

Information and Computation
A machine program for theorem-proving

Communications of the ACM
ASSAT: computing answer sets of a logic program by SAT solvers

Artificial Intelligence - Special issue on nonmonotonic reasoning
Answer set programming with clause learning

Answer set programming with clause learning
Answer Set Programming Based on Propositional Satisfiability

Journal of Automated Reasoning
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
On the relation between answer set and sat procedures (or, between cmodels and smodels)

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Tableau calculi for answer set programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming

Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs

Artificial Intelligence
Learning and using domain-specific heuristics in ASP solvers

AI Communications - Answer Set Programming
Abstract answer set solvers with backjumping and learning

Theory and Practice of Logic Programming
Automatic music composition using answer set programming

Theory and Practice of Logic Programming
The third answer set programming competition: preliminary report of the system competition track

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Relating constraint answer set programming languages and algorithms

Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

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.