Report

### Subsumption of concepts in DL FL0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE−complete

Abstract:
We prove the PSPACE-completeness of the subsumption problem for(cyclic) terminologies with respect to descriptive semantics in a simple Description Logic \\cal FL_0, which allows for conjunctions and universal value restrictions only, thus solving the problem which was open for more than ten years

### Authors

Publisher:
Max−Planck−Institut für Informatik
ISSN:
0946-011X
UUID:
Local pid:
cs:880
Deposit date:
2015-03-31