pith. sign in

We call the computation tree I acceptingif q=q acc in each (q, a, i)-configuration node without successor configu- ration nodes

for each (q, a, i)-configuration node d, if q∈Q ∃ (resp

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.LO 1

years

2025 1

verdicts

UNVERDICTED 1

representative citing papers

Revisiting Conjunctive Query Entailment for $\mathcal S$

cs.LO · 2025-11-11 · unverdicted · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Revisiting Conjunctive Query Entailment for $\mathcal S$ cs.LO · 2025-11-11 · unverdicted · none · ref 7

    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.