Conflict-Driven Answer Set Solving
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 386--1.
Abstract
We introduce a new approach to computing answer sets of logic programs, based on concepts from constraint processing (CSP) and satisfiability checking (SAT). The idea is to view inferences in answer set programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework for the different kinds of inferences in ASP. It also allows us to apply advanced techniques from the areas of CSP and SAT. We have implemented our approach in the new ASP solver clasp. Our experiments show that the approach is competitive with state-of-the-art ASP solvers.
@inproceedings{ijcai2007p60,
title = {Conflict-Driven Answer Set Solving},
author = {Gebser, Martin and Kaufmann, Benjamin and Neumann, André and Schaub, Torsten},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {386---1},
year = {2007},
url = {https://ijcai.org/proceedings/2007/60},
}
TY - CPAPER TI - Conflict-Driven Answer Set Solving AU - Gebser, Martin AU - Kaufmann, Benjamin AU - Neumann, André AU - Schaub, Torsten T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 386 EP - -1 UR - https://ijcai.org/proceedings/2007/60 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
