Partially finite conjunctive query entailment in the description logic S is in 2-EXPTIME via infinite model surgery.
Since for i=1,2 holds that[f ′ i ]∼K =h(f i), the unary types off ′ i and h(f i)agree
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.