Premium
Logic Programs with Ordered Disjunction
Author(s) -
Brewka Gerhard,
Niemelä Ilkka,
Syrjänen Tommi
Publication year - 2004
Publication title -
computational intelligence
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
ISBN - 0-262-51129-0
DOI - 10.1111/j.0824-7935.2004.00241.x
Subject(s) - computer science , set (abstract data type) , preference relation , generator (circuit theory) , semantics (computer science) , programming language , logic program , theoretical computer science , preference , algorithm , mathematics , logic programming , power (physics) , statistics , physics , quantum mechanics
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.