An Axiomatic Approach to Feature Term Generalization

  • Hassan Aït-Kaci
  • Yutaka Sasaki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2167)


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.


Normal Form Logic Program General Generalization Inductive Logic Programming Generalization Rule 
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.


  1. 1.
    Hassan Aït-Kaci and Roger Nasr. LOGIN: A logic programming language with built-in inheritance. Journal of Logic Programming, 3:185–215, 1986.CrossRefGoogle Scholar
  2. 2.
    Hassan Aït-Kaci and Andreas Podelski. Towards a meaning of LIFE. Logic Program., 16(3–4): 195–234, July-August 1993.zbMATHCrossRefGoogle Scholar
  3. 3.
    Hassan Aït-Kaci, Andreas Podelski, and Seth Copen Goldstein. Order-sorted feature theory unification. Journal of Logic Programming, 30(2):99–124, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Bob Carpenter. The Logic of Typed Feature Structures, volume 32 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, UK, 1992.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    Nada Lavrač and Sašo Džeroski. Inductive Logic Programming: Techniques and Applications. Ellis Horwood, 1994.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    Gordon Plotkin. A note on inductive generalization. In Machine Intelligence, pages 153–163. Edinburgh University Press, 1969.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Hassan Aït-Kaci
    • 1
  • Yutaka Sasaki
    • 2
  1. 1.Simon Fraser University BurnabyCanada
  2. 2.NTT Communication Science LaboratoriesNTT CorporationKyotoJapan

Personalised recommendations