Partially finite conjunctive query entailment in the description logic S is in 2-EXPTIME via infinite model surgery.
It remains to see thatf ′′′ 2 =f ′ 2, but this follows directly from the fact that IisK-sparse andK>0
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Partially Finite Model Reasoning in Description Logics Extended Version
Partially finite conjunctive query entailment in the description logic S is in 2-EXPTIME via infinite model surgery.