A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction

by   Angelos Charalambidis, et al.
University of Athens

Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing alternatives with decreasing degrees of preference in the heads of program rules. Despite the fact that the operational meaning of ordered disjunction is clear, there exists an important open issue regarding its semantics. In particular, there does not exist a purely model-theoretic approach for determining the most preferred models of an LPOD. At present, the selection of the most preferred models is performed using a technique that is not based exclusively on the models of the program and in certain cases produces counterintuitive results. We provide a novel, model-theoretic semantics for LPODs, which uses an additional truth value in order to identify the most preferred models of a program. We demonstrate that the proposed approach overcomes the shortcomings of the traditional semantics of LPODs. Moreover, the new approach can be used to define the semantics of a natural class of logic programs that can have both ordered and classical disjunctions in the heads of clauses. This allows programs that can express not only strict levels of preferences but also alternatives that are equally preferred. This work is under consideration for acceptance in TPLP.


page 1

page 2

page 3

page 4


A Compiler for Ordered Logic Programs

This paper describes a system, called PLP, for compiling ordered logic p...

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

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

Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective

Logic Programs with Ordered Disjunction (LPODs) extend classical logic p...

Truth and Preferences – A Game Approach for Qualitative Choice Logic

In this paper, we introduce game-theoretic semantics (GTS) for Qualitati...

Convergence of Datalog over (Pre-) Semirings

Recursive queries have been traditionally studied in the framework of da...

Lexicographic Logic: a Many-valued Logic for Preference Representation

Logical formalisms provide a natural and concise means for specifying an...

Exception-Based Knowledge Updates

Existing methods for dealing with knowledge updates differ greatly depen...

Please sign up or login with your details

Forgot password? Click here to reset