A logical characterisation of ordered disjunction

Issue title: Answer Set Programming

Article type: Research Article

Authors: Cabalar, Pedro

Affiliations: Department of Computer Science, University of Corunna, Corunna, Spain. E-mail: [email protected]

Abstract: In this paper we consider a logical treatment for the ordered disjunction operator × 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 × 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 × with regular disjunction.

Keywords: Answer set programming, logic programs with ordered disjunction, preferences, equilibrium logic

DOI: 10.3233/AIC-2011-0494

Journal: AI Communications, vol. 24, no. 2, pp. 165-175, 2011