Datalog with non-deterministic choice computes NDB-PTIME

Journal of Logic Programming

Volumn 35, Issue 1, 1998, Pages 79-101

  Giannotti, Fosca ^a   Pedreschi, Dino ^b  

^a ISTI CNR   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; FORMAL LOGIC; POLYNOMIALS;

NONDETERMINISTIC TIME POLYNOMIAL QUERIES (NDB PTIME);

FORMAL LANGUAGES;

EID: 0032048595     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(97)10004-8     Document Type: Article

References (27)

1. L. Corciulo, F. Giannotti, D. Pedreschi, Dalalog with non deterministic choice computes NDB_PTIME, in: S. Ceri, T. Katsumi, S. Tsur (Eds.), Proceedings of the Third International Conference on Deductive and Object-Oriented Databases DOOD'93, Lecture Notes in Computer Science, vol. 760, Springer, Berlin, 1993, pp. 49-65.
2. A. Chandra, D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25 (1) (1982) 99-128.
3. C. Zaniolo, Object identity and inheritance in deductive databases: An evolutionary approach, in: W. Kim, J.-M. Nicolas, S. Nishio (Eds.), Proceedings of the First International Conference on Deductive and Object-oriented Databases DOOD'89, Elsevier, Amsterdam, 1989, pp. 7-21.
4. F. Giannotti, S. Greco, D. Saccà, C. Zaniolo, Programming with non determinism in deductive databases, Ann. of Math. and Artificial Intelligence 19 (1-2) (1997) 97-126.
5. N. Immerman, Languages with capture complexity classes, SIAM J. Comput. 16 (4) (1987) 760-778.
6. S. Abiteboul, V. Vianu, Non determinism in logic based languages, Ann. of Math. and Artificial Intelligence 3 (1991) 151-186.
7. N. Immerman, Relational queries computable in polynomial time, Inform. and Control 68 (1986) 86-104.
8. M. Vardi, The complexity of relational query languages, in: Proceedings of the ACM-SIGACT Symposium on the Theory of Computing, ACM Press, 1982, pp. 137-146.
9. S. Abiteboul, V. Vianu, Procedural languages for database queries and updates, J. Comput. System Sci. 41 (2) (1990) 181-229.
10. S. Abiteboul, E. Simon, V. Vianu, Non deterministic language to express deterministic transformation, in: Proceedings of the Ninth ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems PODS 90, ACM Press, 1990, pp. 218-229.
11. S. Abiteboul, V. Vianu, Fixpoint extension of first order logic and datalog like languages, in: Proceedings of the Fourth Symposium on Logic in Computer Science LICS'89, IEEE Computer Press, 1989, pp. 71-89.
12. R. Krishnamurthy, S. Naqvi, Non deterministic choice in datalog, in: Proceedings of the Third International Conference on Data and Knowledge Bases, Morgan Kaufmann, Los Altos, CA, 1988, pp. 416-424.
13. D. Saccà, C. Zaniolo, Stable models and non determinism in logic programs with negation, in: Proceedings of ACM Symposium on Principles of Database Systems PODS 90, ACM Press, 1990, pp. 205-217.
14. F. Giannotti, D. Pedreschi, D. Saccà, C. Zaniolo, Non determinism in deductive databases, in: C. Delobel, M. Kifer, Y. Masunaga (Eds.), Proceedings of the Second International Conference on Deductive and Object-oriented Databases DOOD'91, Lecture Notes in Computer Science, vol. 566, Springer, Berlin, 1991, pp. 129-146.
15. S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases, Addison-Wesley, Reading, MA, 1995.
16. W. Cheng, J. Zeng, Non determinism through well-founded choice, J. Logic Programming 26 (3) (1996) 285-309.
17. P.C. Kanellakis, Elements of relational database theory, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B. Elsevier, Amsterdam, 1990, pp. 1075-1155.
18. J.D. Ullman, Principles of databases and knowledge base system, vols. I/II. Computer Science Press, Rockville, MD, 1988.
19. E.F. Codd, Relational completeness of database sublanguages, in: R. Rustin (Ed.), Data Base Systems, Prentice-Hall, Englewood Cliffs, NJ, 1972, pp. 33-64.
20. H. Gallaire, J. Minker, J.M. Nicolas, Logic and databases: A deductive approach, ACM Comput. Surveys 16 (2) (1984) 153-185.
21. K.R. Apt, Introduction to logic programming, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, pp. 493-574.
22. Y. Gurevich, S. Shelah, Fixed-point extensions of first-order logic, Ann. of Pure and Appl. Logic 32 (1986) 265-280.
23. S. Naqvi, S. Taur, A logical language for data and knowledge bases, Computer Science Press, Rockville, MD, 1989.
24. D. Chimenti et al. The ℒscript G signℒ system prototype, IEEE J. Data and Knowledge Engineering 2 (1) (1990) 76-90.
25. M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: Proceedings of the Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1070-1080.
26. L. Corciulo, Non determinism in deductive databases (in Italian), Laurea Thesis, Dipartimento di Informatica, Università di Pisa, 1993.
27. F. Giannotti, D. Pedreschi, C. Zaniolo, Declarative semantics for pruning operators in logic programming, Methods of Logic in Computer Science 1 (1994) 61-76.