Abstract
The focus of this paper is on updates of a type hierarchy structured as a lattice. We propose below algorithms for inserting a new type into a specific lattice of types used in the knowledge base system MOSAICO [Mi87]. Such a structure is closely related to the concept of complete objects as defined in [Di88] and to the Concept Lattices studied in [Wi82].
Cite
CITATION STYLE
Missikoff, M., & Scholl, M. (1989). An algorithm for insertion into a lattice: Application to type classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 367 LNCS, pp. 64–82). Springer Verlag. https://doi.org/10.1007/3-540-51295-0_119
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
