On the public citation graph
2 -Way vs.d -Way Branching for CSP
0 signed · 43 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-46135-3_20openalex-snapshot
Resolution Complexity of Random Constraints
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_38openalex-snapshot
Resolution and Constraint Satisfaction
inferredcites →https://doi.org/10.1007/978-3-642-48895-5openalex-snapshot
Mathematical Systems Theory
inferredcites →https://doi.org/10.1007/b13743openalex-snapshot
Principles and practice of constraint programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003 : proceedings
inferredcites →https://doi.org/10.1007/s002360050044openalex-snapshot
Short resolution proofs for a sequence of tricky formulas
inferredcites →https://doi.org/10.1109/sfcs.1998.743514openalex-snapshot
Exponential separations between restricted resolution and cutting planes proof systems
inferredcites →https://doi.org/10.1109/sffcs.1999.814614openalex-snapshot
A study of proof search algorithms for resolution and polynomial calculus
inferredcites →https://doi.org/10.1145/800113.803643openalex-snapshot
Space bounds for a game on graphs
inferredcites →https://doi.org/10.1613/jair.1410openalex-snapshot
Towards Understanding and Harnessing the Potential of Clause Learning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms1011openalex-snapshot
Backtrack Search Techniques And Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-319-01692-4_25openalex-snapshot
Branching Schemes and Variable Ordering Heuristics for Constraint Satisfaction Problems: Is There Something to Learn?
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-540-89982-2_52openalex-snapshot
Constraint-Level Advice for Shaving
inferred← citeshttps://doi.org/10.1007/978-3-540-92800-3_11openalex-snapshot
Present and Future of Practical SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_33openalex-snapshot
Local Consistency and SAT-Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_46openalex-snapshot
Value Ordering for Finding All Solutions: Interactions with Adaptive Variable Ordering
inferred← citeshttps://doi.org/10.1007/s10601-016-9255-9openalex-snapshot
Revisiting restricted path consistency
inferred← citeshttps://doi.org/10.1007/s10732-006-7234-9openalex-snapshot
Exact Max-SAT solvers for over-constrained problems
inferred← citeshttps://doi.org/10.1007/s10732-015-9305-2openalex-snapshot
Improving degree-based variable ordering heuristics for solving constraint satisfaction problems
inferred← citeshttps://doi.org/10.1007/s10732-019-09434-9openalex-snapshot
On combining variable ordering heuristics for constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/j.artint.2009.09.002openalex-snapshot
Reasoning from last conflict(s) in constraint programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80008-8openalex-snapshot
Backtracking Search Algorithms
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1109/access.2018.2859618openalex-snapshot
A Novel Strategy of Combining Variable Ordering Heuristics for Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1109/ictai.2009.38openalex-snapshot
Enhancing Neighbourhood Substitutability Thanks to Singleton Arc Consistency
inferred← citeshttps://doi.org/10.12681/eadd/26336openalex-snapshot
Adaptive strategies for solving contraint satisfaction problems
inferred← citeshttps://doi.org/10.3233/978-1-58603-929-5-205openalex-snapshot
Fundaments of Branching Heuristics
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-855openalex-snapshot
Adaptive Branching for Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.3233/fi-2011-429openalex-snapshot
Constraint Satisfaction Problems in Clausal Form II: Minimal Unsatisfiability and Conflict Structure
inferred← citeshttps://doi.org/10.3233/sat190009openalex-snapshot
Recording and Minimizing Nogoods from Restarts
inferred← citeshttps://doi.org/10.3233/sat190010openalex-snapshot
Using SAT Encodings to Derive CSP Value Ordering Heuristics
inferred← citeshttps://doi.org/10.3929/ethz-a-006113172openalex-snapshot
Exponential Time Complexity of SAT and Related Problems
inferred← citeshttps://doi.org/10.4230/dagsemproc.06401.4openalex-snapshot
Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities
inferred← citeshttps://doi.org/10.48550/arxiv.1009.0407openalex-snapshot
Experimental Evaluation of Branching Schemes for the CSP
inferred← citeshttps://doi.org/10.70675/055d43caz8e52z49b9zaa59zb5746666c554openalex-snapshot
Intégration de techniques CSP pour la résolution du problème WCSP
inferred← citeshttps://doi.org/10.70675/17f60f5aza03ez4c04zaf96z605fe438f7a6openalex-snapshot
Compilation de connaissances pour le comptage de modèles
inferred← citeshttps://doi.org/10.70675/45d3899az8ec7z4c35zbc8fzbf3059eb4b43openalex-snapshot
Programmation par contraintes et chimie théorique : utilisation du formalisme CSP pour résoudre des problématiques liées aux benzénoïdes
inferred← citeshttps://doi.org/10.70675/a4e03b4bz812cz48cdzaceez9a6f8a20f63eopenalex-snapshot
Hypergraphes partiels de largeur bornée, décompositions arborescentes et contraintes globales
inferred← citeshttps://doi.org/10.70675/f4e01b3dzb0c0z48cazb512z9fce896739e7openalex-snapshot
Une nouvelle approche au General Game Playing dirigée par les contraintes
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.