The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Enhancing Davis Putnam with extended binary clause reasoning
Eighteenth national conference on Artificial intelligence
Transformation-based bottom-up computation of the well-founded model
Theory and Practice of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The first answer set programming system competition
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
NiVER: non-increasing variable elimination resolution for preprocessing SAT instances
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Tableau calculi for answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
The Conflict-Driven Answer Set Solver clasp: Progress Report
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Potassco: The Potsdam Answer Set Solving Collection
AI Communications - Answer Set Programming
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
Multi-threaded asp solving with clasp
Theory and Practice of Logic Programming
Tableau Calculi for Logic Programs under Answer Set Semantics
ACM Transactions on Computational Logic (TOCL)
Inductive definitions in constraint programming
ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
| Hi-index | 0.00 |
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.