Applications of preferences using Answer Set Programming - Archive ouverte HAL Access content directly
Conference Papers Year : 2005

Applications of preferences using Answer Set Programming


Preferences are useful when the space of feasible solutions of a given problem is dense but not all these feasible solutions are equivalent w.r.t. some additional requirements. In this case, the goal is to find feasible solutions that most satisfy these additional requirements. In order to represent preferences, in this paper we use an extension of ordered disjunction programs. Ordered disjunction is an approach based on answer sets that allows us to represent alternative, ranked options for a problem. Moreover, we give a brief overview of two real applications of extended ordered programs in two different domains. The first one is in planning: evacuation planning. The second one is in argumentation: organ transplantation. In particular, we show the role of negated negative literals in extended ordered programs to obtain the preferred solution of each application.
Fichier principal
Vignette du fichier
asp05.pdf (304.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01541544 , version 1 (25-03-2020)


  • HAL Id : hal-01541544 , version 1


Claudia Zepeda-Cortes, Mauricio Osorio, Juan Carlos Nieves, Christine Solnon, D. Sol. Applications of preferences using Answer Set Programming. Answer Set Programming: Advances in Theory and Implementation (ASP 2005), Sep 2005, Bath, United Kingdom. ⟨hal-01541544⟩
125 View
13 Download


Gmail Facebook Twitter LinkedIn More