|
Research at Sofia University >
Faculty of Mathematics and Informatics >
Papers >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10506/1357
|
| Title: | Description Logic with part restrictions: PSPACE-complete expressiveness |
| Authors: | Yanchev, Mitko |
| Keywords: | Description Logics
part restrictions
complexity
PSPACE |
| Issue Date: | 2014 |
| Series/Report no.: | CiE2014;June 25, 2014 |
| Abstract: | In this paper syntactic objects-concept constructors, called part restrictions-are considered in Description Logics (DLs). Being able to convey statements about a part of a set of successors, part restrictions essentially enrich the expressive capabilities of DLs. An extension of DL ALCQR with part restrictions is examined, and its PSPACE completeness is proven, what shows that the new expressiveness brings no extra cost to the complexity of reasoning in ALCQR. The proof uses completion calculus based on tableaux technique. |
| Description: | Presented at CiE2014 as contributed talk. |
| URI: | http://hdl.handle.net/10506/1357 |
| Appears in Collections: | Papers
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
