DeepAI AI Chat
Log In Sign Up

Logic Programming with Ordered Disjunction

07/11/2002
by   Gerhard Brewka, et al.
UNIVERSITÄT LEIPZIG
0

Logic programs with ordered disjunction (LPODs) combine ideas underlying Qualitative Choice Logic (Brewka et al. KR 2002) and answer set programming. Logic programming under answer set semantics is extended with a new connective called ordered disjunction. The new connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: A × B intuitively means: if possible A, but if A is not possible then at least B. The semantics of logic programs with ordered disjunction is based on a preference relation on answer sets. LPODs are useful for applications in design and configuration and can serve as a basis for qualitative decision making.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/08/2000

A Compiler for Ordered Logic Programs

This paper describes a system, called PLP, for compiling ordered logic p...
11/22/2010

A Logical Charaterisation of Ordered Disjunction

In this paper we consider a logical treatment for the ordered disjunctio...
07/15/2002

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

We analyze the problem of defining well-founded semantics for ordered lo...
03/04/2002

A Framework for Compiling Preferences in Logic Programs

We introduce a methodology and framework for expressing general preferen...
09/26/2022

Truth and Preferences – A Game Approach for Qualitative Choice Logic

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

Logic Programs with Compiled Preferences

We describe an approach for compiling preferences into logic programs un...
10/18/2012

Module Theorem for The General Theory of Stable Models

The module theorem by Janhunen et al. demonstrates how to provide a modu...