Engineering an Incremental ASP Solver

  • Authors:
  • Martin Gebser;Roland Kaminski;Benjamin Kaufmann;Max Ostrowski;Torsten Schaub;Sven Thiele

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

  • Venue:
  • ICLP '08 Proceedings of the 24th International Conference on Logic Programming
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many real-world applications, like planning or model checking, comprise a parameter reflecting the size of a solution. In a propositional formalism like Answer Set Programming (ASP), such problems can only be dealt with in a bounded way, considering one problem instance after another by gradually increasing the bound on the solution size. We thus propose an incremental approach to both grounding and solving in ASP. Our goal is to avoid redundancy by gradually processing the extensions to a problem rather than repeatedly re-processing the entire (extended) problem. We start by furnishing a formal framework capturing our incremental approach in terms of module theory. In turn, we take advantage of this framework for guiding the successive treatment of program slices during grounding and solving. Finally, we describe the first integrated incremental ASP system, iclingo , and provide an experimental evaluation.