DATALOG queries with stratified negation and choice: From P to DP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 893, Issue , 1995, Pages 82-96

  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

COMPUTATIONAL COMPLEXITY; SEMANTICS;

COMPLEXITY CLASS; COMPUTATIONAL TRACTABILITY; DATALOG PROGRAMS; DECLARATIVE SEMANTICS; NON DETERMINISM; QUERY EXECUTION; STRATIFIED NEGATION; UNIFIED SOLUTIONS;

QUERY PROCESSING;

EID: 84947813098     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58907-4_8     Document Type: Conference Paper

References (29)

1. S. Abiteboul, E. Simon, V. Vianu. Non-Deterministic Language to Express Deterministic Transformation. In Proc. of the Ninth ACM PODS Conference, 1990.
2. S. Abiteboul and V. Vianu. Datalog Extensions for Databases Queries and Updates. In Journal of Computer and System Science, 43, pages 62-124, 1991.
3. F. Afrati, S. S. Cosmadakis, M. Yannakakis. On Datalog vs. Polynomial Time. In Proc. of the Tenth ACM PODS Conference, pages 13-25, 1991.
4. C. Apt, H. Blair, A Walker. Towards a Theory of Declarative Knowledge. In Proc. Work. on Found. of Deductwe Database and Logzc Prog., (Minker Ed.), 1988.
5. A. Chandra and D. Hard. Structures and Complexity of Relational Queries. In Journal of Computer and System Science, 25, pages 99-128, 1982.
6. A. Chandra and D. Harel. Horn clause and generalizations. In Journal of Logic Programming, vol. 2, No. 1, pages 1-15, 1985.
7. R. Fagin. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets, in Complexity of Computation (R. Karp, Ed.), SIAM-AMS Proc., 1974.
8. M. Gelfond and V. Lifschitz. The stable model semantics of logic programming. In Proc. of the Fifth Intern. Conf. on Logic Programming, pages 1070-1080, 1988.
9. F. Giannotti, D. Pedreschi, D. Sacch, and C. Zaniolo. Nondeterminism in deductive databases. In Proc. 2nd DOOD Conference, pages 129-146, 1991.
10. S. Greco, C. Zaniolo, and S. Ganguly. Greedy by Choice. In Proc. of the Eleventh ACM PODS Conference, pages 105-163, 1992.
11. N. Immerman. Languages that Capture Complexity Classes. In SIAM Journal of Computing, 16(4), pages 760-778, 1987.
12. D. S. Johnson. A Catalog of Complexity Classes, In Handbook of Theoretical Computer Science, Vol. 1, (Ed. J. Leewen) North-Holland, pages 67-161, 1990.
13. P. C. Kanellakis Elements of Relational Databases Theory. In Handbook of Theoretical Computer Science, (Ed. J. Leewen) North-Holland, pages 1075-1155, 1990.
14. P. Kolaitis. The Expressive Power of Stratified Logic Programs. Information an Computation, 90, pages 50-66, 1990.
15. P. Kolaitis and C. Papadimitriou. Why not negation by fixpoint. In Journal of Computer and System Science, 43, pages 125-144, 1991.
16. J. W. Lloyd. Foundations of Logic Programming, Springer Verlag, Berlin, 1987.
17. W. Marek, M. Truszczynski. Autoepistemic Logic. Journal of ACM, 38(3): 588-619, 1991.
18. S. Naqvi and S. Tsur. A logic language for data and knowledge bases. Computer Science Press, 1989.
19. C. Papadimitriou. A Note on the Expressive Power of Prolog. In Bull of the EATCS, 26, pages 21-23, 1985.
20. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
21. R. Ramakrisnhan, D. Srivastava, and S. Sudanshan. CORAL--Control, Relations and Logic. In Proc. of 18th VLDB Conference, 1992.
22. D. Sacch. The Expressive Powers of Stable Models for Bound and Unbound Queries. this volume, 1994.
23. D. Saccà and C. Zaniolo. Stable models and non-determinism in logic programs with negation. In Proc. of the Ninth ACM PODS Conference, pages 205-217, 1990.
24. J. S. Schlipf. The expressive power of the logic programming semantics. In Proc. of the Ninth ACM PODS Conference, pages 196-204, 1990.
25. J. S. Schlipf. A Survey of Complexity and Undecidability Results in Logic Programming. Work. Structural Compl. and Recursion-Theoretic Met. in L. P., 1993.
26. J. D. Ullman. Principles of Databases and Knowledge Base Systems, Vol. I and II. Computer Science Press, 1988.
27. A. Van Gelder. Negation as failure using tight derivations for general logic programs. Journal of Logic Programming, vol. 6, No. 1, pages 109-133, 1989.
28. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. Journal of ACM, 38(3): 620-650, 1991.
29. M. Vardi. The Complexity of Relational Query Languages. In Proceedings of the l4th ACM Symposium on Theory of Computing, pages 137-146, 1982.