Non-determinism in deductive databases

  • Fosca Giannotti
  • Dino Pedreschi
  • Domenico Saccà
  • Carlo Zaniolo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 566)


This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the choice construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient implementation and expressive power. Thus, we define a construct called dynamic choice, which is consistent with the fixpoint-based semantics, cures the deficiencies of the former approach, and leads to efficient implementations in the framework of deductive databases. Also the new construct extends the expressive power of Datalog programs considerably, as it allows to express negation under Closed World Assumption, as well as a class of relevant deterministic problems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AV89]
    Abiteboul, S., and Vianu, V., “Fixpoint extensions of first-order logic and Datalog-like languages”, Proc. 4th Symp. on Logic in Computer Science (LICS), IEEE Computer Press, pp. 71–89, 1989.Google Scholar
  2. [Chi90]
    Chimenti, D. et al., “The LDL System Prototype,” IEEE Journal on Data and Knowledge Engineering, Vol. 2, No. 1, pp. 76–90, 1990.Google Scholar
  3. [DW90]
    Debray, S.K., and Warren, D.S., “Towards banishing the cut from Prolog”, IEEE Trans. on Software Engineering, Vol. 16, No. 3, pp. 335–349, 1990.Google Scholar
  4. [Die87]
    Dietrich, S.W., “Extension Tables: Memo Relations in Logic Programming”, Fourth IEEE Symposium on Logic Programming, MIT Press, pp. 264–272, 1987.Google Scholar
  5. [GL88]
    Gelfond, M., and Lifschitz, V., “The stable model semantics for logic programming”, Proc. 5th Int. Conf. and Symp. on Logic Programming, MIT Press, pp. 1070–1080, 1988.Google Scholar
  6. [GPZ89]
    Giannotti, F., D. Pedreschi and C. Zaniolo, “Declarative Semantics for Pruning Operators in Logic Programming”, Proc. NACLP90 Workshop on Logic Programming and Non-Monotonic Reasoning, Austin, Tx, Nov 1, 2, 1989.Google Scholar
  7. [KN88]
    Krishnamurthy, R., and Naqvi, S.A., “Non Deterministic Choic e in Datalog”, Proc. 3rd Int. Conf. on Data and Knowledge Bases, Morgan Kaufmann Pub., Los Altos, pp. 416–424, 1988.Google Scholar
  8. [NT89]
    Naqvi, S.A., and Tsur, S., A Logical Data Language for Data and Knowledge Bases, Computer Science Press, New York, 1989.Google Scholar
  9. [Imm87]
    Immerman, N., Languages which Capture Complexity Classes, SIAM J. Computing, 16, 4, pp. 760–778, 1987.Google Scholar
  10. [SZ89]
    Saccà, D., and Zaniolo, C., “Stable models and non determinism in logic programs with negation”, In Proc. Symp. on Principles of Database Systems PODS'89, 1989.Google Scholar
  11. [Ull90]
    Ullman, J.D., Principles of Database and Knowledge-Base Systems, Vol. 1 and 2, Computer Science Press, Rockville, Md., 1989.Google Scholar
  12. [Zan89]
    Zaniolo, C. “Object Identity and Inheritance in Deductive Databases: an Evolutionary Approach,” Proc. 1st Int. Conf. on Deductive and O-O Databases, Dec. 4–6, 1989, Kyoto, Japan.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Fosca Giannotti
    • 1
  • Dino Pedreschi
    • 2
  • Domenico Saccà
    • 3
  • Carlo Zaniolo
    • 4
  1. 1.CNUCE-CNRPisaItaly
  2. 2.Dipartimento di InformaticaUniversità di PisaPisaItaly
  3. 3.Dipartimento di SistemiUniversità della CalabriaRendeItaly
  4. 4.MCCAustin

Personalised recommendations