Clasp: a conflict-driven answer set solver

  • 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 describe the conflict-driven answer set solver clasp, which is based on concepts from constraint processing (CSP) and satisfiability checking (SAT). We detail its system architecture and major features, and provide a systematic empirical evaluation of its features.