Abstract
This paper presents a method of embedding circumscriptive theories in general disjunctive programs. In a general disjunctive program, negation as failure occurs not only in the body but in the head of a rule. In this setting, minimized predicates of a circumscriptive theory are specified using the negation in the body, while fixed and varying predicates are expressed by the negation in the head. Moreover, the translation implies a close relationship between circumscription and abductive logic programming. That is, fixed and varying predicates in a circumscriptive theory are also viewed as abducible predicates in an abductive disjunctive program. Our method of translating circumscription into logic programming is fairly general compared with the existing approaches and exploits new applications of logic programming for representing commonsense knowledge.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bossu, G. and Siegel, P., Satutation, Nonmonotonic Reasoning and the Closed World Assumption, Artificial Intelligence 25, 13–63, 1985.
Cadoli, M., Eiter, T. and Gottlob, G., An Efficient Method for Eliminating Varying Predicates from a Circumscription, Artificial Intelligence 54, 397–410, 1992.
de Kleer, J. and Konolige, K., Eliminating the Fixed Predicates from a Circumscription, Artificial Intelligence 39, 391–398, 1989.
Gelfond, M. and Lifschitz, V., Compiling Circumscriptive Theories into Logic Programs, Proc. AAAI-88, 455–459. Extended version in: Proc. 2nd Int. Workshop on Nonmonotonic Reasoning, LNAI 346, 74–99, 1988.
Gelfond, M. and Lifschitz, V., The Stable Model Semantics for Logic Programming, Proc. ICLP'88, 1070–1080.
Gelfond, M., Przymusinska, H. and Przymusinski, T., On the Relation between Circumscription and Negation as Failure, Artificial Intelligence 38, 75–94, 1989.
Gelfond, M. and Lifschitz, V., Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing 9, 365–385, 1991.
Gelfond, M., Lifschitz, V., Przymusinska, H. and Schwarz, G., Autoepistemic Logic and Introspective Circumscription, Proc. TARK'94, 197–207.
Ginsberg, M. L., A Circumscriptive Theorem Prover, Artificial Intelligence 39, 209–230, 1989.
Helft, N., Inoue, K. and Poole, D., Query Answering in Circumscription, Proc. IJCAI-91, 426–431.
Inoue, K., Linear Resolution for Consequence Finding, Artificial Intelligence 56, 301–353, 1992.
Inoue, K. and Sakama, C., On Positive Occurrences of Negation as Failure, Proc. KR'94, 293–304.
Kakas, A. C., Kowalski, R. A. and Toni, F., Abductive Logic Programming, J. Logic and Computation 2, 719–770, 1992.
Konolige, K., On the Relation between Autoepistemic Logic and Circumscription, Proc. IJCAI-89, 1213–1218.
Lifschitz, V., Closed World Databases and Circumscription, Artificial Intelligence 27, 229–235, 1985.
Lifschitz, V., Computing Circumscription, Proc. IJCAI-85, 121–127.
Lifschitz, V., On the Declarative Semantics of Logic Programs with Negation, in Foundations of Deductive Databases and Logic Programming (J. Minker ed.), Morgan Kaufmann, 177–192, 1988.
Lifschitz, V., Between Circumscription and Autoepistemic Logic, Proc. KR'89, 235–244.
Lifschitz, V. and Woo, T. Y. C., Answer Sets in General Nonmonotonic Reasoning (preliminary report), Proc. KR'92, 603–614.
Lifschitz, V., Restricted Monotonicity, Proc. AAAI-93, 432–437.
Lifschitz, V., Minimal Belief and Negation as Failure, Artificial Intelligence 70, 53–72, 1994.
Lifschitz, V., Circumscription, in Handbook of Logic in Artificial Intelligence and Logic Programming (D. M. Gabbay, et al. eds.), Clarendon Press, 297–352, 1994.
Lifschitz, V. and Turner, H., From Disjunctive Programs to Abduction, Proc. ICLP'94 Workshop on Nonmonotonic Extensions of Logic Programming, 111–125.
Lin F. and Shoham, Y., A Logic of Knowledge and Justified Assumptions, Artificial Intelligence 57, 271–289, 1992.
Loveland, D. W., Automated Theorem Proving: A Logical Basis, North-Holland, 1978.
McCarthy, J., Circumscription — A Form of Nonmonotonic Reasoning, Artificial Intelligence 13, 27–39, 1980.
Przymusinski, T. C., On the Declarative Semantics of Deductive Databases and Logic Programs, in the same source book as [Lif88], 193–216, 1988.
Przymusinski, T., An Algorithm to Compute Circumscription, Artificial Intelligence 38, 49–73, 1989.
Przymusinski, T. C., Stable Semantics for Disjunctive Programs, New Generation Computing 9, 401–424, 1991.
Reiter, R., Circumscription implies Predicate Completion (sometimes), Proc. AAAI-82, 418–420.
Sakama, C. and Inoue, K., Relating Disjunctive Logic Programs to Default Theories, Proc. LPNMR'93, 266–282.
Yuan, L. Y. and You, J-H., Autoepistemic Circumscription and Logic Programming, J. Automated Reasoning 10, 143–160, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakama, C., Inoue, K. (1995). Embedding circumscriptive theories in general disjunctive 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_25
Download citation
DOI: https://doi.org/10.1007/3-540-59487-6_25
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