2007 | OriginalPaper | Buchkapitel
Conflict-Driven Answer Set Enumeration
verfasst von : Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub
Erschienen in: Logic Programming and Nonmonotonic Reasoning
Verlag: Springer Berlin Heidelberg
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
We elaborate upon a recently proposed approach to finding an answer set of a logic program based on concepts from constraint processing and satisfiability checking. We extend this approach and propose a new algorithm for enumerating answer sets. The algorithm, which to our knowledge is novel even in the context of satisfiability checking, is implemented in the
clasp
answer set solver. We contrast our new approach to alternative systems and different options of
clasp
, and provide an empirical evaluation.