论文信息 - An Algorithm for Insertion into a Lattice: Application to Type Classification

An Algorithm for Insertion into a Lattice: Application to Type Classification

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].

Michele Missikoff | Michel Scholl | M. Scholl | M. Missikoff

[1] David S. Touretzky,et al. The Mathematics of Inheritance Systems , 1984 .

[2] Luca Cardelli,et al. A Semantics of Multiple Inheritance , 1984, Information and Computation.

[3] Ronald J. Brachman,et al. An overview of the KL-ONE Knowledge Representation System , 1985 .

[4] Gillier,et al. Logic for Computer Science , 1986 .

[5] E. F. Codd,et al. A relational model of data for large shared data banks , 1970, CACM.

[6] Catriel Beeri,et al. On the power of languages for manipulation of complex objects , 1987, VLDB 1987.

[7] François Banciihon. Object-oriented database systems , 1988, PODS 1988.

[8] Ryszard S. Michalski,et al. Automated Construction of Classifications: Conceptual Clustering Versus Numerical Taxonomy , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9] Roger King,et al. Semantic database modeling: survey, applications, and research issues , 1987, CSUR.

[10] Setrag Khoshafian,et al. A calculus for complex objects , 1985, PODS '86.

[11] Peter Friedland. Special section on architectures for knowledge-based systems , 1985, CACM.

[12] Maria Simi,et al. Taxonomic Reasoning , 1986, ECAI.