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

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Share
Cite

Cite this record

APA Style

Kazakov, Y., & de Nivelle, H. (2015). Subsumption of concepts in DL FL0 for (cyclic) terminologies with respect to descriptive semantics is PSPACE−complete. Max−Planck−Institut für Informatik.

MLA Style

Kazakov, Y, and H de Nivelle. Subsumption of Concepts in DL FL0 for (Cyclic) Terminologies with Respect to Descriptive Semantics Is PSPACE−Complete. Max−Planck−Institut für Informatik, 2015.

Chicago Style

Kazakov, Y, and H de Nivelle. 2015. Subsumption of Concepts in DL FL0 for (Cyclic) Terminologies with Respect to Descriptive Semantics Is PSPACE−Complete. Max−Planck−Institut für Informatik.
Print

Authors

+ Kazakov, Y More by this author

Role:: Author

+ de Nivelle, H More by this author

Role:: Author

Publisher:: Max−Planck−Institut für Informatik
Publication date:: 2015-01-01
ISSN:: 0946-011X

UUID:: uuid:09dad8c8-ab57-4029-9e3f-2cc0acb95402
Local pid:: cs:880
Deposit date:: 2015-03-31
ARK identifier:: ark:/29072/ora_09dad8c8ab5740299e3f2cc0acb95402

Terms of use

Copyright date:: 2015

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About 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