Report icon

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

Actions


Authors


Publisher:
Max−Planck−Institut für Informatik
ISSN:
0946-011X
URN:
uuid:09dad8c8-ab57-4029-9e3f-2cc0acb95402
Local pid:
cs:880

Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP