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.
Nested preferences in answer set programming
Confalonieri R.
;
2011
Abstract
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.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
