Tighter complexity bounds for open-world conjunctive query answering under guarded TGDs: EXPTIME when bounding side-signature arity (arbitrary guard arity) and NP when fixing the side signature and bounding dependency width, via a variant of linearization with restricted chase.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Tighter Bounds for Query Answering with Guarded TGDs
Tighter complexity bounds for open-world conjunctive query answering under guarded TGDs: EXPTIME when bounding side-signature arity (arbitrary guard arity) and NP when fixing the side signature and bounding dependency width, via a variant of linearization with restricted chase.