Extensible Knowledge Representation: the Case of Description Reasoners

Abstract

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.

DOI: 10.1613/jair.584

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@article{Borgida1999ExtensibleKR, title={Extensible Knowledge Representation: the Case of Description Reasoners}, author={Alexander Borgida}, journal={J. Artif. Intell. Res.}, year={1999}, volume={10}, pages={399-434} }