Nested preferences in answer set programming
MetadataShow full item record
In this paper, we define a class of nested logic programs, called Nested Logic Programs with Ordered Disjunction (LPODs), which makes it possible to specify conditional (qualitative) preferences by means of nested preference statements. To this end, we augment the syntax of Logic Programs with Ordered Disjunction (LPODs) to capture more general expressions. We define the LPODs semantics in a simple way and we extend most of the results of LPODs showing how our approach generalizes the LPODs framework in a proper way. We also show how the LPODs semantics can be computed in terms of a translation procedure that maps a nested ordered disjunction program (OD-program) into a disjunctive logic program.
Showing items related by title, author, creator and subject.
Confalonieri R; Prade H (Springer Verlag, 2012)The representation of preference queries to an uncertain data-base requires a framework capable of dealing with preferences and uncertainty in a separate way. Possibilistic logic has shown to be a suitable setting to support ...
Confalonieri R; Nieves J; Osorio M; Vázquez-Salceda J (2012)In this paper, we show how the formalism of Logic Programs with Ordered Disjunction (LPODs) and Possibilistic Answer Set Programming (PASP) can be merged into the single framework of Logic Programs with Possibilistic Ordered ...
The role of preferences in logic programming: nonmonotonic reasoning, user preferences, decision under uncertainty Confalonieri R (2011)Intelligent systems that assist users in fulfilling complex tasks need a concise and processable representation of incomplete and uncertain information. In order to be able to choose among different options, these systems ...