CLASSIC: a structural data model for objects
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Subsumption in KL-ONE is undecidable
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Reasoning with individuals in concept languages
Data & Knowledge Engineering
Software information systems
On the relative expressiveness of description logics and predicate logics
Artificial Intelligence
Artificial Intelligence
The use of description logics in KBSE systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
An epistemic operator for description logics
Artificial Intelligence
Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project
Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project
Description Logics in Data Management
IEEE Transactions on Knowledge and Data Engineering
Adding Uniqueness Constraints to Description Logics (Preliminary Report)
DOOD '97 Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases
Deriving Inference Rules for Terminological Logics
JELIA '92 Proceedings of the European Workshop on Logics in AI
Adding more “DL” to IDL: towards more knowledgeable component inter-operability
Proceedings of the 21st international conference on Software engineering
The description logic handbook
How knowledge representation meets software engineering (and often databases)
Automated Software Engineering
"Reducing" CLASSIC to Practice: Knowledge Representation Theory Meets Reality
Conceptual Modeling: Foundations and Applications
Hi-index | 0.00 |
This paper offers an approach to extensible knowledge representation and reasoning for the Description Logic family of formalisms. The approach is based on the notion of adding new concept constructors, and includes a heuristic methodology for specifying the desired extensions, as well as a modularized software architecture that supports implementing extensions. The architecture detailed here falls in the normalize-compared paradigm, and supports both intentional reasoning (subsumption) involving concepts, and extensional reasoning involving individuals after incremental updates to the knowledge base. The resulting approach can be used to extend the reasoner with specialized notions that are motivated by specific problems or application areas, such as reasoning about dates, plans, etc. In addition, it provides an opportunity to implement constructors that are not currently yet sufficiently well understood theoretically, but are needed in practice. Also, for constructors that are provably hard to reason with (e.g., ones whose presence would lead to undecidability), it allows the implementation of incomplete reasoners where the incompleteness is tailored to be acceptable for the application at hand.