Thomas Eiter
ABSTRACT
This paper addresses complexity issues for important problems arising with disjunctive databases. In particular, the complexity of inference of a literal and a formula from a propositional disjunctive database under a variety of well-known disjunctive database semantics is investigated, as well deciding whether a disjunctive database has a model under a particular semantics. The problems are located in appropriate slots of the polynomial hierarchy.
- 1.K. Apt, H. Blair, and A. Walker. Towards a Theory of Declarative Knowledge. In Minker {17}, pages 89-148. Google Scholar
Digital Library
- 2.N. Bidoit and C. Froidevaux. Negation by default and unstratifiable programs. Theoretical Computer Science, 78:85-112, 1991. Google ScholarDigital Library
- 3.M. Cadoli and M. Lenzerini. The Complexity of Closed World Reasoning and Circumscription. In Proceedings AAAI-90, pages 550-555, 1990.Google Scholar
- 4.M. Cadoli and M. Schaerf. A Survey on Complexity Results for Non-monotonic Logics. Technical report, Dipartimento di Informatica e Sistemistica, Universit#t di Roma "La Sapienza", 1992. Journal of Logic Programming, to appear.Google Scholar
- 5.E. Chart. A Possible Worlds Semantics for Disjunctive Databases. IEEE Transactions on Data and Knowledge Engineering, 1991. To appear.Google Scholar
- 6.A. Chandra and D. Harel. Horn Clause Queries and Generalizations. Journal of Logic Programming, 2:1- 15, 1985.Google ScholarCross Ref
- 7.T. Eiter and G. Gottlob. Propositional Circumscription and Extended Closed World Reasoning are IIP- complete. Technical Report CD-TR 91/20, Christian Doppler Laboratory for Expert Systems, Vienna University of Technology, Austria, May 1991. To appear in Theoretical Computer Science.Google Scholar
- 8.T. Eiter and G. Gottlob. On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Manuscript, March 1993.Google Scholar
- 9.J. Fern~ndez and J. Minker. Semantics of Disjunctive Deductive Databases. In Proceedings ICDT-9#, pages 21-50, Berlin, October 1992. Google ScholarDigital Library
- 10.M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In Proceedings Fifth Logic Programming Symposium, pages 1070-1080, C#tmbridge Mass., 1988. MIT Press.Google Scholar
- 11.M. Gelfond and H. Przymusinska. Negation as Failure: Careful Closure Procedure. Artificial Intelligence, 30:273-287, 1986. Google ScholarDigital Library
- 12.M. Gelfond, H. Przymusinska, and T. Przymusinski. On the Relationship Between Circumscription and Negation as Failure. Artificial Intelligence, 38:75-94, 1989. Google ScholarDigital Library
- 13.D. S. Johnson. A Catalog of Complexity Classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 2. Elsevier Science Publishers B.V. (North-Holl#nd), 1990. Google ScholarDigital Library
- 14.V. Lifschitz. Computing Circumscription. In Proceedings IJCAI-85, pages 121-127, 1985.Google Scholar
- 15.W. Marek and M. Truszczyfiski. Autoepistemic Logic. Journal of the A CM, 38(3):588-619, 1991. Google ScholarDigital Library
- 16.J. Minker. On Indefinite Data Bases and the Closed World Assumption. In Proceedings of the 6th Conference on Automated Deduction (CADE}, pages 292- 308, 1982. Google ScholarDigital Library
- 17.J. Minker, editor. Foundations of Deductive Databases and Logic Programming. Morgan Kaufman, Washington DC, 1988. Google ScholarDigital Library
- 18.C. H. Papadimitriou and M. Yannakakis. The Complexity of Facets (And Some Facets of Complexity). Journal of Computer and System Sciences, 28:244-259, 1984.Google ScholarCross Ref
- 19.T. Przymusinski. On the Declarative and Procedural Semantics of Stratified Deductive Databases. In Minker {17}, pages 193-216.Google Scholar
- 20.T. Przymusinski. Stable Semantics for Disjunctive Programs. New Generation Computing, 9:401-424, 1991.Google ScholarDigital Library
- 21.A. Rajasekar, J. Lobo, and J. Minker. Weak Generalized Closed World Assumption. Journal of Automated Reasoning, 5:293-307, 1989. Google ScholarDigital Library
- 22.R. Reiter. On Closed-World Databases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 55-76. Plenum Press, New York, 1978.Google ScholarCross Ref
- 23.K. Ross and R. Topor. Inferring Negative Information From Disjunctive Databases. Journal of Automated Reasoning, 4(2):397-424, 1988. Google ScholarDigital Library
- 24.C. Sakama. Possible Model Semantics for Disjunctive Databases. In Proceedings 1st lntl. Conf. DOOD-89, pages 337-351, Kyoto Japan, 1989.Google Scholar
- 25.M. Schaerf. Logic Programming and Autoepistemic Logics: New Relations and Complexity Results. Submitted, December 1992.Google Scholar
- 26.M. Schaerf. Negation and Minimality in Non-Horn Databases. In Proceedings PODS-93, 1993. Google ScholarDigital Library
- 27.J. Schlipf. A Survey of Complexity and Undecidability Results in Logic Programming. In H. Blair, W. Marek, A. Nerode, and J. Remmel, editors, lnfor. real Proceedings of the Workshop on Structural Gomplezity and Recursion-Theoretic Methods in Logic Pro- 9ramming, pages 93-102, Washington DC, November 13 1992. Cornell University, Mathematical Sciences institute.Google Scholar
- 28.A. van Gelder. Negation as Failure Using Tight Derivations for General Logic Programs. In Minker {17}, pages 1149-1176. Google ScholarDigital Library
- 29.A. van Gelder, K. Ross, and J. Schlipf. The Well- Founded Semantics for General Logic Programs. Journal o{ the A GM, 38(3):620-650, 1991. Google ScholarDigital Library
- 30.A. Yahya and L. Henschen. Deduction in Non-Horn Databases. Journal o/ A utomated Reasoning, 1(2):141- 160, 1985.Google Scholar
Index Terms
- Complexity aspects of various semantics for disjunctive databases
Recommendations
A New Partial Semantics for Disjunctive Deductive Databases
We propose a new partial semantics for disjunctive deductive databases that we call disjunctive well-founded semantics. This semantics extends the classical well-founded semantics of normal databases for disjunctive databases. We give a declarative ...
A New Partial Semantics for Disjunctive Deductive Databases
We propose a new partial semantics for disjunctive deductive databases that we call disjunctive well-founded semantics. This semantics extends the classical well-founded semantics of normal databases for disjunctive databases. We give a declarative ...
Using clausal deductive databases for defining semantics in disjunctive deductive databases
This paper investigates the novel concept of i>clausal deductive databases (cd-databases), which are special normal deductive databases - i.e., deductive databases which may contain default negation in rule bodies - over a typed meta-language i>L...
Comments