A New n-Ary Existential Quantifier in Description Logics
Author(s) -
Franz Baader,
Eldar Karabaev,
Carsten Lutz,
Manfred Theißen
Publication year - 2005
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-28761-2
DOI - 10.1007/11551263_4
Subject(s) - quantifier elimination , computer science , quantifier (linguistics) , extension (predicate logic) , existentialism , representation (politics) , process (computing) , exponential function , algebra over a field , theoretical computer science , discrete mathematics , algorithm , programming language , mathematics , artificial intelligence , pure mathematics , mathematical analysis , philosophy , epistemology , politics , political science , law
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constructor, which generalizes both the usual existential restrictions and so-called qualified number restrictions. We show that the new constructor can be expressed in , the extension of the basic DL by qualified number restrictions. However, this representation results in an exponential blow-up. By giving direct algorithms for extended with the new constructor, we can show that the complexity of reasoning in this new DL is actually not harder than the one of reasoning in . Moreover, in our chemical process engineering application, a restricted DL that provides only the new constructor together with conjunction, and satisfies an additional restriction on the occurrence of roles names, is sufficient. For this DL, the subsumption problem is polynomial.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom