Inconsistent Databases and Argumentation Frameworks with Collective Attacks

• URL: http://arxiv.org/abs/2605.03954v1
• Date: Tue, 05 May 2026 16:38:31 GMT
• Title: Inconsistent Databases and Argumentation Frameworks with Collective Attacks
• Abstract summary: Connection between subset-maximal repairs for inconsistent databases has recently drawn growing interest.<n>In this paper, we contribute to this domain by establishing a new connection when integrity constraints include denial constraints and local-asview-generating dependencies.
• Score: 10.556775730089377
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The connection between subset-maximal repairs for inconsistent databases involving various integrity constraints and acceptable sets of arguments within argumentation frameworks has recently drawn growing interest. In this paper, we contribute to this domain by establishing a new connection when integrity constraints (ICs) include denial constraints and local-as-view tuple-generating dependencies. It turns out that SET-based Argumentation Frameworks (SETAFs), an extension of Dung's argumentation frameworks (AFs) allowing collective attacks, are needed. It is known that subset-maximal repairs under denial constraints correspond to the naive extensions, which also coincide with the preferred and stable extensions in the resulting SETAFs. Our main findings establish that repairs under the considered fragment of tuple-generating dependencies correspond to the preferred extensions. Moreover, for these dependencies, additional preprocessing allows computing a unique extension that is stable and naive. Allowing both types of constraints breaks this relationship, and even the pre-processing does not help as only preferred semantics captures these repairs. Finally, while it is known that functional dependencies do not require set-based attacks, we prove the same regarding inclusion dependencies. Thus, one can translate inconsistent databases under these restricted classes of ICs to plain AFs with attacks only between arguments.

Related papers

• SEER: A Self-Grounded Evidence Interface for Controlled Spatial Relation Classification [71.9783246097687]
  SEER hides candidate relations during pair localization, constructs a query-specific view with explicit subject/object roles, and retains the full image and sparse box geometry as complementary evidence.<n>For relation-choice protocols with exact inverse support, an optional refinement swaps the entity roles and changes the forward decision only when exactly one visual state obeys the corresponding inverse relation.<n>The unchanged protocol yields +4.35 to +11.79 on all 2,434 filtered EmbSpatial pair-relation questions across three models.
  arXiv  Detail & Related papers  (2026-08-04T13:16:15Z)
• Registration-Grounded Spectral Fusion for Unregistered WLI/NBI Endoscopic Lesion Segmentation [87.5409605461001]
  White-light imaging (WLI) and narrow-band imaging (NBI) provide complementary views of endoscopic lesions.<n>Their paired observations are often spatially misaligned due to viewpoint changes, tissue deformation, and sequential handheld acquisition.<n>We propose a reliability-aware complex-domain fusion framework for paired-but-unregistered WLI/NBI lesion segmentation.
  arXiv  Detail & Related papers  (2026-07-29T02:09:28Z)
• Bound-Founded Semantics for Answer Set Programming with Difference Constraints: Preliminary Report [8.449521131218907]
  hybrid solvers often rely on disparate semantic underpinnings that lack a unified logical foundation.<n>We introduce a many-sorted variant of the Bound-founded Logic of Here-and-There (HTb)<n>We apply this framework to the setting of difference constraints, focusing on the semantic characterization of clingo[DL]
  arXiv  Detail & Related papers  (2026-07-23T11:19:58Z)
• Reasoning as an Attack Surface: Adaptive Evolutionary CoT Jailbreaks for LLMs [56.53007443197966]
  Large Reasoning Models (LRMs) have demonstrated remarkable capabilities in reasoning and generation tasks.<n>Their explicit chain-of-thought (CoT) mechanism introduces new security risks, making them particularly vulnerable to jailbreak attacks.<n>We propose an adaptive evolutionary CoT jailbreak framework, called AE-CoT, to overcome these limitations.
  arXiv  Detail & Related papers  (2026-05-23T10:11:32Z)
• Dynamic analysis enhances issue resolution [53.50448142467294]
  DAIRA (Dynamic Analysis-enhanced Issue Resolution Agent) is an automated repair framework that embeds dynamic analysis into the agent's reasoning cycle.<n> Driven by a Test Tracing-Driven methodology, DAIRA utilizes lightweight monitors to extract critical runtime data.<n>When powered by Gemini 3 Flash Preview, DAIRA establishes a new state-of-the-art (SOTA) performance, achieving a 79.4% resolution rate on the SWE-bench Verified dataset.
  arXiv  Detail & Related papers  (2026-03-23T14:48:54Z)
• Breaking Contextual Inertia: Reinforcement Learning with Single-Turn Anchors for Stable Multi-Turn Interaction [49.03500737694832]
  We introduce textbfReinforcement textbfLearning with textbfTurn textbfRLSTA, a generalizable training approach designed to stabilize multi-turn interaction.<n>Experiments show that RLSTA significantly outperforms standard fine-tuning and abstention-based methods.
  arXiv  Detail & Related papers  (2026-03-05T04:04:59Z)
• Breaking the Factorization Barrier in Diffusion Language Models [59.946071582340146]
  "Factorization barrier" impedes efficient parallel generation of diffusion language models.<n>We propose Coupled Discrete Diffusion to replace the fully-factorized output distribution.<n>We show that CoDD seamlessly enhances diverse diffusion language model architectures with negligible overhead.
  arXiv  Detail & Related papers  (2026-02-09T08:36:39Z)
• Retrieval is Not Enough: Enhancing RAG Reasoning through Test-Time Critique and Optimization [58.390885294401066]
  Retrieval-augmented generation (RAG) has become a widely adopted paradigm for enabling knowledge-grounded large language models (LLMs)<n>RAG pipelines often fail to ensure that model reasoning remains consistent with the evidence retrieved, leading to factual inconsistencies or unsupported conclusions.<n>We propose AlignRAG, a novel iterative framework grounded in Critique-Driven Alignment (CDA)<n>We introduce AlignRAG-auto, an autonomous variant that dynamically terminates refinement, removing the need to pre-specify the number of critique iterations.
  arXiv  Detail & Related papers  (2025-04-21T04:56:47Z)
• Consistent Query Answering for Existential Rules with Closed Predicates [2.559168320734115]
  Consistent Query Answering (CQA) is an inconsistency-tolerant approach to data access in databases. We study CQA in databases with data dependencies expressed by existential rules.
  arXiv  Detail & Related papers  (2024-01-11T08:48:40Z)
• Inconsistency Handling in Prioritized Databases with Universal Constraints: Complexity Analysis and Links with Active Integrity Constraints [2.4622211579286133]
  This paper revisits the problem of repairing and querying inconsistent databases equipped with universal constraints.<n>We adopt symmetric difference repairs, in which both deletions and additions of facts can be used to restore consistency.<n>We show how existing notions of optimal repairs, defined for simpler denial constraints and repairs solely based on fact deletion, can be suitably extended to our richer setting.
  arXiv  Detail & Related papers  (2023-06-06T09:17:56Z)
• Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation [5.87010466783654]
  We study the issue of inconsistency over prioritized knowledge bases (KBs) We propose a novel semantics for prioritized KBs inspired by grounded extensions and enjoys favourable properties. Our study also yields some results of independent interest concerning preference-based argumentation frameworks.
  arXiv  Detail & Related papers  (2020-03-12T12:38:37Z)
• An ASP semantics for Constraints involving Conditional Aggregates [9.289905977910378]
  We elaborate upon the formal foundations of hybrid Answer Set Programming (ASP) We extend its underlying logical framework with aggregate functions over constraint values and variables. We put some emphasis on logic programs with linear constraints and show how common ASP aggregates can be regarded as particular cases of so-called conditional linear constraints.
  arXiv  Detail & Related papers  (2020-02-17T12:25:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.