Extensible knowledge representation: the case of description reasoners

被引:2
作者
Borgida, A [1 ]
机构
[1] Rutgers State Univ, Dept Comp Sci, New Brunswick, NJ 08904 USA
关键词
D O I
10.1613/jair.584
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:399 / 434
页数:36
相关论文
共 36 条
[1]   A formal definition for the expressive power of terminological knowledge representation languages [J].
Baader, F .
JOURNAL OF LOGIC AND COMPUTATION, 1996, 6 (01) :33-54
[2]   AM EMPIRICAL-ANALYSIS OF OPTIMIZATION TECHNIQUES FOR TERMINOLOGICAL REPRESENTATION SYSTEMS - OR - MAKING KRIS GET A MOVE ON [J].
BAADER, F ;
HOLLUNDER, B ;
NEBEL, B ;
PROFITLICH, HJ ;
FRANCONI, E .
APPLIED INTELLIGENCE, 1994, 4 (02) :109-132
[3]  
BAADER F, 1991, P IJCAI 91
[4]  
Borgida A., 1994, Journal of Artificial Intelligence Research, V1, P277
[5]   On the relative expressiveness of description logics and predicate logics [J].
Borgida, A .
ARTIFICIAL INTELLIGENCE, 1996, 82 (1-2) :353-367
[6]   DESCRIPTION LOGICS IN DATA MANAGEMENT [J].
BORGIDA, A .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1995, 7 (05) :671-682
[7]  
BORGIDA A, 1996, P INT WORKSH DESCR L
[8]  
BORGIDA A, 1996, P KR 96
[9]  
BORGIDA A, 1989, P SIGMOD 89
[10]  
BORGIDA A, 1992, INT J INTELLIGENT CO, V1, P259