Datalog with non-deterministic choice computes NDB-PTIME

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

Volumn 760 LNCS, Issue , 1993, Pages 49-66

  Corciulo, Luca ^b   Giannotti, Fosca ^a   Pedreschi, Dino ^b  

^a ISTI CNR   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DATABASE LANGUAGE; DATALOG; DYNAMIC CHOICE; EXPRESSIVE POWER; NON-DETERMINISTIC TIME; NONDETERMINISTIC PROBLEMS;

OBJECT-ORIENTED DATABASES;

EID: 33745081114     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57530-8_4     Document Type: Conference Paper

References (21)

1. K. R. Apt. Introduction to Logic Programming. In: Handbook of Theoretical Computer Science, vol B. (Ed. J. van Leeuwen) (1990). pp. 493-574.
2. S. Abiteboul, E. Simon, V. Vianu. Non-Deterministic Language to Express Deterministic Transformation. Proceedings of ACM Symposium on Principles of Database Systems, 1990. pp. 218-229.
3. S. Abiteboul, V. Vianu. Transaction Languages for Databases Update and Specification. INRIA Technical Report n. 715 (1987).
4. S. Abiteboul, V. Vianu. Procedural Languages for Database Queries and Updates. Journal of Computer and System Science 41 (2) (1990).
5. S. Abiteboul, V. Vianu. Fixpoint Extension of First Order Logic and Datalog-Like Languages. Proc. 4th Symp on Logic in Computer Science (LICS). IEEE Computer Press (1989). pp. 71-89.
6. S. Abiteboul, V. Vianu. Non-Determinism in Logic Based Languages. Annals of Mathematics and Artificial Intelligence 3 (1991). pp. 151-186.
7. A. Chandra, D. Harel. Structures and Complexity of Relational Queries. Journal of Computer and System Science 25 (1982). pp. 99-128.
8. D. Chimenti, et al., The CDC System Prototype. IEEE Journal on Data and Knowledge Engineering, Vol. 2, No. 1, (1990). pp. 76-90.
9. E.F. Codd. Relational Completeness of Database Sublanguages. Data Base Systems, (Ed. R. Rustin), Prentice-Hall, Englewood Cliffs, NJ (1972) pp. 33-64.
10. L. Corciulo. Non determinism in deductive databases. Laurea Thesis. Dipartimento di Informatica, Università di Pisa, 1993 (in Italian)
11. H. Gallaire, J. Minker, J.M. Nicolas. Logic and Databases, a Deductive Approach. ACM Computing Surveys 16(2) (1984). pp. 153-185.
12. M. Gelfond, V. Lifschitz. The stable model semantics for logic programming. Proc. 5th Int. Conf. and Symp. on Logic Programming, MIT Press, pp. 1080-1070, 1988.
13. F. Giannotti, D. Pedreschi, D. Saccà, C. Zaniolo. Non-Determinism in Deductive Databases. Proc. Deductive and Object-oriented Databases, Second International Conference, DOOD’93, (Eds. C. Delobel, M. Kifer, Y. Masunaga), Springer-Verlag, LNCS 566, pp. 129-146, 1991.
14. F. Giannotti, D. Pedreschi, C. Zaniolo. Declarative Semantics for Pruning Operators in Logic Programming. Methods of Logic in Computer Science (1993) To appear.
15. Y. Gurevich, S. Shelah. Fixed-Point Extensions of First-Order Logic. Annals of Pure and Applicate Logic 32 (1986). pp. 265-280.
16. N. Immerman, Languages which Capture Complexity Classes. SIAM J. Computing, 16, 4, (1987). pp. 760-778.
17. P.C. Kanellakis. Elements of Relational Databases Theory. In: Handbook of Theoretical Computer Science, (Ed. J. van Leeuwen) (1990). pp. 1075-1155.
18. R. Krishnamurthy, S. Naqvi. Non-Deterministic Choice in Datalog. Proc. 3nd Int. Conf. on Data and Knowledge Bases, Morgan Kaufmann Pub., Los Altos (1988). pp. 416-424.
19. S. Naqvi, S. Tsur. A Logical Language for Data and Knowledge Bases. Computer Science Press, New York (1989).
20. D. Sacca, C. Zaniolo. Stable Models and Non-Determinism in Logic Programs with Negation. Proc. Symp. on Principles of Database System PODS’89 (1989).
21. J.D. Ullman. Principles of Databases and Knowledge Base System. Volume I and II. Computer Science Press, Rockville, Md (1988).