Asprin: Customizing Answer Set Preferences Without a Headache

Gerhard Brewka, James P. Delgrande, Javier Romero, Torsten Schaub

AAAI 2015 pp. 1467-1474

doi:10.1609/AAAI.V29I1.9398 /aaai/2015/brewka2015aaai-asprin/

Abstract

In this paper we describe asprin, a general, flexible, and extensible framework for handling preferences among the stable models of a logic program. We show how complex preference relations can be specified through user-defined preference types and their arguments. We describe how preference specifications are handled internally by so-called preference programs, which are used for dominance testing. We also give algorithms for computing one, or all, optimal stable models of a logic program. Notably, our algorithms depend on the complexity of the dominance tests and make use of multi-shot answer set solving technology.

PDF AAAI Semantic Scholar

Cite

Text

Brewka et al. "Asprin: Customizing Answer Set Preferences Without a Headache." AAAI Conference on Artificial Intelligence, 2015. doi:10.1609/AAAI.V29I1.9398

Markdown

[Brewka et al. "Asprin: Customizing Answer Set Preferences Without a Headache." AAAI Conference on Artificial Intelligence, 2015.](https://mlanthology.org/aaai/2015/brewka2015aaai-asprin/) doi:10.1609/AAAI.V29I1.9398

BibTeX

@inproceedings{brewka2015aaai-asprin,
  title     = {{Asprin: Customizing Answer Set Preferences Without a Headache}},
  author    = {Brewka, Gerhard and Delgrande, James P. and Romero, Javier and Schaub, Torsten},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {1467-1474},
  doi       = {10.1609/AAAI.V29I1.9398},
  url       = {https://mlanthology.org/aaai/2015/brewka2015aaai-asprin/}
}