Conjunctive query entailment over S description logic knowledge bases is 2ExpTime-complete even with two transitive roles and Boolean queries, but drops to coNExpTime for rooted queries or single transitive role.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Revisiting Conjunctive Query Entailment for $\mathcal S$
Conjunctive query entailment over S description logic knowledge bases is 2ExpTime-complete even with two transitive roles and Boolean queries, but drops to coNExpTime for rooted queries or single transitive role.