Logic Programs with Ordered Disjunction
Authors:
- 20 April 2004
- journal article
- Published by Wiley in Computational Intelligence
- Vol. 20 (2) , 335-357
Abstract
Logic programs with ordered disjunction (LPODs) contain a new connective which allows representing alternative, ranked options for problem solutions in the heads of rules: A×B intuitively means that 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. We show how LPODs can be implemented using answer set solvers for normal programs. The implementation is based on a generator, which produces candidate answer sets and a tester which checks whether a given candidate is maximally preferred and produces a better candidate if it is not. We also discuss the complexity of reasoning tasks based on LPODs and possible applications.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Diagnostic reasoning with A-PrologTheory and Practice of Logic Programming, 2003
- A framework for compiling preferences in logic programsTheory and Practice of Logic Programming, 2003
- Answer set programming and plan generationArtificial Intelligence, 2002
- Enhancing Disjunctive Datalog by constraintsIEEE Transactions on Knowledge and Data Engineering, 2000
- Preferred answer sets for extended logic programsArtificial Intelligence, 1999
- Reasoning with prioritized defaults1998
- Semiring-based constraint satisfaction and optimizationJournal of the ACM, 1997
- Stable models and their computation for logic programming with inheritance and true negationThe Journal of Logic Programming, 1996
- Partial constraint satisfactionArtificial Intelligence, 1992
- A Fixpoint Semantics for Ordered LogicJournal of Logic and Computation, 1990