Domain-specific Heuristics in Answer Set Programming
In Proc. Proceedings of the Twenty-Seventh National Conference on Artificial Intelligence (AAAI'13)
| Authors: | Martin Gebser, Benjamin Kaufmann, Ramón Otero, Javier Romero, Torsten Schaub, Philipp Wanko |
|---|---|
| Type: | Article in Conference Proceedings |
| Publication Date: | July 2013 |
| Conference: | Proceedings of the Twenty-Seventh National Conference on Artificial Intelligence (AAAI'13) |
Abstract: We introduce a general declarative framework for incorporating domain-specific heuristics into ASP solving. We accomplish this by extending the first-order modeling language of ASP by a distinguished heuristic predicate. The resulting heuristic information is processed as an equitable part of the logic program and subsequently exploited by the solver when it comes to non-deterministically assigning a truth value to an atom. We implemented our approach as a dedicated heuristic in the ASP solver clasp and show its great prospect by an empirical evaluation.
BibTeX@InProceedings{gekaotroscwa13a-2013,
title = {{Domain-specific Heuristics in Answer Set Programming}},
author = {Martin Gebser and Benjamin Kaufmann and Ramón Otero and Javier Romero and Torsten Schaub and Philipp Wanko},
booktitle = {Proc. of Proceedings of the Twenty-Seventh National Conference on Artificial Intelligence (AAAI'13)},
year = {2013},
}