Learn More
CLASSIC is a data model that encourages the description of objects not only in terms of their relations to other known objects, but in terms of a level of intensional structure as well. The CLASSIC language of <italic>structured descriptions</italic> permits i) partial descriptions of individuals, under an 'open world' assumption, ii) answers to queries(More)
We describe Telos, a language intended to support the development of information systems. The design principles for the language are based on the premise that information system development is knowledge intensive and that the primary responsibility of any language intended for the task is to be able to formally represent the relevent knowledge. Accordingly,(More)
This report has been submitted forr publication outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Report forr early dissemination of its contents. In view of the transfert of copy right too the outside publisher, its distribution outside of ITC priorr to publication should be limited to peer(More)
We argue that accessing the transitive closure of relationships is an important component of both databases and knowledge representation systems in Artificial Intelligence. The demands for efficient access and management of large relationships motivate the need for explicitly storing the transitive closure in a compressed and local way, while allowing(More)
This report has been submitted forr publication outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Report forr early dissemination of its contents. In view of the transfert of copy right too the outside publisher, its distribution outside of ITC priorr to publication should be limited to peer(More)
We review several kinds of previously studied concept similarity measures , and then rephrase them in terms of a simple DL. We discuss the difficulties encountered in trying to generalize these formulations to more complex DLs, and settle on one based on probability/information theory as being the most principled. The idea of measuring concept similarity(More)
It is natural to view concept and role deenitions in description logics as expressing monadic and dyadic predicates in predicate calculus. We show that the descriptions built using the constructors usually considered in the DL literature are characterized exactly as the predicates deenable by formulas in L 3 , the subset of rst-order predicate calculus with(More)
This paper analyzes the correctness of the subsumption algorithm used in classic, a description logic-based knowledge representation system that is being used in practical applications. In order to deal eeciently with individuals in classic descriptions, the developers have had to use an algorithm that is incomplete with respect to the standard,(More)
Description logics are a popular formalism for knowledge representation and reasoning. This paper introduces a new operation for description logics: computing the \least common subsumer" of a pair of descriptions. This operation computes the largest set of commonalities between two descriptions. After arguing for the usefulness of this operation , we(More)