Expressive number restrictions in description logics

被引:24
作者
Baader, F [1 ]
Sattler, U [1 ]
机构
[1] Rhein Westfal TH Aachen Klinikum, D-52074 Aachen, Germany
关键词
knowledge representation; description logics; number restrictions;
D O I
10.1093/logcom/9.3.319
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Number restrictions are concept constructors that are available in almost all implemented Description Logic systems. However, they are mostly available only in a rather weak form, which considerably restricts their expressive power. On the one hand,the roles that may occur in number restrictions are usually of a very restricted type, namely atomic roles or complex roles built using either intersection or inversion. In the present paper, we increase the expressive power of Description Logics by allowing for more complex roles in number restrictions. :As role constructors, wt: consider composition of roles (which will be present in all our logics) and intersection, union, and inversion of roles in different combinations. We will present two decidability results (for the basic logic that extends ALC by number restrictions on roles with composition, and for one extension of this logic), and three undecidability results for three other extensions of the basic logic. On the other hand, with the rather weak form of number restrictions available in implemented systems, the number of role successors of an individual can only be restricted by a fixed non-negative integer. To overcome this lack of expressiveness, we allow for variables ranging over the non-negative integers in place of the fixed numbers in number restrictions. The expressive power of this constructor is increased even further by introducing explicit quantifiers for the numerical variables. The Description Logic obtained this way turns out to have an undecidable satisfiability problem. For a restricted logic we show that concept satisfiability is decidable.
引用
收藏
页码:319 / 350
页数:32
相关论文
共 24 条
[1]  
[Anonymous], 1991, SIGART B, DOI DOI 10.1145/122296.122309
[2]  
APCHOLSKI L, 1997, P 12 ANN IEEE S LOG
[3]   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
[4]   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
[5]  
BAADER F, 1991, P 12 INT JOINT C ART
[6]  
Berger R., 1966, MEMOIRS AM MATH SOC, V66
[7]  
DeGiacomo G, 1996, MOR KAUF R, P316
[8]  
DEGIACOMO G, 1994, P 12 NAT C ART INT A
[9]  
DEGIACOMO G, 1995, P 14 INT JOINT C ART
[10]  
DEGIACOMO G, 1994, P 11 EUR C ART INT E