ASP(Q) encodings enable the first implementations of globally-optimal repair semantics and a tractable grounded under-approximation for inconsistency-tolerant querying of prioritized data, with complexity in the polynomial hierarchy and supporting experiments.
A Proofs for Section 3 Proposition 1.K ≻ |=G brave q(⃗ a)iffΠG brave is coherent
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
-
Using ASP(Q) to Handle Inconsistent Prioritized Data
ASP(Q) encodings enable the first implementations of globally-optimal repair semantics and a tractable grounded under-approximation for inconsistency-tolerant querying of prioritized data, with complexity in the polynomial hierarchy and supporting experiments.