Domain-Specific Heuristics in Answer Set Programming

Martin Gebser, Benjamin Kaufmann, Javier Romero, Ramón Otero, Torsten Schaub, Philipp Wanko

AAAI 2013 pp. 350-356

doi:10.1609/AAAI.V27I1.8585 /aaai/2013/gebser2013aaai-domain/

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.

PDF AAAI Semantic Scholar

Cite

Text

Gebser et al. "Domain-Specific Heuristics in Answer Set Programming." AAAI Conference on Artificial Intelligence, 2013. doi:10.1609/AAAI.V27I1.8585

Markdown

[Gebser et al. "Domain-Specific Heuristics in Answer Set Programming." AAAI Conference on Artificial Intelligence, 2013.](https://mlanthology.org/aaai/2013/gebser2013aaai-domain/) doi:10.1609/AAAI.V27I1.8585

BibTeX

@inproceedings{gebser2013aaai-domain,
  title     = {{Domain-Specific Heuristics in Answer Set Programming}},
  author    = {Gebser, Martin and Kaufmann, Benjamin and Romero, Javier and Otero, Ramón and Schaub, Torsten and Wanko, Philipp},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2013},
  pages     = {350-356},
  doi       = {10.1609/AAAI.V27I1.8585},
  url       = {https://mlanthology.org/aaai/2013/gebser2013aaai-domain/}
}