Abstract
Deterministic models are (partial) stable models which are not contradicted by any other stable model, i.e., M is a deterministic model if there is no stable model N such that M ∪ N is not an interpretation. For instance, the well-founded model, which coincides with the intersection of all partial stable models, is a deterministic model. As the well-founded model is deterministic and unique for each program, well-founded model semantics has been proposed as the canonical deterministic semantics for partial stable models. But the well-founded model is not the unique deterministic model; indeed the family of deterministic (partial stable) models is not in general a singleton and admits a minimum (the well-founded model) and a maximum, the max-deterministic model. This model is another candidate for a deterministic semantics. The aim of this paper is to study the complexity and the expressive power of deterministic semantics. In coherence with the deterministic nature of the model, the expressive power of max-deterministic semantics is shown to be able to express problems with unique solutions whereas the well-founded model only captures a proper subset of the queries computable in polynomial time, the so-called fixpoint queries.
Work partially supported by the EC-US033 project “DEUS EX MACHINA: nondeterminism in deductive databases”, and by a MURST grant under the project “Sistemi formali e strumenti per basi di dati evolute”. The second author's work is supported by the CNR Research Institute ISI.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul S., Hull R., and V. Vianu, Foundations of Databases, Addison-Wesley, 1994.
Abiteboul S., Simon E., and V. Vianu, “Non-deterministic languages to express deterministic transformations”, Proc. ACM PODS Symp.,1990, pp. 218–229.
Buccafurri F., Greco S., and D. Saccà, “The Expressive Power of Unique Total Stable Model Semantics”, in Proc. ICALP, 1997, pp. 849–859.
Blass A. and Y. Gurevich, “On the Unique Satisfiability Problem”, Inform. and Control, 1982, pp. 80–88.
Chandra A., and D. Harel, “Structure and Complexity of Relational Queries”, JCSS 25, 1, 1982, pp. 99–128.
Eiter T., Gottlob G. and H. Mannila, “Expressive Power and Complexity of Disjunctive DATALOG”, Proc. ACM PODS Symp., Minneapolis, USA, May 1994.
Fagin R., “Generalized First-Order Spectra and Polynomial-Time Recognizable Sets”, in Complexity of Computation (R. Karp, Ed.), SIAM-AMS Proc., Vol. 7, 1974.
Gelfond M., and V. Lifschitz, “The Stable Model Semantics for Logic Programming”, Proc. 5th Int. Conf. on Logic Programming, 1988.
Greco S. and Saccà D., “'Possible is Certain' is desirable and can be expressive”, Annals Math. Art. Int., 1996.
Greco S., Saccà D. and C. Zaniolo, “DATALOG Queries with Stratified Negation and Choice: from ℘ to D℘”, in Proc. of the Int. Conf. on Database Theory, 1995.
Gurevich Y., “Logic and the Challenge of Computer Science”, in E. Borger (ed.), Trends in Theoretical Computer Science, Computer Science Press, 1988.
Johnson D.S., “A Catalog of Complexity Classes”, in J. van Leewen (ed.), Handbook of Theoretical Computer Science, Vol. 1, North-Holland, 1990.
Kolaitis P.G., “Implicit definability on finite structures and unambiguous computations”, Proc. 5th IEEE LICS Symp., 1990, pp. 168–180.
Kolaitis P.G. and C.H. Papadimitriou, “Why not Negation by Fixpoint?”, JCSS 43, 1991, pp. 125–144.
Laenens, E., Vermeir D, and C. Zaniolo, “Logic Programming Semantics Made Easy”, Proceedings of the ICALP'92 conference, Vienna, April, 1992.
Lloyd J.W., Foundations of Logic Programming, Springer-Verlag, Berlin, 1987.
Marek W. and M. Truszcynski, “Autoepistemic Logic”, Journal of the ACM 38, 3, 1991, pp. 588–619.
Papadimitriou C., Computational Complexity, Addison-Wesley, 1994.
Przymusinski T.C., “Well-founded Semantics Coincides with Three-valued Stable Semantics”, Foundamenta Informaticae 13, 1990, pp. 445–463.
Saccà D., “The Expressive Powers of Stable Models for Bound and Unbound Queries”, Journal of Computer and System Science Vol. 54, No. 3, 1997, pp. 441–464.
Saccà D. and C. Zaniolo, “Stable Models and Non-Determinism in Logic Programs with Negation”, Proc. ACM PODS Symp., 1990, pp. 205–218.
Saccà D. and C. Zaniolo, “Deterministic and Non-Deterministic Stable Models”, Journal of Logic and Computation, (to appear) 1997.
Schlipf J.S., “The Expressive Powers of the Logic Programming Semantics”, Proc. ACM PODS Symp., 1990, pp. 196–204.
Smullyan R.M., What is the name of this book?: The Riddle of Dracula and Other Logical Puzzles. Prentice Hall, 1978.
Ullman J.D., Principles of Database and Knowledge Base Systems, Computer Science Press, 1988.
Van Gelder A., “The Alternating Fixpoint of Logic Programming with Negation” Journal of Computer and System Sciences 43, 1992, pages 125–144.
Van Gelder A., Ross K. and J.S. Schlipf, “The Well-Founded Semantics for General Logic Programs”, Journal of the ACM 38, 3, 1991, pp. 620–650.
Vardi M.Y., “The Complexity of Relational Query Languages”, Proc. ACM Symp. on Theory of Computing, 1982, pp. 137–146.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greco, S., Saccà, D. (1997). Deterministic semantics for datalog ⌝: complexity and expressive power. In: Bry, F., Ramakrishnan, R., Ramamohanarao, K. (eds) Deductive and Object-Oriented Databases. DOOD 1997. Lecture Notes in Computer Science, vol 1341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63792-3_24
Download citation
DOI: https://doi.org/10.1007/3-540-63792-3_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63792-9
Online ISBN: 978-3-540-69647-6
eBook Packages: Springer Book Archive