Using ASP(Q) to Handle Inconsistent Prioritized Data

Meghyn Bienvenu, Camille Bourgaux, Robin Jean, Giuseppe Mazzotta
4/23/2026
cs.LOcs.AIcs.DB

No confident code implementation found for this paper.

Abstract

We explore the use of answer set programming (ASP) and its extension with quantifiers, ASP(Q), for inconsistency-tolerant querying of prioritized data, where a priority relation between conflicting facts is exploited to define three notions of optimal repairs (Pareto-, globally- and completion-optimal). We consider the variants of three well-known semantics (AR, brave and IAR) that use these optimal repairs, and for which query answering is in the first or second level of the polynomial hierarchy for a large class of logical theories. Notably, this paper presents the first implementation of globally-optimal repair-based semantics, as well as the first implementation of the grounded semantics, which is a tractable under-approximation of all these optimal repair-based semantics. Our experimental evaluation sheds light on the feasibility of computing answers under globally-optimal repair semantics and the impact of adopting different semantics, approximations, and encodings.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Computational Complexity of Preferred Subset Repairs on Data-Graphs

83% match2024

Goal-Driven Query Answering over First- and Second-Order Dependencies with Equality

78% match2024

Generalizing Level Ranking Constraints for Monotone and Convex Aggregates

78% match2023

ExplAIner: A Declarative Query Language for Explaining Classification Models

78% match2026

Quantifying over Optimum Answer Sets

78% match2024

Refining Gelfond Rationality Principle Towards More Comprehensive Foundational Principles for Answer Set Semantics

78% match2025

Cite this paper

@article{bienvenu2026using,
  title  = {Using ASP(Q) to Handle Inconsistent Prioritized Data},
  author = {Meghyn Bienvenu and Camille Bourgaux and Robin Jean and Giuseppe Mazzotta},
  year   = {2026},
  eprint = {2604.21603},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2604.21603v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2604.21603.svg)](https://codeofpaper.com/paper/2604.21603)

Discussion