Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
Chimenti, D. et al., “The LDL System Prototype,” IEEE Journal on Data and Knowledge Engineering, Vol. 2, No. 1, pp. 76–90, 1990.
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.
Dietrich, S.W., “Extension Tables: Memo Relations in Logic Programming”, Fourth IEEE Symposium on Logic Programming, MIT Press, pp. 264–272, 1987.
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.
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.
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.
Naqvi, S.A., and Tsur, S., A Logical Data Language for Data and Knowledge Bases, Computer Science Press, New York, 1989.
Immerman, N., Languages which Capture Complexity Classes, SIAM J. Computing, 16, 4, pp. 760–778, 1987.
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.
Ullman, J.D., Principles of Database and Knowledge-Base Systems, Vol. 1 and 2, Computer Science Press, Rockville, Md., 1989.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giannotti, F., Pedreschi, D., Saccà, D., Zaniolo, C. (1991). Non-determinism in deductive databases. In: Delobel, C., Kifer, M., Masunaga, Y. (eds) Deductive and Object-Oriented Databases. DOOD 1991. Lecture Notes in Computer Science, vol 566. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55015-1_7
Download citation
DOI: https://doi.org/10.1007/3-540-55015-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55015-0
Online ISBN: 978-3-540-46646-8
eBook Packages: Springer Book Archive