Expressive power and complexity of partial models for disjunctive deductive databases

Theoretical Computer Science

Volumn 206, Issue 1-2, 1998, Pages 181-218

  Eiter, Thomas ^a,b   Leone, Nicola ^b   Saccá, Domenico ^c  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Complexity; Deductive databases; Disjunctive logic programming; Expressive power; Partial model semantics

Indexed keywords

EID: 0001260337     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00129-1     Document Type: Article

References (60)

1. A. Abiteboul, E. Simon, V. Vianu, Non-deterministic languages to express deterministic transformations, in: Proc. PODS-90, 1990, 218-229.
2. S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases, Addison-Wesley, Reading, MA, 1995.
3. K.R. Apt, R.N. Bol, Logic programming and negation: a survey, J. Logic Programming 19/20 (1994) 9-71.
4. C. Baral, J. Lobo, J. Minker, Generalized disjunctive well-founded semantics for logic programs: declarative semantics, in: Z. Ras, M. Zemenkova, M.L. Emrich (Eds.), Proc. 4th Internat. Symp. on Methods for Intelligent Systems (ISMIS-90), North-Holland, 1990, Amsterdam, pp. 465-473.
5. C. Baral, V. Subrahmanian, Stable and extension class theory for logic programs and default logic, J. Automated Reasoning 8 (1992) 345-366.
6. R. Ben-Eliyahu, R. Dechter, Prepositional semantics for disjunctive logic programs, In: Proc. Joint Internat. Conf. and Symp. on Logic Programming (JICSLP-92), Washington, DC, November 1992, pp. 813-827.
7. R. Ben-Eliyahu, R. Dechter, Prepositional semantics for disjunctive logic programs, Ann. Math. Artificial Intelligence 12 (1994) 53-87.
8. R. Ben-Eliyahu, L. Palopoli, Reasoning with minimal models: efficient algorithms and applications, in: Proc. 4th Internat. Conf. on Principles of Knowledge Representation and Reasoning (KR-94), 1994, pp. 39-50.
9. N. Bidoit, Negation in rule-based database systems: a survey, Theoret. Comput. Sci. 78 (1991) 3-83.
10. N. Bidoit, C. Froidevaux, General logic databases and programs: default semantics and stratification, Inform. Comput. 19 (1991) 15-54.
11. F. Cacace, S. Ceri, S. Crespi-Reghizzi, L. Tanca, R. Zicari, Integrating object-oriented data modeling with a rule-based programming paradigm, in: Proc. 1990 ACM-SIGMOD Internat. Conf., Atlantic City, NJ, 23-25, May 1990, pp. 225-236.
12. M. Cadoli, L. Palopoli, Circumscribing DATALOG: expressive power and complexity, Theoret. Comput. Sci., to appear.
13. M. Cadoli, M. Schaerf, A survey of complexity results for non-monotonic logics, J. Logic Programming 17 (1993) 127-160.
14. S. Ceri, G. Gottlob, L. Tanca, Logical Programming and Databases, Springer, Berlin, 1990.
15. A. Chandra, D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25 (1982) 99-128.
16. D. Chimenti, R. Gamboa, R. Krishnamurthy, S. Naqvi, S. Tsur, C. Zaniolo, The LDL system prototype, IEEE TKDE, vol. 2, no. 1, 1990.
17. 2-complete, Inform. Processing Lett. 34 (1990) 289-291.
18. A. Dawar, A restricted second order logic for finite structures, in: D. Leivant (Ed.), Proc. Workshop on Logic and Computational Complexity, Lecture Notes in Computer Science, vol. 960, Springer, Berlin, 1995.
19. J. Dix, Semantics of logic programs: their intuitions and formal properties, An Overview, in: Logic, Action and Information. Proc. Konstanz Collo. in Logic and Information (LogIn'92), DeGruyter, Berlin, 1995, pp. 241-329.
20. P. Dung, Negation as hypotheses: an abductive foundation for logic programming, in: Proc. ICLP-91, MIT Press, Cambridge, MA, 1991, pp. 3-17.
21. T. Eiter, G. Gottlob, On the computational cost of disjunctive logic programming: propositional case, Ann. Math. Artificial Intelligence, 15(3/4) (1995) 289-323. (Abstract under different title in Proc. PODS 93.)
22. T. Eiter, G. Gottlob, H. Mannila, Adding disjunction to datalog, in: Proc. PODS-94, 1994, pp. 267-278. Full paper, Disjunctive Datalog, ACM Trans. Database Systems, September 1997.
23. T. Eiter, N. Leone, D. Saccà, On the partial semantics for disjunctive deductive databases, Ann. Math. Artificial Intelligence, 17(1/2): 59-96, special issue on advances in logic-based database languages, 1997.
24. A. Kakas, P. Mancarella, Preferred extensions are partial stable models, J. Logic Programming 14 (1992) 341-348.
25. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R.M. Karp (Ed.), Complexity of Computation, AMS, Providence, RI, 1974, pp. 43-74.
26. J.A. Fernández, J. Minker, Semantics of disjunctive deductive databases, in: Proc. 4th Internat. Conf. on Database Theory (ICDT-92), Berlin, October, 1992, pp. 21-50.
27. M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: Proc. 5th Logic Programming Symposium (ILPS '88), MIT Press, Cambridge, MA, 1988, pp. 1070-1080.
28. M. Gelfond, V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Comput. 9 (1991) 365-385.
29. G. Gottlob, Complexity and expressive power of disjunctive logic programming, in: M. Bruynooghe (Ed.), Proc. Internat. Logic Programming Symposium (ILPS), Ithaca, NY, MIT Press, Cambridge, MA, 1994, pp. 23-42.
30. G. Gottlob, N. Leone, H. Veith, Second-order logic and the weak exponential hierarchies, in: J. Wiedermann, P. Hajek (Eds.), Proc. Conf. on Mathematical Foundations of Computer Science (MFCS-95), Lecture Notes in Computer Science, vol. 969, Prague, Springer, Berlin, 1995, pp. 66-81. Full paper available as CD/TR 95/80, Christian Doppler Lab for Expert Systems, Information Systems Department, TU, Wien.
31. S. Greco, N. Leone, P. Rullo, COMPLEX: an object-oriented logic programming system, IEEE TKDE, 4 No. (4) (1992) pp. 344-359.
32. P. Kanellakis, Elements of relational database theory, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science B, North-Holland, Amsterdam, 1990.
33. Ph. Kolaitis, The expressive power of stratified logic programs, Inform. Comput. 90 (1991) 50-66.
34. Ph. Kolaitis, C.H. Papadimitriou, Why not negation by fixpoint? J. Comput. System Sci. 43 (1991) 125-144.
35. Ph. Kolaitis, M. Vardi, On the expressive power of datalog: tools and a case study, J. Comput. System Sci. 51 (1995) 110-134.
36. N. Leone, P. Rullo, A. Mecchia, G. Rossi, A deductive environment for dealing with objects and non-monotonic reasoning, IEEE Trans. Knowledge Data Eng., 1997.
37. J. LLoyd, Foundations of Logic Programming, Springer, Berlin, 1984.
38. J. Lobo, J. Minker, A. Rajasekar, Foundations of Disjunctive Logic Programming, MIT Press, Cambridge, MA, 1992.
39. W. Marek, M. Truszczyński, Autoepistemic logic, J. ACM 38 (3) (1991) 588-619.
40. J. Minker, On indefinite data bases and the closed world assumption, in: D.W. Loveland (Ed.), Proc. 6th Conf. on Automated Deduction (CADE-82), Lecture Notes in Computer Science, vol. 138, Springer, Berlin, 1982, pp. 292-308.
41. J. Minker, Overview of disjunctive logic programming, Ann. Math. Artificial Intelligence 12 (1994) 1-24.
42. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
43. G. Phipps, M.A. Derr, K.A. Ross, Glue-NAIL!: a deductive database system, in: Proc. ACM-SIGMOD Conf. on Management of Data, 1991, pp. 308-317.
44. T. Przymusinski, Stable semantics for disjunctive programs, New Generation Comput. 9 (1991) 401-424.
45. R. Ramakrishnan, D. Srivastava, S. Sudarshan, CORAL - control, relations and logic, in: Proc. 18th VLDB Conf., Vancouver, British Columbia, Canada, 1992.
46. K.A. Ross, The well founded semantics for disjunctive logic programs, in: W. Kim, J.-M. Nicolas, S. Nishio (Eds.), Proc. 1st Internat. Conf. on Deductive and Object-Oriented Databases (DOOD-89), Elsevier, Amsterdam, 1990, pp. 385-402.
47. D. Saccà, The expressive powers of stable models for bound and unbound DATALOG queries, J. Comput. System Sci. 54(3) (1997) 441-464.
48. D. Saccà, Deterministic and nondeterministic stable model semantics for unbound DATALOG queries, in: G. Gottlob, M.Y. Vardi (Eds.), Proc. 5th Internat. Conf. on Database Theory (ICDT-95), Lecture Notes in Computer Science, vol. 893, 1995, pp. 353-367.
49. D. Saccà, C. Zaniolo, Stable models and non-determinism in logic programs with negation, in: Proc. PODS-90, 1990, pp. 205-218.
50. D. Saccá, C. Zaniolo, Deterministic and non-deterministic stable models, J. Logic Comput., 1997, to appear.
51. C. Sakama, Possible model semantics for disjunctive databases, in: W. Kim, J.-M. Nicolas, S. Nishio (Eds.), Proc. 1st Internat. Conf. on Deductive and Object-Oriented Databases (DOOD-89), 1990, pp. 1055-1060.
52. J. Schlipf, The expressive powers of logic programming semantics, J. Comput. System Sci. 51 (1) (1995) 64-86.
53. J. Schlipf, Complexity and undecidability results in logic programming, Ann. Math. Artificial Intelligence 15 (3/4) (1995) 257-288.
54. L.J. Stockmeyer, The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1977) 1-22.
55. J.D. Ullman, Principles of Database and Knowledge Base Systems, Computer Science Press, Rockville, MD, 1989.
56. A. van Gelder, K. Ross, J. Schlipf, The well-founded semantics for general logic programs, J. ACM 38 (3) (1991) 620-650.
57. M. Vardi, Complexity of relational query languages, in: Proc. 14th ACM STOC, San Francisco, 1982, pp. 137-146.
58. J.-H. You, L. Yuan, Three-valued formalization of logic programming: is it needed? in: Proc. PODS-90, 1990, pp. 372-182.
59. J.-H. You, L. Yuan, A three-valued semantics for deductive databases and logic programs, J. Comput. System Sci. 49 (1994) 334-361.
60. J.-H. You, L. Yuan, On the equivalence of semantics for normal logic programming, J. Logic Programming 22(3) (1995) 211-222.