On the relative expressiveness of description logics and predicate logics

被引:159
作者
Borgida, A
机构
[1] Department of Computer Science, Rutgers University, New Brunswick
基金
美国国家科学基金会;
关键词
D O I
10.1016/0004-3702(96)00004-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
It is natural to view concept and role definitions 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 definable by formulas in L double over dot(3), the subset of first-order predicate calculus with monadic and dyadic predicates which allows only three variable symbols, In order to handle ''number bounds'', we allow numeric quantifiers, and for transitive closure of roles we use infinitary disjunction. Using previous results in the literature concerning languages with limited numbers of variables, we get as corollaries the existence of formulas of FOPC which cannot be expressed as descriptions. We also show that by omitting role composition, descriptions express exactly the formulas in L double over dot(2), which is known to be decidable.
引用
收藏
页码:353 / 367
页数:15
相关论文
共 24 条
[1]  
ANDREKA H, 1995, J IGPL, V3, P685
[2]  
BAADER F, 1990, 9TH P EUR C ART INT, P53
[3]  
Baader Franz, 1992, TERMINOLOGICAL KNOWL
[4]   DESCRIPTION LOGICS IN DATA MANAGEMENT [J].
BORGIDA, A .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1995, 7 (05) :671-682
[5]  
BORGIDA A, 1993, P 1993 ACM SIGMOD IN, P217
[6]  
BRACHMAN RJ, 1977, THESIS HARVARD U CAM
[7]   SUBSUMPTION BETWEEN QUERIES TO OBJECT-ORIENTED DATABASES [J].
BUCHHEIT, M ;
JEUSFELD, MA ;
NUTT, W ;
STAUDT, M .
INFORMATION SYSTEMS, 1994, 19 (01) :33-54
[8]  
CAI J, 1989, P 30 IEEE S F COMP S, P612
[9]  
DONINI FM, 1991, LECT NOTES ARTIF INT, V549, P88
[10]  
Gabbay D., 1981, ASPECTS PHILOS LOGIC, P91, DOI [10.1007/978-94-009-8384-7_4, DOI 10.1007/BF03052501]