Abstract
Disjunctive logic programming gained increasing interest recently, and several semantics for disjunctive logic programs, i.e., programs with clauses that allow for a disjunction of atoms in the head, have been developed; many of them are extensions of well-known semantics of logic programming. Natural questions arising with such extensions are the following: 1 What is the gain of allowing disjunction measured by the increase of expressive power, i.e., the class of queries over all collections of ground facts (i.e., relations) that can be implemented by a logic program. Besides, is such an increase necessary to solve relvant queries in practice? 2. How is the computational complexity affected by allowing disjunction ? 3. How do different semantics for disjunctive logic programs compare with respect to 1. and 2., and what is the effect of allowing other constructs like inequality ≠ and negation ¬ ?
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
