Complexity and Expressive Power of Deterministic Semantics for DATALOG

Information and Computation

Volumn 153, Issue 1, 1999, Pages 81-98

  Greco, Sergio ^a   Saccà, Domenico ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0007114521     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2800     Document Type: Article

References (36)

1. Abiteboul, S., Hull, R., and Vianu, V. (1994), "Foundations of Databases," Addison-Wesley, Reading, MA.
2. Abiteboul, S., Simon, E., and Vianu, V. (1990), Non-deterministic languages to express deterministic transformations, in "Proceedings of the 9th ACM Symposium on Principles of Database Systems," pp. 218-229.
3. Buccafurri, F., Greco, S., and Saccà, D. (1997), The expressive power of unique total stable model semantics, in "Proceedings 22nd International Colloquium on Automata Languages and Programming," pp. 849-859.
4. Blass, A., and Gurevich, Y. (1982), On the unique satisfiability problem, Inform. and Control 55(1-3), 80-88.
5. Ceri, S., Gottlob, G., and Tanca, L. (1990), "Logic programming and Databases," Springer-Verlag, New York/Berlin.
6. Chandra, A., and Harel, D. (1982), Structure and complexity of relational queries, J. Comput. System Sci. 25(1), 99-128.
7. Chen, Z. Z., and Toda, S. (1995), The complexity of selecting maximal solutions, Inform. and Comput. 119, 231-239.
8. Eiter, T., Gottlob, G., and Mannila, H. (1997), Disjunctive datalog, ACM Trans. Database Systems 22(3), 364-418.
9. Fagin, R. (1974), Generalized first-order spectra and polynomial-time recognizable sets, in "Complexity of Computation" (R. Karp, Ed.), SIAM-AMS Proc., Vol. 7, pp. 43-73, SIAM, Philadelphia.
10. Fitting, M. (1994), On prudent bravery and other abstractions, unpublished manuscript.
11. Fitting, M. (1985), A Kripke-Kleene semantics for logic programs, J. Logic Programming 2(4), 295-312.
12. Gelfond, M., and Lifschitz, V. (1988), The stable model semantics for logic programming, in "Proceedings of the 5th International Conference on Logic Programming," pp. 1070-1080.
13. Greco, S., and Saccà, D. (1997), "Possible is Certain" is desirable and can be expressive, Ann. Math. Artif. Intel. 19, 147-168.
14. ¬: Complexity and expressive power, in "Proceedings of the International Conference on Deductive and Object Oriented Databases," pp. 337-350.
15. Greco, S., Saccà, D., and Zaniolo, C. (1995), DATALOG queries with stratified negation and choice: From ℘ to script D sign℘, in "Proceedings of the 5th International Conference on Database Theory," pp. 82-96.
16. Grumbach, S., Lacroix, Z., and Lindell, S. (1995), Implicit definitions on finite structures, in "Proceedings of the Conference on Computer Science Logic," pp. 252-265.
17. Gurevich, Y. (1988), Logic and the Challenge of Computer Science, in "Trends in Theoretical Computer Science" (E. Borger, Ed.), Comput. Sci. Press, New York.
18. Johnson, D. S. (1990), A catalog of complexity classes, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. 1, pp. 67-254, North-Holland, Amsterdam.
19. Kolaitis, P. G. (1990), Implicit definability on finite structures and unambiguous computations, in "Proceedings 5th IEEE Symposium on Logic in Computer Science," pp. 168-180.
20. Kolaitis, P. G., and Papadimitriou, C. H. (1991), Why not negation by fixpoint?, J. Comput. System Sci. 43(1), 125-144.
21. Laenens, E., Vermeir, D., and Zaniolo, C. (1992), Logic programming semantics made easy, in "Proceedings of the Int. Colloquium on Automata, Languages and Programming," pp. 499-508.
22. Lloyd, J. W. (1987), "Foundations of Logic Programming," Springer-Verlag, Berlin.
23. Marek, W., and Truszcynski, M. (1991), Autoepistemic Logic, J. Assoc. Comput. Mach. 38(3), 588-619.
24. Papadimitriou, C. (1994), "Computational Complexity," Addison-Wesley, Reading, MA.
25. Papadimitriou, C. H., and Yannakakis, M. (1982), The complexity of facets (and some facets of complexity), J. Comput. System Sci. 28(2), 244-259.
26. Przymusinski, T. C. (1990), Well-founded semantics coincides with three-valued stable semantics, Fundamenta Inform. 13, 445-463.
27. Saccà, D. (1996), Multiple total stable models are definitely needed to solve unique solution programs, Inform. Process. Lett. 58(5), 249-254.
28. Saccà, D. (1997), The expressive powers of stable models for bound and unbound queries, J. Comput. System Sci. 54(3), 441-464.
29. Saccà, D., and Zaniolo, C. (1990), Stable models and non-determinism in logic programs with negation, in "Proceedings ACM Symposium on Principles of Database Systems," pp. 205-218.
30. Saccà, D., and Zaniolo, C. (1997), Deterministic and non-deterministic stable models, J. Logic Comput. 7(5), 555-579.
31. Schlipf, J. S. (1990), The expressive powers of the logic programming semantics, in "Proceedings ACM Symposium on Principles of Database Systems," pp. 196-204.
32. Smullyan, R. M. (1978), "What Is the Name of This Book?: The Riddle of Dracula and Other Logical Puzzles," Prentice-Hall, Englewood Cliffs, NJ.
33. Ullman, J. D. (1988), "Principles of Database and Knowledge Base Systems," Comput. Sci. Press, New York.
34. Van Gelder, A. (1992), The alternating fixpoint of logic programming with negation, J. Comput. System Sci. 47(1), 125-144.
35. Van Gelder, A., Ross, K., and Schlipf, J. S. (1991), The well-founded semantics for general logic programs, J. Ass. Comput. Mach. 38(3), 620-650.
36. Vardi, M. Y. (1982), The complexity of relational query languages, in "Proceedings ACM Symposium on Theory of Computing," pp. 137-146.