Abstract
In this paper, we study how several patterns of deductive generalization from positive and negative examples can be relaxed to handle forms of defeasible reasoning, using default logic as a case study. We compare the resulting paradigms and establish the logical conditions under which they can take place.
Preview
Unable to display preview. Download preview PDF.
References
Besnard Ph., An Introduction to Default Logic, Springer, Heidelberg, 1989.
Besnard Ph. and Grégoire E., About Deductive Generalization, Proc. JELIA'92, LNAI, Springer, 1992.
Grégoire E., Logiques non monotones et intelligence artificielle, Hermès, Paris, 1990.
Kodratoff Y., Introduction to Machine Learning, Pitman, London, 1988.
Michalski R., A Theory and Methodology of Inductive Learning, Machine Learning: an A.I. Approach, Tioga, 1983.
Mitchell T., Version Spaces: an Approach to Concept Learning, Ph.D. Thesis, Stanford University, 1978.
Nicolas J., ALLY: un système logique pour la généralisation en apprentissage automatique, Thèse d'Université, Université de Rennes 1, 1987.
Nicolas J., Consistency and Preference Criteria for Generalization Languages Handling Negation and Disjunction, Proc. ECAI-88, pp. 402–407, Pitman, London, 1988.
Reiter R., A Logic for Default Reasoning, Artificial Intelligence, 13, pp. 81–132, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Besnard, P., Grégoire, E. (1993). Deductive generalization in a default logic setting. In: Brewka, G., Jantke, K.P., Schmitt, P.H. (eds) Nonmonotonic and Inductive Logic. NIL 1991. Lecture Notes in Computer Science, vol 659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030391
Download citation
DOI: https://doi.org/10.1007/BFb0030391
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56433-1
Online ISBN: 978-3-540-47557-6
eBook Packages: Springer Book Archive