Domain-Specific Heuristics in Answer Set Programming

Authors

  • Martin Gebser University of Potsdam
  • Benjamin Kaufmann University of Potsdam
  • Javier Romero University of Potsdam
  • Ramón Otero University of Corunna
  • Torsten Schaub University of Potsdam
  • Philipp Wanko University of Potsdam

DOI:

https://doi.org/10.1609/aaai.v27i1.8585

Keywords:

answer set programming, answer set solving, heuristics, conflict-driven clause learning

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.

AAAI 2013 Proceedings Cover

Downloads

Published

2013-06-30

How to Cite

Gebser, M., Kaufmann, B., Romero, J., Otero, R., Schaub, T., & Wanko, P. (2013). Domain-Specific Heuristics in Answer Set Programming. Proceedings of the AAAI Conference on Artificial Intelligence, 27(1), 350-356. https://doi.org/10.1609/aaai.v27i1.8585

Issue

Vol. 27 No. 1 (2013): Twenty-Seventh AAAI Conference on Artificial Intelligence

Section

Main Technical Papers