asprin: Customizing Answer Set Preferences without a Headache - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

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.
No file

Dates and versions

hal-01187001 , version 1 (25-08-2015)

Identifiers

  • HAL Id : hal-01187001 , version 1

Cite

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⟩
162 View
0 Download

Share

Gmail Facebook X LinkedIn More