Abstract
Each stable model of a logic program is computed in isolation. This does not allow one to reason in any stable model with information from other stable models. Such information interchange is needed when computing with full introspection, as performed by Gelfond's epistemic specifications, or when modeling multi-agent reasoning using stable models. In this paper, we define syntactic and semantic structures that allow the use of information from multiple stable models when computing one stable model. Hence a notion of second order stability is introduced and every computed model should be stable at that level. We define a concept of trans-epistemic (te-) logic programs that is reduced to a logic program using information from a trans-epistemic interpretation. The te-interpretation is checked for stability against the set of stable models of the logic program using a consensus function. We discus the properties of trans-epistemic stable models and motivate their use with examples.
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
M. Gelfond. Strong Introspection. In Proc. of AAAI-91, 1991.
M. Gelfond. Logic Programming and Reasoning with Incomplete Information. Annals of Mathematics and Artificial Intelligence, 12, 1994.
M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In R.A. Kowalski and K.A. Bowen, editors, Proc. 5 th International Conference and Symposium on Logic Programming, pages 1070–1080, Seattle, Washington, August 15–19 1988.
G. Lakemeyer and H.J. Levesque. A Tractable Knowledge Representation Service with Full Introspection. In Proc. TARK 88, 1988.
H.J. Levesque. All I Know: A Study in Autoepistemic Logic. Artificial Intelligence, 42(2–3):263–309, 1990.
J.J. Lu, A. Nerode, J.B. Remmel, and V.S. Subrahmanian. Toward A Theory of Hybrid Knowledge Bases. Technical report, MSI, Cornell University, 1993.
W. Marek, A. Nerode, and J.B. Remmel. A Contex for Belief Revision: FC-normal Nonmonotonic, Programs. In Proc. Workshop on Defeasible Reasoning and Constraint Solving, 1992. To appear in Annals of Pure and Applied Logic.
W. Marek, A. Nerode, and J.B. Remmel. Rule Systems, Well-ordering and Forward Chaining. Technical report, MSI, Cornell University, 1993.
W. Marek and M. Truszczynski. Relating autoepistemic and default logics. In Proceedings of KR-89, pages 276–288, 1989.
W. Marek and M. Truszczynski. Non-Monotonic Logics: Context Dependent Reasoning. Springer-Verlag, 1993.
A. Nerode and V.S. Subrahmanian. Hybrid Knowledge Bases. Technical report, University of Maryland, 1992.
T. Przymusinski. A Knowledge Representation Framework Based on Autoepistemic Logic of Minimal Beliefs. In Proc. of Logic Programming and Non-Monotonic Reasoning Retreat, Shaker Village, KY, 1994.
A. Rajasekar. Theories of Trans-Epistemic Defaults. Technical report, University of Kentucky, 1994.
R. Reiter. A Logic for Default Reasoning. Artificial Intelligence, 13(1 and 2):81–132, April 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rajasekar, A. (1995). Trans-epistemic semantics for logic programs. In: Marek, V.W., Nerode, A., Truszczyński, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1995. Lecture Notes in Computer Science, vol 928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59487-6_28
Download citation
DOI: https://doi.org/10.1007/3-540-59487-6_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59487-1
Online ISBN: 978-3-540-49282-5
eBook Packages: Springer Book Archive