Sciweavers

Share
KR
2004
Springer

On Eliminating Disjunctions in Stable Logic Programming

9 years 2 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge representation and reasoning. However, disjunction is often not really needed, in that an equivalent program without disjunction can be given. In this paper, we consider the question, given a disjunctive logic program, P, under which conditions an equivalent normal (i.e., disjunction-free) logic program P exists. In fact, we study this problem under different notions of equivalence, viz. for ordinary equivalence (considering the collections of all stable models of the programs) as well as for the more restrictive notions of strong and uniform equivalence. We resolve the issue for propositional programs on which we focus here, and present a simple, appealing semantic criterion from which all disjunctions can be eliminated under strong equivalence. Testing this criterion is coNP-complete, but the class of programs ...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where KR
Authors Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran
Comments (0)
books