DeepAI AI Chat
Log In Sign Up

A Logical Charaterisation of Ordered Disjunction

by   Pedro Cabalar, et al.
Universidade da Coruña

In this paper we consider a logical treatment for the ordered disjunction operator 'x' introduced by Brewka, Niemelä and Syrjänen in their Logic Programs with Ordered Disjunctions (LPOD). LPODs are used to represent preferences in logic programming under the answer set semantics. Their semantics is defined by first translating the LPOD into a set of normal programs (called split programs) and then imposing a preference relation among the answer sets of these split programs. We concentrate on the first step and show how a suitable translation of the ordered disjunction as a derived operator into the logic of Here-and-There allows capturing the answer sets of the split programs in a direct way. We use this characterisation not only for providing an alternative implementation for LPODs, but also for checking several properties (under strongly equivalent transformations) of the 'x' operator, like for instance, its distributivity with respect to conjunction or regular disjunction. We also make a comparison to an extension proposed by Kärger, Lopes, Olmedilla and Polleres, that combines 'x' with regular disjunction.


page 1

page 2

page 3

page 4


Logic Programming with Ordered Disjunction

Logic programs with ordered disjunction (LPODs) combine ideas underlying...

Translating LPOD and CR-Prolog2 into Standard Answer Set Programs

Logic Programs with Ordered Disjunction (LPOD) is an extension of standa...

Computing Strong and Weak Permissions in Defeasible Logic

In this paper we propose an extension of Defeasible Logic to represent a...

Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary report

We analyze the problem of defining well-founded semantics for ordered lo...

A Framework for Compiling Preferences in Logic Programs

We introduce a methodology and framework for expressing general preferen...

Logic Programs with Compiled Preferences

We describe an approach for compiling preferences into logic programs un...

Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates

Logic programs with aggregates (LPA) are one of the major linguistic ext...