Sciweavers

Share
ECAI
2008
Springer

Advanced Preprocessing for Answer Set Solving

8 years 4 months ago
Advanced Preprocessing for Answer Set Solving
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.
Martin Gebser, Benjamin Kaufmann, André Neu
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where ECAI
Authors Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub
Comments (0)
books