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 ¬ ?
Most of the work of the third author has been carried out while he was visiting the TU Vienna in spring 1993.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Balcâzar, A. Lozano, and J. Torân. The Complexity of Algorithmic Problems on Succinct Instances. In R. Baeta-Yates and U. Manber (eds), Computer Science, 351–377. 1992.
J. Dix. Classifying Semantics of Disjunctive Logic Programs. In Proc. JICSLP-92, pages 798–812, Washington DC, November 1992.
T. Eiter and G. Gottlob. Complexity Aspects of Various Semantics for Disjunctive Databases. In Proc. PODS-93, pp. 158–167, 1993.
T. Eiter, G. Gottlob, and H. Mannila. Adding Disjunction to Datalog. In Proc. PODS-94, May 1994.
M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Gen. Comp., 9: 365–385, 1991.
P. Kanellakis. Elements of Relational Database Theory. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science B, 1990.
J. Minker. On Indefinite Data Bases and the Closed World Assumption. In Proc. CADE-82, pp. 292–308, 1982.
T. Przymusinski. On the Declarative and Procedural Semantics of Stratified Deductive Databases. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 193–216. Morgan Kaufman, Washington DC, 1988.
T. Przymusinski. Stable Semantics for Disjunctive Programs. New Gen. Comp., 9: 401–424, 1991.
J. Schlipf. The Expressive Powers of Logic Programming Semantics. Proc. PODS-90,pp. 196–204.
M. Vardi. Complexity of relational query languages. In Proc. STOC-82, pp. 137–146, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eiter, T., Gottlob, G., Mannila, H. (1994). Disjunctive Logic Programming over Finite Structures. In: Wolfinger, B. (eds) Innovationen bei Rechen- und Kommunikationssystemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51136-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-51136-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58313-4
Online ISBN: 978-3-642-51136-3
eBook Packages: Springer Book Archive