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.
Type de document :
Communication dans un congrès
B. Bonet; S. Koenig. Proceedings of the Twenty-Ninth National Conference on Artificial Intelligence (AAAI'15), 2015, Austin, United States. AAAI Press, pp.1467-1474, 2015
Liste complète des métadonnées

https://hal.inria.fr/hal-01187001
Contributeur : René Quiniou <>
Soumis le : mardi 25 août 2015 - 18:25:46
Dernière modification le : mercredi 16 mai 2018 - 11:23:02

Identifiants

  • HAL Id : hal-01187001, version 1

Citation

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

Partager

Métriques

Consultations de la notice

256