Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language FL₀, which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This report investigates subsumption in the presence of terminological cycles for the language EL, which allows for conjunction and existential restrictions. In contrast to the results for FL₀, subsumption in EL remains polynomial, independent of wether we use least fixpoint semantics, greatest fixpoint semantics, or descriptive semantics. These results are shown via a characterization of subsumption through the existence of certain simulation relations between nodes of the description graph associated with a given cyclic terminology. / This is an updated version of the original report, in which some errors in Section 3.1 of the original report have been corrected.
Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:79020 |
Date | 30 May 2022 |
Creators | Baader, Franz |
Publisher | Technische Universität Dresden |
Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
Language | English |
Detected Language | English |
Type | info:eu-repo/semantics/acceptedVersion, doc-type:report, info:eu-repo/semantics/report, doc-type:Text |
Rights | info:eu-repo/semantics/openAccess |
Relation | urn:nbn:de:bsz:14-qucosa2-785040, qucosa:78504 |
Page generated in 0.0019 seconds