Abstract
We present a new approach for handling open normal defaults that makes it possible
-
1.
to derive existentially quantified formulae from other existentially quantified formulae by default,
-
2.
to derive universally quantified formulae by default, and
-
3.
to treat cardinality formulae analogously to other formulae.
Differing from previous approaches that do not satisfy all these properties, we will not view open defaults as schemata for certain instantiated defaults. Instead they will be used to define a preference relation on models. In modification of the usual approaches to preferential semantics we shall consider limits instead of minimal models.
This work was done while both authors were at the German Research Center for AI (DFKI), Saarbrücken, and was supported by BMFT grant ITW-9201.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F. Baader and B. Hollunder. Embedding defaults into terminological knowledge representation formalisms. In Proceedings of the 3rd International Conference on Knowledge Representation and Reasoning, Cambridge, Mass., 1992.
F. Baader and B. Hollunder. How to prefer more specific defaults in terminological default logic. To appear in Proceedings of the IJCAI'93, Chambery, France, 1993.
F. Baader and K. Schlechta. A semantics for open normal defaults via a modified preferential approach. Research Report RR-93-13, DFKI Saarbrücken, 1993.
G. Brewka. Preferred subtheories: An extended logical framework for default reasoning. In Proceedings of the IJCAI'89, pages 1043–1048, Detroit, Mich., 1989.
G. Brewka. Nonmonotonic Reasoning: Logical Foundations of Commonsense. Cambridge University Press, Cambridge, 1991.
D. Gabbay. Theoretical foundations for non-monotonic reasoning in expert systems. In K.R. Apt, editor, Proceedings of the NATO Advanced Studies Institute on Logics and Models of Concurrent Systems, pages 439–457, La Colle-sur-Loup, France, Springer Verlag, 1985.
S. Kraus, D. Lehmann, and M. Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44(1–2):137–207, 1990.
V. Lifschitz. On open defaults. In Proceedings of the Symposium on Computational Logics, Brüssel, Belgium, 1990.
D. Makinson. General theory of cumulative inferences. In M. Reinfrank, J. de Kleer, M.L. Ginsberg, editors, Proceedings of the Second International Workshop on Non-Monotonic Reasoning, pages 1–18, Springer Verlag, Berlin, 1989.
D. Makinson. General patterns in nonmonotonic reasoning. To appear in D. Gabbay and C. Hogger, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, vol. II: Nonmonotonic and Uncertain Reasoning, Oxford.
R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1–2):81–132, 1980.
R. Reiter and G. Criscuolo. On interacting defaults. In Proceedings of the IJ-CAI'81, 1981.
K. Schlechta. Some results on classical preferential models. To appear in J. of Logic and Computation, 2(6), 1992.
Y. Shoham. Nonmonotonic logics: Meaning and utility. In Proceedings of the IJCAI'87, pages 388–393, Milan, Italy, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baader, F., Schlechta, K. (1993). A semantics for open normal defaults via a modified preferential approach. In: Clarke, M., Kruse, R., Moral, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1993. Lecture Notes in Computer Science, vol 747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028176
Download citation
DOI: https://doi.org/10.1007/BFb0028176
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57395-1
Online ISBN: 978-3-540-48130-0
eBook Packages: Springer Book Archive