Abstract
The notion of preferential entailment has emerged as a generalization of circumscription. Here we study only “classical” preferential entailment, i.e. the underlying logic is classical. Also, as we want to apply these results to the various notions of circumscriptions which have been defined in the literature, we examine which preferential entailments can be considered as a kind of circumscription. Among the results given are a precise study of cumulativity (with respect to well-foundedness), even for preferential entailments based on non transitive relations, and the isolation of a property called “reverse monotony”, which is a fundamental characteristic of any preferential entailment associated to a circumscription. We prove that the main properties of circumscriptions can be considered as corollaries of reverse monotony. We introduce also a new property of circumscriptions, “disjunctive coherence”, which is not a consequence of reverse monotony.
Preview
Unable to display preview. Download preview PDF.
References
P. Besnard. An Introduction to Default Logic. Springer Verlag, Heidelberg, 1989.
Philippe Besnard, Jean Houdebine, and Raymond Rolland. A formula circumscriptively both valid and unprovable. In ECAI, pages 516–518, Munich, 1988.
P. Besnard, R. Mercer, and Y. Moinard. The importance of open and recursive circumscription. Artificial Intelligence, 39:251–262, 1989.
Geneviève Bossu and Pierre Siegel. Saturation, nonmonotonic reasoning and the closed-world assumption. Artificial Intelligence, 25:13–63, 1985.
Philippe Besnard and Pierre Siegel. The preferential-models approach to non-monotonic logics. In Non-Standard Logics for Automated Reasoning, pages 137–161. Academic Press, 1988.
C.C. Chang and H.J. Keisler. Model Theory. North-Holland, Amsterdam, 1973.
D.W. Etherington, R.E. Mercer, and R. Reiter. On the adequacy of predicate circumscription for closed-world reasoning. Comput Intell., 1:11–15, 1985.
Michael Freund and Daniel Lehmann. Deductive inference operations. In JELIA-90, in LNCS 478, pages 227–233, Amsterdam, Springer-Verlag, September 1990.
D.M. Gabbay. Theoretical foundations for nonmonotonic reasoning in expert systems. In Proc. Logics and Models of Concurrent Systems, NATO ASI Series F, volume 13. Springer Verlag, 1985.
Georg Kreisel and Jean-Louis Krivine. Elements of Mathematical Logic: Model Theory (2nd edition). North Holland, Amsterdam, 1971.
S. Kraus, D. Lehmann, and M. Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44:167–207, 1990.
Vladimir Lifschitz. On the satisfiability of circumscription. Artificial Intelligence, 28:17–27, 1986.
Vladimir Lifschitz. Pointwise circumscription. In Matthew L. Ginsberg, editor. Readings in Nonmonotonic Reasoning, pages 179–193. Morgan-Kaufmann, Los Altos CA, 1988.
David Makinson. General theory of cumulative inference. In Non-Monotonic Reasoning, in LNAI-346, pages 1–18. Springer-Verlag, June 1988.
John McCarthy. Circumscription-a form of non-monotonic reasoning. Artificial Intelligence, 13:27–39, 1980.
John McCarthy. Application of circumscription to formalizing common sense knowledge. Artificial Intelligence, 28:89–116, 1986.
Yves Moinard. Pointwise circumscription is equivalent to predicate completion (sometimes). In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming, pages 1097–1105, Seattle, MIT Press, 1988.
Y. Moinard. Circumscriptions as preferential entailments. In ECAI, pages 329–333, Wien, Wiley, August 1992.
Y. Moinard. Circumscriptions for preferential entailments. submitted, dec. 1993.
Y. Moinard and R. Rolland. Unexpected and unwanted results of circumscription. In Artificial Intelligence IV (methodology, systems, applications) (AIMSA), pages 61–70, Albena, Bulg., North-Holland, 1990.
Y. Moinard and R. Rolland. Preferential entailments for circumscriptions. In KR-94, Bonn, Morgan Kaufmann, May 1994.
Donald Perlis and Jack Minker. Completeness results for circumscription. Artificial Intelligence, 28:29–42, 1986.
Piotr Rychlick. The Generalized Theory of Model Preference (Preliminary Report). In AAAI, pages 615–620, Boston, Morgan Kaufmann, August 1990.
Karl Schlechta. Some Results on Classical Preferential Models. Journal of Logic Computation, 2(6):675–686, December 1992.
Yoav Shoham. Reasoning about change. MIT Press, Cambridge, 1988.
Léa Sombé. Reasoning under Incomplete Information in Artificial Intelligence. Wiley, New York, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moinard, Y., Rolland, R. (1994). Around a powerful property of circumscriptions. In: MacNish, C., Pearce, D., Pereira, L.M. (eds) Logics in Artificial Intelligence. JELIA 1994. Lecture Notes in Computer Science, vol 838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021963
Download citation
DOI: https://doi.org/10.1007/BFb0021963
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58332-5
Online ISBN: 978-3-540-48657-2
eBook Packages: Springer Book Archive