Introduces the first SAT encodings for Pareto- and completion-optimal repairs under general priority relations and evaluates multiple procedures for computing answers under AR, IAR, and brave semantics.
(⇒) Assume that there exists a satisfying assignment ν of ΨX-AR(PotAns) such that ν(x⃗ a) = true, and let Sν = {α | ν(xα) = true}
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
-
Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments
Introduces the first SAT encodings for Pareto- and completion-optimal repairs under general priority relations and evaluates multiple procedures for computing answers under AR, IAR, and brave semantics.