Abstract
The well-founded semantics for normal logic programs is regarded as a constructive approximation of stable models. The construction is based on the consequence operator for definite programs in cooperation with the Gelfond-Lifschitz transformation. It is first shown that a well-founded approximation for disjunctive programs can be defined in quite the same way. It is then demonstrated that knowledge compilation — originally introduced as an approximative evaluation procedure for classical propositional logic — can be naturally combined with the well-founded construction. It is thereby possible to evaluate queries on a disjunctive program by a reduction to the more efficient well-founded semantics of normal programs.
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
Chitta R. Barai and V. S. Subrahmanian. Stable and extension class theory for logic programs and default logics. Journal of Automated Reasoning, 8: 345–366, 1992.
Alex Borgida and David W. Etherington. Hierarchical knowledge bases and efficient disjunctive reasoning. In Proc. of the 1st Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 33–43. Morgan Kaufmann, 1989.
Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In ICLP88 [5], pages 1070–1080.
Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9: 365–385, 1991.
Proc. of the 5th Int. Conf. and Symp. on Logic Programming. MIT Press, 1988.
Jürgen Kalinski. Weak Autoepistemic Reasoning - A Study in Autoepistemic Reasoning from a Logic Programming Perspective. PhD thesis, Universität Bonn, 1994.
Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, 1992.
Jack Minker and Arcot Rajasekar. A fixpoint semantics for disjunctive logic programs. Journal of Logic Programming, 9: 45–74, 1990.
Teodor Przymusinski. Perfect model semantics. In ICLP88 [5], pages 1081–1096.
Teodor C. Przymusinski. Autoepistemic logics of closed beliefs and logic programming. In Proc. of the 1st Int. Workshop on Logic Programming and Non-monotonic Reasoning, pages 3–20. MIT Press, 1991.
Teodor C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9: 401–424, 1991.
K. A. Ross and R. W. Topor. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4: 397–424, 1988.
Bart Selman and Henry Kautz. Knowledge compilation using Horn approximations. In Proc. of the 9th National Conf. on Artificial Intelligence, pages 904–909, 1991.
M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23 (4): 733–742, 1976.
A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38 (3): 620–650, 1991.
Allen Van Gelder. The alternating fixpoint of logic programs with negation. In Proc. of the 8th Symp. on Principles of Database Systems, pages 1–10, 1989.
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
Kalinski, J. (1994). From above and from below: Approximating stable models. In: Wolfinger, B. (eds) Innovationen bei Rechen- und Kommunikationssystemen. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51136-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-51136-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58313-4
Online ISBN: 978-3-642-51136-3
eBook Packages: Springer Book Archive