Subsumption of concepts in DL FL0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE−complete
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
| Main Authors: | , |
|---|---|
| Format: | Report |
| Published: |
Max−Planck−Institut für Informatik
2015
|