On the public citation graph

Arc consistency and friends

0 signed · 49 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/978-3-540-30201-8_9openalex-snapshot
Constraint Propagation as a Proof System
inferredcites →https://doi.org/10.1007/978-3-540-48085-3_12openalex-snapshot
Closure Functions and Width 1 Problems
inferredcites →https://doi.org/10.1007/978-3-540-73420-8_25openalex-snapshot
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1007/978-3-540-73420-8_26openalex-snapshot
On the Power of k-Consistency
inferredcites →https://doi.org/10.1007/978-3-540-92800-3_4openalex-snapshot
Recent Results on the Algebraic Approach to the CSP
inferredcites →https://doi.org/10.1007/978-3-642-04027-6_10openalex-snapshot
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1007/s00012-007-2012-6openalex-snapshot
Bounded width problems and algebras
inferredcites →https://doi.org/10.1016/0020-0255(79)90023-9openalex-snapshot
Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
inferredcites →https://doi.org/10.1016/j.artint.2007.09.001openalex-snapshot
Theoretical analysis of singleton arc consistency and its extensions
inferredcites →https://doi.org/10.1016/j.ejc.2007.11.020openalex-snapshot
Majority constraints have bounded pathwidth duality
inferredcites →https://doi.org/10.1016/j.jalgebra.2004.07.044openalex-snapshot
Combinatorial problems raised from 2-semilattices
inferredcites →https://doi.org/10.1016/j.tcs.2008.12.049openalex-snapshot
Affine systems of equations and counting infinitary logic
inferredcites →https://doi.org/10.1016/j.tcs.2009.07.059openalex-snapshot
Peek arc consistency
inferredcites →https://doi.org/10.1016/s0004-3702(98)00022-8openalex-snapshot
Constraints, consistency and closure
inferredcites →https://doi.org/10.1109/focs.2009.32openalex-snapshot
Constraint Satisfaction Problems of Bounded Width
inferredcites →https://doi.org/10.1137/090775646openalex-snapshot
Tractability and Learnability Arising from Algebras with Few Subpowers
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/800105.803397openalex-snapshot
Optimal implementation of conjunctive queries in relational data bases

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_6openalex-snapshot
Constraint Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-21810-6_5openalex-snapshot
From CSP to SAT: width restrictions
inferred← citeshttps://doi.org/10.1007/978-3-319-21810-6_6openalex-snapshot
From CSP to SAT: language restrictions
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_33openalex-snapshot
Local Consistency and SAT-Solvers
inferred← citeshttps://doi.org/10.1007/s00012-025-00900-zopenalex-snapshot
Słupecki digraphs
inferred← citeshttps://doi.org/10.1007/s00453-018-0498-2openalex-snapshot
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns
inferred← citeshttps://doi.org/10.1007/s10472-017-9552-zopenalex-snapshot
On tree-preserving constraints
inferred← citeshttps://doi.org/10.1007/s10472-017-9566-6openalex-snapshot
A polynomial relational class of binary CSP
inferred← citeshttps://doi.org/10.1007/s10601-015-9198-6openalex-snapshot
Tractability in constraint satisfaction problems: a survey
inferred← citeshttps://doi.org/10.1007/s11431-017-9197-3openalex-snapshot
Geometry-based distributed arc-consistency method for multiagent planning and scheduling
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.10.002openalex-snapshot
Quantum advantage and CSP complexity
inferred← citeshttps://doi.org/10.1093/comjnl/bxx122openalex-snapshot
Exploring Directional Path-Consistency for Solving Constraint Networks
inferred← citeshttps://doi.org/10.1093/logcom/exu070openalex-snapshot
The collapse of the bounded width hierarchy
inferred← citeshttps://doi.org/10.1137/1.9781611977073.46openalex-snapshot
CLAP: A New Algorithm for Promise CSPs
inferred← citeshttps://doi.org/10.1137/140957378openalex-snapshot
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
inferred← citeshttps://doi.org/10.1137/18m117577xopenalex-snapshot
Solving CSPs Using Weak Local Consistency
inferred← citeshttps://doi.org/10.1137/22m1476435openalex-snapshot
CLAP: A New Algorithm for Promise CSPs
inferred← citeshttps://doi.org/10.1142/s0218213018600035openalex-snapshot
Building Search Methods with Self-Confidence in a Constraint Programming Library
inferred← citeshttps://doi.org/10.1145/2528933openalex-snapshot
Constraint satisfaction tractability from semi-lattice operations on infinite sets
inferred← citeshttps://doi.org/10.1145/2933575.2934510openalex-snapshot
Weak consistency notions for all the CSPs of bounded width
inferred← citeshttps://doi.org/10.1145/3134757openalex-snapshot
Asking the Metaquestions in Constraint Tractability
inferred← citeshttps://doi.org/10.1145/3143805openalex-snapshot
One Hierarchy Spawns Another
inferred← citeshttps://doi.org/10.1145/3661814.3662118openalex-snapshot
Quantum advantage and CSP complexity
inferred← citeshttps://doi.org/10.1145/3770855.3817754openalex-snapshot
Efficient and Scalable Neural-Symbolic Search for Complex Query Answering over Incomplete Knowledge Graphs
inferred← citeshttps://doi.org/10.1145/3858670openalex-snapshot
Extremal Fitting Problems for Conjunctive Queries
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10432openalex-snapshot
The Meta-Problem for Conservative Mal'tsev Constraints
inferred← citeshttps://doi.org/10.2168/lmcs-10(4:14)2014openalex-snapshot
Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction
inferred← citeshttps://doi.org/10.23638/dmtcs-22-1-10openalex-snapshot
New schemes for simplifying binary constraint satisfaction problems
inferred← citeshttps://doi.org/10.48550/arxiv.1605.00565openalex-snapshot
Weaker consistency notions for all the CSPs of bounded width
inferred← citeshttps://doi.org/10.48550/arxiv.1808.10068openalex-snapshot
A polynomial-time algorithm for median-closed semilinear constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1909.05901openalex-snapshot
Examples, counterexamples, and structure in bounded width algebras
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.