asprin: Customizing Answer Set Preferences without a Headache

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.
Complete list of metadatas

https://hal.inria.fr/hal-01187001
Contributor : René Quiniou <>
Submitted on : Tuesday, August 25, 2015 - 6:25:46 PM
Last modification on : Monday, February 11, 2019 - 4:22:53 PM

Identifiers

  • HAL Id : hal-01187001, version 1

Citation

Gerhard Brewka, James P. Delgrande, Javier Romero, Torsten Schaub. asprin: Customizing Answer Set Preferences without a Headache. Proceedings of the Twenty-Ninth National Conference on Artificial Intelligence (AAAI'15), 2015, Austin, United States. pp.1467-1474. ⟨hal-01187001⟩

Share

Metrics

Record views

280