Conflict-driven answer set enumeration

  • Authors:
  • Martin Gebser;Benjamin Kaufmann;André Neumann;Torsten Schaub

  • Affiliations:
  • Institut für Informatik, Universität Potsdam, Potsdam, Germany;Institut für Informatik, Universität Potsdam, Potsdam, Germany;Institut für Informatik, Universität Potsdam, Potsdam, Germany;Institut für Informatik, Universität Potsdam, Potsdam, Germany

  • Venue:
  • LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.