arXiv (All)
open access
Getting to the Root: A Combined Complexity Perspective on Consistent Query Answering
We study the combined complexity of consistent query answering for Boolean self-join-free conjunctive queries with unary primary keys and acyclic attack graphs. Although every fixed query in this class admits a first-order rewriting [21], we show that allowing the query to vary makes the problem Pi_
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Answering Conjunctive Queries with Aggregations under Updates#1084303
- Answering Conjunctive Queries with Aggregations under Updates#411156
- Logos: Certified Order-Sensitive SQL Rewrites with Mechanized Semantics and LLM Guidance#616853
- Logos: Certified Order-Sensitive SQL Rewrites with Mechanized Semantics and LLM Guidance#616353
- Logos: Certified Order-Sensitive SQL Rewrites with Mechanized Semantics and LLM Guidance#459763
Record · ID 999840
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive