On the public citation graph

Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering?

0 signed · 35 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11965893_1openalex-snapshot
Consistent Query Answering: Five Easy Pieces
inferredcites →https://doi.org/10.1007/3-540-36285-1_14openalex-snapshot
Data Exchange: Semantics and Query Answering
inferredcites →https://doi.org/10.1007/3-540-45022-x_24openalex-snapshot
Constraint Satisfaction Problems and Finite Algebras
inferredcites →https://doi.org/10.1016/j.ic.2004.04.007openalex-snapshot
Minimal-change integrity maintenance using tuple deletions
inferredcites →https://doi.org/10.1016/j.ipl.2011.10.018openalex-snapshot
A dichotomy in the complexity of consistent query answering for queries with two atoms
inferredcites →https://doi.org/10.1016/j.is.2009.03.004openalex-snapshot
Consistent query answers in the presence of universal constraints
inferredcites →https://doi.org/10.1017/cbo9781139060158openalex-snapshot
Foundations of Data Exchange
inferredcites →https://doi.org/10.1109/lics.2000.855784openalex-snapshot
View-based query processing and constraint satisfaction
inferredcites →https://doi.org/10.1109/lics.2003.1210072openalex-snapshot
Tractable conservative constraint satisfaction problems
inferredcites →https://doi.org/10.1109/lics.2011.25openalex-snapshot
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited
inferredcites →https://doi.org/10.1109/lics.2013.62openalex-snapshot
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
inferredcites →https://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferredcites →https://doi.org/10.1145/1120582.1120584openalex-snapshot
A dichotomy theorem for constraint satisfaction problems on a 3-element set
inferredcites →https://doi.org/10.1145/1147376.1147391openalex-snapshot
Consistent query answering in databases
inferredcites →https://doi.org/10.1145/1514894.1514899openalex-snapshot
Repair checking in inconsistent databases
inferredcites →https://doi.org/10.1145/1634.1636openalex-snapshot
A Proof Procedure for Data Dependencies
inferredcites →https://doi.org/10.1145/1807085.1807111openalex-snapshot
On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases
inferredcites →https://doi.org/10.1145/2274576.2274580openalex-snapshot
On the data complexity of consistent query answering
inferredcites →https://doi.org/10.1145/263867.263489openalex-snapshot
Closure properties of constraints
inferredcites →https://doi.org/10.1145/303976.303983openalex-snapshot
Consistent query answers in inconsistent databases
inferredcites →https://doi.org/10.1145/321864.321877openalex-snapshot
On the Structure of Polynomial Time Reducibility
inferredcites →https://doi.org/10.1145/335168.335209openalex-snapshot
Constraint satisfaction and database theory
inferredcites →https://doi.org/10.1145/543613.543644openalex-snapshot
Data integration
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.3233/aic-1989-2101openalex-snapshot
Constraint Satisfaction Problems: An Overview

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00224-020-09985-6openalex-snapshot
Consistent Query Answering for Primary Keys in Datalog
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00235openalex-snapshot
Consistent Subgraph Matching over Large Graphs
inferred← citeshttps://doi.org/10.1145/3034786.3056108openalex-snapshot
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
inferred← citeshttps://doi.org/10.1145/3196959.3196966openalex-snapshot
An Operational Approach to Consistent Query Answering
inferred← citeshttps://doi.org/10.1145/3375395.3387654openalex-snapshot
First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys
inferred← citeshttps://doi.org/10.1145/3377391.3377393openalex-snapshot
Foundations of Query Answering on Inconsistent Databases
inferred← citeshttps://doi.org/10.1145/3452021.3458334openalex-snapshot
Consistent Query Answering for Primary Keys on Path Queries
inferred← citeshttps://doi.org/10.1145/3517804.3524157openalex-snapshot
A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys
inferred← citeshttps://doi.org/10.1145/3651139openalex-snapshot
Consistent Query Answering for Primary Keys on Rooted Tree Queries
inferred← citeshttps://doi.org/10.1145/3695836openalex-snapshot
Computing Range Consistent Answers to Aggregation Queries via Rewriting
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.