Skip to main content
SpringerLink
Log in

Programming with non-determinism in deductive databases

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

While non-determinism has long been established as a key concept in logic pro-gramming, its importance in the context of deductive databases was recognized only recently. This paper provides an overview of recent results on this topic with the aim of providing an introduction to the theory and practice of non-determinism in deductive databases. In particular we (i) recall the main results linking non-deterministic constructs in database languages to the theory of data complexity and the expressibility hierarchy of query languages; (ii) provide a reasoned introduction to effective programming with non-deterministic constructs; (iii) compare the usage of non-deterministic constructs in languages such as LDL++ to that of traditional logic programming languages; (iv) discuss the link between the semantics of logic programs with non-deterministic constructs and the stable-model semantics of logic programs with negation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, Data Structures and Algorithms (Addison-Wesley, 1983).

  2. S. Abiteboul, E. Simon and V. Vianu, Non-deterministic language to express deterministic transformation, in: Proceedings of the Ninth ACM Symposium on Principles of Database Systems (1990) pp. 215–229.

  3. S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley, 1995).

  4. S. Abiteboul and V. Vianu, Datalog extensions for databases queries and updates, Journal of Computer and System Science 43 (1991) 62–124.

    Google Scholar 

  5. F. Afrati, S.S. Cosmadakis and M. Yannakakis, On Datalog vs. polynomial time, Journal of Computer and System Science 51(1) (1991) 177–196.

    Google Scholar 

  6. C. Apt, H. Blair and A. Walker, Towards a theory of declarative knowledge, in: Proc. Workshop on Found. of Deductive Database and Logic Programming, ed. I. Minker (1988) pp. 89–148.

  7. A. Brogi, V.S. Subrahmanian and C. Zaniolo, The logic of totally and partially ordered plans: a deductive database approach, Ann. of Math. and AI (this issue).

  8. A. Chandra and D. Harel, Computable queries for relational databases, Journal of Computer and System Science 21 (1980) 156–178.

    Google Scholar 

  9. A. Chandra and D. Harel, Structures and complexity of relational queries, Journal of Computer and System Science 25 (1982) 99–128.

    Google Scholar 

  10. A. Chandra and D. Harel, Horn clause and generalizations, Journal of Logic Programming 2(1) (1985) 1–15.

    Google Scholar 

  11. W. Chen and J. Zeng, Non-determinism through well-founded choice, Journal of Logic Programming 26(3) (1996) 285–309.

    Google Scholar 

  12. J. Chomicki, Temporal deductive databases, in: Temporal Databases: Theory, Design and Implementation, eds. A. Tansel et al. (Benjamin/Cummings, 1993).

  13. L. Corciulo, F. Giannotti and D. Pedreschi, Datalog with non-deterministic choice computes NDB-PTIME, in: Proc. Deductive and Object-oriented Databases, Third International Conference, DOOD'93, eds. S. Ceri, K. Tanaka and S. Tsur, LNCS 760 (1993) pp. 49–66.

  14. L. Corciulo, F. Giannotti, D. Pedreschi and C. Zaniolo, Expressive power of non-deterministic operators for logic-based languages, in: Proc. 2nd ICLP Workshop on Deductive Databases and Logic Programming, Santa Margherita Ligure, June 1994, eds. U. Geske and D. Seipel, GMD-Studien 231 (1994) pp. 27–40.

  15. S.K. Debray and D.S. Warren, Towards banishing the cut from Prolog', IEEE Trans. on Software Engineering 16(3) (1990) 335–349.

    Google Scholar 

  16. F. Giannotti, D. Pedreschi and C. Zaniolo, Declarative semantics for pruning operators logic programming, Methods of Logic in Computer Science 1 (1994) 61–76.

    Google Scholar 

  17. F. Giannotti, D. Pedreschi and C. Zaniolo, Semantics and expressive power of non-deterministic constructs in deductive, Technical Report C96-04, Istituto CNUCE, Pisa (1996), submitted for publication.

    Google Scholar 

  18. S. Ganguly, S. Greco and C. Zaniolo, Extrema predicates in deductive databases, Journal of Computer and System Science 51(1) (1991) 244–259.

    Google Scholar 

  19. M.R. Garey and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness (Freeman, 1979).

  20. M. Gelfond and V. Lifschitz, The stable model semantics of logic programming, in: Proceedings of the Fifth Int. Conference on Logic Programming (1988) pp. 1070–1080.

  21. F. Giannotti, D. Pedreschi, D. Saccà and C. Zaniolo, Non-determinism in deductive databases, in: Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases (1991) pp. 129–146.

  22. S. Greco, C. Zaniolo and S. Ganguly, Greedy by choice, in: Proceedings of the Eleventh ACM Symposium on Principles of Database Systems (1992) pp. 105–163.

  23. S. Greco, D. Saccà and C. Zaniolo, DATALOG queries with stratified negation and choice: from P to D P, in: Proc. of the Fifth Int. Conf. on Database Theory (1995) pp. 82–96.

  24. N. Immerman, Languages that capture complexity classes, SIAM Journal of Computing 16(4) (1987) 760–778.

    Google Scholar 

  25. D.S. Johnson, A Catalog of Complexity Classes, Handbook of Theoretical Computer Science, Vol. 1, ed. J. Leewen (North-Holland, 1990) pp. 67–161.

  26. P.C. Kanellakis, Elements of Relational Databases Theory, Handbook of Theoretical Computer Science, ed. J. Leewen (North-Holland, 1990) pp. 1075–1155.

  27. P. Kolaitis, The expressive power of stratified logic programs, Information and Computation 90 (1990) 50–66.

    Google Scholar 

  28. P. Kolaitis and C. Papadimitriou, Why not negation by fixpoint, Journal of Computer and System Science 43 (1991) 125–144.

    Google Scholar 

  29. P.G. Kolaitis and M.Y. Vardi, On the expressive power of Datalog: Tools and a case study, in: ACM Proc. Symp. on Principles of Database Systems (1990) pp. 61–71.

  30. R. Krishnamurthy and S. Naqvi, Non-deterministic choice in Datalog, in: Proceedings of the 3rd International Conference on Data and Knowledge Bases (1988) pp. 416–424.

  31. J.W. Lloyd, Foundations of Logic Programming (Springer-Verlag, Berlin, 1987).

    Google Scholar 

  32. S. Naqvi and S. Tsur, A Logic Language for Data and Knowledge Bases (Computer Science Press, New York, 1989).

    Google Scholar 

  33. C. Papadimitriou, A note on the expressive power of Prolog, Bull. of the EATCS 26 (1985) 21–23.

    Google Scholar 

  34. C. Papadimitriou, Computational Complexity (Addison-Wesley, 1994).

  35. R. Ramakrishnan, D. Srivastava and S. Sudanshan, CORAL — Control, relations and logic, in: Proceedings of 18th VLDB Conference (1992).

  36. D. Saccà and C. Zaniolo, Stable models and non-determinism in logic programs with negation, in: Proceedings of the Ninth ACM Symposium on Principles of Database Systems (1990) pp. 205–217.

  37. D. Saccà and C. Zaniolo, Deterministic and Non-Deterministic Stable Models (1994), submitted for publication.

  38. J.S. Schlipf, The expressive power of the logic programming semantics, in: Proceedings of the Ninth ACM Symposium on Principles of Database Systems (1990) pp. 196–204.

  39. J.S. Schlipf, A survey of complexity and undecidability results in logic programming, in: Proc. Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming (1993) pp. 143–164.

  40. Y.-H. Sheng, A non-deterministics deductive database language, in: Proceedings of the 1991 ACM-SIGMOD Int. Conference on Management of Data (1991) pp. 188–198.

  41. J.D. Ullman, Principles of Databases and Knowledge Base Systems, Vols. I and II (Computer Science Press, 1988).

  42. A. Van Gelder, Negation as failure using tight derivations for general logic programs, Journal of Logic Programming 6(1) (1989) 109–133.

    Google Scholar 

  43. A. Van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, Journal of ACM 38(3) (1991) 620–650.

    Google Scholar 

  44. M. Vardi, The complexity of relational query languages, in: Proceedings of the 14th ACM Symposium on Theory of Computing (1982) pp. 137–146.

  45. C. Zaniolo, N. Arni and K. Ong, Negation and aggregates in recursive rules: the LDL++ approach, in: Proc. 3rd Int. Conf. on Deductive and O-O DBs, DOOD-93, Phoenix, AZ (Dec. 6–8, 1993) pp. 104–221.

Download references

Authors
  1. Fosca Giannotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Greco
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Domenico Saccà
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Carlo Zaniolo
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Giannotti, F., Greco, S., Saccà, D. et al. Programming with non-determinism in deductive databases. Annals of Mathematics and Artificial Intelligence 19, 97–125 (1997). https://doi.org/10.1023/A:1018999404360

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018999404360

Keywords

Search

Navigation