Extending stratified datalog to capture complexity classes ranging from P to QH

Acta Informatica

Volumn 37, Issue 10, 2001, Pages 699-725

  Greco, Sergio ^a   Saccà, Domenico ^a   Zaniolo, Carlo ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035385038     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00013306     Document Type: Article

References (41)

1. 1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases, Reading, MA: Addison-Wesley, 1995.
2. 2. Abiteboul, S., E. Simon, E., V. Vianu, V.: Non-Deterministic Languages to Express Deterministic Transformations In: Proc. of the Ninth ACM PODS Conference, pp 215-229, 1990.
3. 3. Abiteboul, S., V. Vianu, V.: Datalog Extensions for Databases Queries and Updates. J Comput Syst Sci 43, 62-124, 1991.
4. 4. Afrati, F., Cosmadakis, S.S., Yannakakis, M.: On Datalog vs. Polynomial Time. In: Proc. of the Tenth ACM PODS Conference, 13-25, 1991.
5. 5. Apt, C., Blair, H., Walker, A.: Towards a Theory of Declarative Knowledge. In: Minker, J. (ed.) Proc. Work, on Found. of Deductive Database and Logic Prog. 89-148, 1988.
6. 6. Chandra, A., Harel, D.: Structure and Complexity of Relational Queries. J Comput Syst Sci 25(1), 99-128, 1982.
7. 7. Chandra, A., Harel, D.: Horn Clauses Queries and Generalizations. J Logic Program 2(1), 1-15, 1985.
8. 8. Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM Trans Database Syst 22(3), 364-418, 1997.
9. 9. Fagin, R.: Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In: Karp, R. (ed.) Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, 43-73, 1974.
10. 10. Gelfond, M., Lifschitz, V.: The Stable Model Semantics of Logic Programming. Proc. of the Fifth Intern. Conf. on Logic Programming, 1070-1080, 1988.
11. 11. Giannotti, F., Pedreschi, D., Saccà, D., Zaniolo, C.: Nondeterminism in Deductive Databases. Proc. 2nd DOOD Conference, pp 129-146, 1991.
12. 12. Giannotti, F., Pedreschi, D., Zaniolo, C.: Semantics and Expressive Power of Non-Deterministic Constructs in Deductive Databases. J Comput Syst Sci, 2001 (to appear).
13. 13. Greco S., Saccà D.: "Possible is Certain" is Desirable and Can Be Expressive. Ann Math Artif Intell 019(1-2), 147-168, 1997.
14. p, In Proc. of the Fifth Int. Conf. on Database Theory, pp 82-96, 1995.
15. 15. Greco, S., Zaniolo, C., Ganguly, S.: Greedy by Choice. Proc. of the Eleventh ACM PODS Conference, 105-163, 1992.
16. ¬. Inform Comput 153(1), 81-98, 1999.
17. 17. Immerman, N.: Languages that Capture Complexity Classes. SIAM J Comput 16(4), 760-778, 1987.
18. 18. Johnson, D. S.: A Catalog of Complexity Classes. In: van Leeuwen, J. (ed) Handbook of Theoretical Computer Sciences, Vol. A, North-Holland, pp 67-161, 1990.
19. 19. Kanellakis, P. C.: Elements of Relational Databases Theory. In: van Leeuwen, Z. (ed) Handbook of Theoretical Computer Sciences, Vol. B, North-Holland, 1075-1155, 1990.
20. 20. Kolaitis, P.: The Expressive Power of Stratified Logic Programs. Infor Comput 90, 50-66, 1990.
21. 21. Kolaitis, P., Papadimitriou, C.: Why not Negation by Fixpoint? J Comput Syst Sci 43, 125-144, 1991.
22. 22. Eiter, T., Leone, N., Mateis, C., Pfeifer G., Scarcello, F.: A Deductive System for Nonmonotonic Reasoning. Proceedings International on Logic Programming and Nonmonotonic Reasoning, pp 363-374, 1997.
23. 23. Lloyd, J.L.: Foundations of Logic Programming. Berlin: Springer 1987.
24. 24. Marek, W., Truszczynski, M.: Autoepistemic Logic. Journal of the ACM 38(3), 588-619, 1991.
25. 25. Naqvi, S., Tsur, S.: A Logic Language for Data and Knowledge Bases. Computer Science Press, 1989.
26. 26. Papadimitriou, C.: A Note on the Expressive Power of Prolog. Bull of the EATCS 26, 21-23, 1985.
27. 27. Papadimitriou, C.: Computational Complexity. Reading, MA: Addison-Wesley, 1994.
28. 28. Przymusinska, A., Przymusinski, T.: Weakly Perfect Model Semantics for Logic Programs. Proceedings of the Fifth Intern. Conference on Logic Programming, 1106-1122, 1988.
29. 29. Przymusinski T.C.: Well-founded Semantics Coincides with Three-valued Stable Semantics. Foundamenta Informaticae 13, 445-463, 1990.
30. 30. Ramakrisnhan, R., Srivastava, D., Sudanshan, S.: CORAL - Control, Relations and Logic. Proc. of 18th Conf. on Very Large Data Bases, 238-250, 1992.
31. 31. Saccà D.: Multiple total stable models are definitely needed to solve unique solution problems. Inform Process Lett 58, 249-254, 1996.
32. 32. Saccà, D.: The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries. J Comput Syst Sci 54(3), 441-464, 1997.
33. 33. Saccà, D., Zaniolo, C.: Stable Models and Non-Determinism in Logic Programs with Negation. Proc. ACM PODS Symp., 205-218, 1990.
34. 34. Saccà, D., Zaniolo, C.: Stable models and nondeterminism in logic programs with negation. J Logic Comput 7(5), 555-579, 1997.
35. 35. Schlipf, J.S.: The Expressive Powers of the Logic Programming Semantics. J Comput Syst Sci 51(1), 64-86, 1995.
36. 36. Schlipf, J.S.: Complexity and Undecidability Results for Logic Programming. Ann Math Artif Intell 15(3-4), 257-288, 1995.
37. 37. Ullman, J.D.: Principles of Databases and Knowledge Base Systems, Vol. I and II. Computer Science Press, 1988.
38. 38. Van Gelder, A.: Negation as failure using tight derivations for general logic programs. J Log Program 6(1), 109-133, 1989.
39. 39. Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620-650, 1991.
40. 40. Van Gelder, A.: The Alternating Fixpoint of Logic Programs with Negation. J Comput Syst Sci 43(1), 185-221, 1992.
41. 41. Vardi, M.: The Complexity of Relational Query Languages. Proceedings of the 14th ACM Symposium on Theory of Computing, 137-146, 1982.