2008 | OriginalPaper | Buchkapitel
Abstract Answer Set Solvers
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.