Search
 
loader loading subjects...
cover
Advanced Preprocessing for Answer Set Solving
Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub
15 - 19
10.3233/978-1-58603-891-5-15
Frontiers in Artificial Intelligence and Applications
Volume 178: ECAI 2008
Abstract

We introduce the first substantial approach to preprocessing in the context of answer set solving. The idea is to simplify a logic program while identifying equivalences among its relevant constituents. These equivalences are then used for building a compact representation of the program (in terms of Boolean constraints). We implemented our approach as well as a SAT-based technique to reduce Boolean constraints. This allows us to empirically analyze both preprocessing types and to demonstrate their computational impact.

Download
Creative Commons License