Abstract
We define a new semantics for disjunctive logic programs in an abstract way as the weakest semantics with certain properties, the most important being the unfolding-property (GPPE). Our semantics is similar to the strong well-founded semantics proposed by Ross, but seems to be more regularly behaved. It is an extension of both the well-founded semantics WFS and the generalized closed world semantics GCWA. We then present a bottom-up query-evaluation method for this semantics. An important feature of our approach is that we directly derive the algorithm from the given abstract properties of the logic programming semantics. The idea of the method is to compute derived rule instances with purely negative bodies (corresponding to Bry’s conditional facts and Chen/Warren’S residual program), and then to apply reduction steps in order to eliminate the conditions where possible.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Stefan Brass and Udo W. Lipeck. Generalized bottom-up query evaluation. In Alain Pirotte, Claude Delobel, and Georg Gottlob, editors, Advances in Database Technology — EDBT’92, 3rd Int. Conf., number 580 in LNCS, pages 88–103. Springer-Verlag, 1992.
Stefan Brass and Udo W. Lipeck. Bottom-up query evaluation with partially ordered defaults. In Proceedings of the 3rd International Conference on Deductive and Object-Oriented Databases (DOOD’93), number 760 in LNCS, pages 253–266. Springer, 1993.
Stefan Brass. Efficient query evaluation in disjunctive deductive databases. Research report, Institut für Informatik, Universität Hannover, 1993.
François Bry. Negation in logic programming: A formalization in constructive logic. In Dimitris Karagiannis, editor, Information Systems and Artificial Intelligence: Integration Aspects, pages 30–46. Springer, 1990.
Weidong Chen and David S. Warren. Computation of stable models and its integration with logical query processing. Technical report, Department of CS, SUNY at Stony Brook, 1993.
Weidong Chen and David S. Warren. A goal-oriented approach to computing the well-founded semantics. The Journal of Logic Programming, 17: 279–300, 1993.
Jürgen Dix. A Framework for Representing and Characterizing Semantics of Logic Programs. In B. Nebel, C. Rich, and W. Swartout, editors, Principles of Knowledge Repr. and Reasoning: Proc. of the Third International Conference (KR ‘82), pages 591–602. San Mateo, CA, Morgan Kaufmann, 1992.
Jürgen Dix. Classifying Semantics of Disjunctive Logic Programs. In K. Apt, editor, LOGIC PROGRAMMING: Proc. of the 1992 Joint International Con-ference and Symposium, pages 798–812. MIT Press, November 1992.
Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Properties. Fundamenta Informaticae, forthcoming, 1994.
Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundarnenta Informaticae, forthcoming, 1994.
Jürgen Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview. In Andre Fuhrmann and Hans Rott, editors, Logic, Action and Information. Proceedings of the Konstanz Colloquium in Logic and Information (Login ‘82). DeGruyter, 1994.
Jürgen Dix and Martin Müller. Abstract Properties and Computational Complexity of Semantics for Disjunctive Logic Programs. In Proc. of the Workshop W1, Struct. Complexity and Rec-theor. Methods in LP, following the JICSLP ‘82, pages 15–28. H. Blair, W. Marek, A. Nerode and J. Remmel, November 1992.
Jürgen Dix and Martin Müller. An Axiomatic Framework for Representing and Characterizing Semantics of Disjunctive Logic Programs. In Pascal Van Hentenryck, editor, Proceedings of the 11th Int. Conf. on Logic Programming, S. Margherita Ligure. MIT, June 1994.
Yong Hu and Li Yan Yuan. Extended Well-Founded Model Semantics for General Logic Programs. In Koichi Furukawa, editor, Proceedings of the 8th Int. Conf. on Logic Programming, Paris, pages 412–425. MIT, June 1991.
David B. Kemp, Peter J. Stuckey, and Divesh Srivastava. Magic sets and bottom-up evaluation of well-founded models. In Proc. of the 1991 Int. Symposium on Logic Programming, pages 337–351. MIT Press, 1991.
Martin Müller and Jürgen Dix. Implementing semantics of disjunctive logic programs using fringes and abstract properties. In Lufs Moniz Pereira and Anil Nerode, editors, Logic Programming and Non-monotonic Reasoning, Proc. of the 2nd Int. Workshop, pages 43–59. MIT Press, 1993.
Teodor C. Przymusinski. On the declarative semantics of deductive databases and logic programs. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193–216, Los-Altos (Calif.), 1988. Morgan Kaufmann.
Kenneth A. Ross. The well founded semantics for disjunctive logic programs. In Won Kim, Jean-Marie Nicolas, and Shojiro Nishio, editors, Deductive and Object-Oriented Databases, Proc. of the First Int. Conf. (DOOD’89). North-Holland Publ.Co., 1990.
John S. Schlipf. Formalizing a Logic for Logic Programming. Annals of Mathematics and Artificial Intelligence, 5: 279–302, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brass, S., Dix, J. (1994). A Disjunctive Semantics Based on Unfolding and Bottom-Up Evaluation. In: Wolfinger, B. (eds) Innovationen bei Rechen- und Kommunikationssystemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51136-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-51136-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58313-4
Online ISBN: 978-3-642-51136-3
eBook Packages: Springer Book Archive