A
Alexander Borgida
Researcher at Rutgers University
Publications - 164
Citations - 9792
Alexander Borgida is an academic researcher from Rutgers University. The author has contributed to research in topics: Description logic & Knowledge representation and reasoning. The author has an hindex of 46, co-authored 161 publications receiving 9601 citations. Previous affiliations of Alexander Borgida include NCR Corporation & Bell Labs.
Papers
More filters
Journal ArticleDOI
Telos: representing knowledge about information systems
TL;DR: Telos is a language intended to support the development of information systems 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.
Journal ArticleDOI
CLASSIC: a structural data model for objects
TL;DR: The kind of language of descriptions and queries presented here provides a new arena for the search for languages that are more expressive than conventional DBMS languages, but for which query processing is still tractable.
Book ChapterDOI
LIVING WITH CLASSIC: When and How to Use a KL-ONE-Like Language
Ronald J. Brachman,Deborah L. McGuinness,Peter F. Patel-Schneider,Lori Alperin Resnick,Alexander Borgida +4 more
TL;DR: Classical as mentioned in this paper is a recently developed knowledge representation system that concentrates on the definition of structured concepts, their organization into taxonomies, the creation and manipulation of individual instances of such concepts, and the key inferences of subsumption and classification.
Journal ArticleDOI
Efficient management of transitive relationships in large data and knowledge bases
TL;DR: This work presents a transitive closure compression technique, based on labeling spanning trees with numeric intervals, and provides both analytical and empirical evidence of its efficacy, including a proof of optimality.
Journal ArticleDOI
On the relative expressiveness of description logics and predicate logics
TL;DR: It is shown that the descriptions built using the constructors usually considered in the DL literature are characterized exactly as the predicates definable by formulas in \ tL3, the subset of first-order predicate calculus with monadic and dyadic predicates which allows only three variable symbols.