On the public citation graph
Symmetry Definitions for Constraint Satisfaction Problems
0 signed · 45 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/11402763_8openalex-snapshot
Automatically Exploiting Symmetries in Constraint Programming
inferredcites →https://doi.org/10.1007/3-540-45578-7_6openalex-snapshot
Global Cut Framework for Removing Symmetries
inferredcites →https://doi.org/10.1007/3-540-51083-4_51openalex-snapshot
Backtrack searching in the presence of symmetry
inferredcites →https://doi.org/10.1007/3-540-55602-8_172openalex-snapshot
Theoretical study of symmetries in propositional calculus and applications
inferredcites →https://doi.org/10.1007/3-540-56804-2_33openalex-snapshot
On the satisfiability of symmetrical constrained satisfaction problems
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_23openalex-snapshot
Generic SBDD Using Computational Group Theory
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_81openalex-snapshot
Symmetry Breaking in Graceful Graphs
inferredcites →https://doi.org/10.1007/978-3-540-48085-3_6openalex-snapshot
Excluding Symmetries in Constraint-Based Search
inferredcites →https://doi.org/10.1016/s0004-3702(01)00104-7openalex-snapshot
Exploiting symmetries within constraint satisfaction search☆☆This paper is an extended and updated version of [16], presented at the IJCAI-99 conference.
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11754602_11openalex-snapshot
The Challenge of Exploiting Weak Symmetries
inferred← citeshttps://doi.org/10.1007/11889205_46openalex-snapshot
General Symmetry Breaking Constraints
inferred← citeshttps://doi.org/10.1007/11889205_48openalex-snapshot
Reasoning by Dominance in Not-Equals Binary Constraint Networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_9openalex-snapshot
Symmetry in Mathematical Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_14openalex-snapshot
A Novel Approach For Detecting Symmetries in CSP Models
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_16openalex-snapshot
Local Symmetry Breaking During Search in CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_60openalex-snapshot
Groupoids and Conditional Symmetry
inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_31openalex-snapshot
Automatic Generation of Symmetry-Breaking Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_1openalex-snapshot
Symmetry Breaking for Maximum Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_45openalex-snapshot
Proving Symmetries by Model Transformation
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_32openalex-snapshot
Increasing Symmetry Breaking by Preserving Target Symmetries
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_63openalex-snapshot
The Semigroups of Order 10
inferred← citeshttps://doi.org/10.1007/s10107-010-0351-0openalex-snapshot
Reformulations in mathematical programming: automatic symmetry detection and exploitation
inferred← citeshttps://doi.org/10.1007/s10472-010-9174-1openalex-snapshot
Minimal ordering constraints for some families of variable symmetries
inferred← citeshttps://doi.org/10.1007/s10601-008-9057-9openalex-snapshot
On implementing symmetry detection
inferred← citeshttps://doi.org/10.1007/s10994-022-06146-3openalex-snapshot
Lifting symmetry breaking constraints with inductive logic programming
inferred← citeshttps://doi.org/10.1007/s13748-011-0006-2openalex-snapshot
Towards 40 years of constraint reasoning
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.11.008openalex-snapshot
Dominance rules in combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80014-3openalex-snapshot
Symmetry in Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03004-0openalex-snapshot
Chapter 4 Constraint Programming
inferred← citeshttps://doi.org/10.1109/icmwi.2010.5648194openalex-snapshot
Reasoning by symmetry in non-monotonic inference
inferred← citeshttps://doi.org/10.1109/ictai.2006.107openalex-snapshot
Solving Symmetrical CSPs with an Asymmetrical Cost Function
inferred← citeshttps://doi.org/10.1145/3555776.3577830openalex-snapshot
Optimization of the Product Configuration System of Renault
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.8014openalex-snapshot
Exploiting Problem Symmetries in State-Based Planners
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8437openalex-snapshot
Symmetry Breaking Constraints: Recent Results
inferred← citeshttps://doi.org/10.26180/4546099openalex-snapshot
Automatic symmetry detection and dynamic symmetry breaking for constraint programming
inferred← citeshttps://doi.org/10.29007/1j7lopenalex-snapshot
Reconstructing in the Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.5802/roia.26openalex-snapshot
La prise en compte des symétries dans CAIA
inferred← citeshttps://doi.org/10.70675/5aecb201z3c7ez4f94zb14bz5b76736f605eopenalex-snapshot
Constraint modelling and solving of some verification problems
inferred← citeshttps://doi.org/10.70675/63f10ce2z26faz4efcz963dz9a15dea53615openalex-snapshot
Décomposition des jeux dans le domaine du General Game Playing.
inferred← citeshttps://doi.org/10.70675/d211d05az77e8z4a13z8586z26eef1becf74openalex-snapshot
Constrained clustering by constraint programming
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.