Abstract
This paper presents a missing link between Plotkin’s least general generalization formalism and generalization on the Order Sorted Feature (OSF) foundation. A feature term (or Ψ-term) is an extended logic term based on ordered sorts and is a normal form of an OSF-term. An axiomatic definition of Ψ-term generalization is given as a set of OSF clause generalization rules and the least generality of the axiomatic definition is proven in the sense of Plotkin’s least general generalization (lgg). The correctness of the definition is given on the basis of the axiomatic foundation. An operational definition of the least general generalization of clauses based on Ψ-terms is also shown as a realization of the axiomatic definition.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Hassan Aït-Kaci and Roger Nasr. LOGIN: A logic programming language with built-in inheritance. Journal of Logic Programming, 3:185–215, 1986.
Hassan Aït-Kaci and Andreas Podelski. Towards a meaning of LIFE. Logic Program., 16(3–4): 195–234, July-August 1993.
Hassan Aït-Kaci, Andreas Podelski, and Seth Copen Goldstein. Order-sorted feature theory unification. Journal of Logic Programming, 30(2):99–124, 1997.
Franz Baader, Ralf Kusters and Ralf Molitor. Computing Least Common Sub-sumers in Description Logics with Existential Restrictions. Proccedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 96–101, 1999.
Bob Carpenter. The Logic of Typed Feature Structures, volume 32 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, UK, 1992.
Alan M. Frisch and C. David Page Jr. Generalization with taxonomic information. In Proceedings of the 8th National Conference on Arti-cial Intelligence, pages 755–761, Boston, MA, 1990. AAAI-90.
Alan M. Frisch. A general framework for sorted deduction: Fundamental results on hybrid reasoning. In Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning, pages 126–136, 1989.
Nada Lavrač and Sašo Džeroski. Inductive Logic Programming: Techniques and Applications. Ellis Horwood, 1994.
Enric Plaza. Cases as terms: A feature term approach to the structured representation of cases. In Proceedings of the 1st International Conference on Case-Based Reasoning, pages 263–27, 1995.
Gordon Plotkin. A note on inductive generalization. In Machine Intelligence, pages 153–163. Edinburgh University Press, 1969.
Yutaka Sasaki. Induction of logic programs based on Ψ-terms. In Proceedings of the 10th International Conference on Algorithmic Learning Theory, pages 169–181, Tokyo, Japan, 1999. ALT-99, Springer-Verlag LNAI 1720.
Yutaka Sasaki. Hierarchically Sorted Inductive Logic Programming and Its Application to Information Extraction. Ph.D thesis, Graduate School of Systems and Information Engineering, University of Tsukuba, Japan, September 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aït-Kaci, H., Sasaki, Y. (2003). An Axiomatic Approach to Feature Term Generalization. In: De Raedt, L., Flach, P. (eds) Machine Learning: ECML 2001. ECML 2001. Lecture Notes in Computer Science(), vol 2167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44795-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-44795-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42536-6
Online ISBN: 978-3-540-44795-5
eBook Packages: Springer Book Archive