On the public citation graph
Watched Literals for Constraint Propagation in Minion
0 signed · 58 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/11564751_39openalex-snapshot
Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_45openalex-snapshot
Speeding Up Constraint Propagation
inferredcites →https://doi.org/10.1016/0004-3702(94)90041-8openalex-snapshot
Arc-consistency and arc-consistency again
inferredcites →https://doi.org/10.1016/j.artint.2005.02.004openalex-snapshot
An optimal coarse-grained arc consistency algorithm
inferredcites →https://doi.org/10.1016/s0743-1066(98)10006-7openalex-snapshot
Design, implementation, and evaluation of the constraint language cc(FD)
inferredcites →https://doi.org/10.1145/775832.776041openalex-snapshot
A fast pseudo-boolean constraint solver
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470612309.ch5openalex-snapshot
On the First SAT/CP Integration Workshop
inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_13openalex-snapshot
Connections and Integration with SAT Solvers: A Survey and a Case Study in Computational Biology
inferred← citeshttps://doi.org/10.1007/978-3-319-18008-3_19openalex-snapshot
The Smart Table Constraint
inferred← citeshttps://doi.org/10.1007/978-3-319-98334-9_46openalex-snapshot
Metamorphic Testing of Constraint Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-73580-9_16openalex-snapshot
Tailoring Solver-Independent Constraint Models: A Case Study with Essence′ and Minion
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_30openalex-snapshot
Advisors for Incremental Propagation
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_20openalex-snapshot
From High Girth Graphs to Hard Instances
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_42openalex-snapshot
Edge Matching Puzzles as Hard SAT/CSP Benchmarks
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_44openalex-snapshot
Perfect Derived Propagators
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_54openalex-snapshot
Maintaining State in Propagation Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_7openalex-snapshot
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-642-12251-4_13openalex-snapshot
A Pearl on SAT Solving in Prolog
inferred← citeshttps://doi.org/10.1007/978-3-642-24206-9_11openalex-snapshot
Dyna: Extending Datalog for Modern AI
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_37openalex-snapshot
An Optimal Filtering Algorithm for Table Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_40openalex-snapshot
Towards Solver-Independent Propagators
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_63openalex-snapshot
The Semigroups of Order 10
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_5openalex-snapshot
The Objective-CP Optimization System
inferred← citeshttps://doi.org/10.1007/s10601-012-9128-9openalex-snapshot
On the hardness of solving edge matching puzzles as SAT or CSP problems
inferred← citeshttps://doi.org/10.1007/s10601-012-9133-zopenalex-snapshot
View-based propagator derivation
inferred← citeshttps://doi.org/10.1007/s10601-013-9140-8openalex-snapshot
View-based propagation of decomposable constraints
inferred← citeshttps://doi.org/10.1007/s10601-013-9151-5openalex-snapshot
Propagation engine prototyping with a domain specific language
inferred← citeshttps://doi.org/10.1007/s10601-013-9156-0openalex-snapshot
Optimal and efficient filtering algorithms for table constraints
inferred← citeshttps://doi.org/10.1007/s10601-016-9242-1openalex-snapshot
A microkernel architecture for constraint programming
inferred← citeshttps://doi.org/10.1016/j.artint.2008.10.006openalex-snapshot
Generalised arc consistency for the AllDifferent constraint: An empirical survey
inferred← citeshttps://doi.org/10.1016/j.artint.2010.10.005openalex-snapshot
The extended global cardinality constraint: An empirical survey
inferred← citeshttps://doi.org/10.1016/j.artint.2017.07.006openalex-snapshot
Towards breaking more composition symmetries in partial symmetry breaking
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.02.001openalex-snapshot
Variable and value elimination in binary constraint satisfaction via forbidden patterns
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.024openalex-snapshot
A pearl on SAT and SMT solving in Prolog
inferred← citeshttps://doi.org/10.1109/icse.2012.6227151openalex-snapshot
An automated approach to generating efficient constraint solvers
inferred← citeshttps://doi.org/10.1109/ictai.2012.31openalex-snapshot
The Partner Units Problem a Constraint Programming Case Study
inferred← citeshttps://doi.org/10.1145/1389449.1389480openalex-snapshot
Dynamic variable elimination during propagation solving
inferred← citeshttps://doi.org/10.1145/1452044.1452046openalex-snapshot
Efficient constraint propagation engines
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10437openalex-snapshot
Increasing Nogoods in Restart-Based Search
inferred← citeshttps://doi.org/10.1609/socs.v7i1.18388openalex-snapshot
A Theoretical Framework for Constraint Propagator Triggering
inferred← citeshttps://doi.org/10.1613/jair.4016openalex-snapshot
Optimal Implementation of Watched Literals and More General Techniques
inferred← citeshttps://doi.org/10.3233/978-1-58603-925-7-99openalex-snapshot
How Hard is a Commercial Puzzle: the Eternity II Challenge
inferred← citeshttps://doi.org/10.3233/aic-170740openalex-snapshot
Generalized support and formal development of constraint propagators
inferred← citeshttps://doi.org/10.4230/lipics.cp.2021.19openalex-snapshot
Exhaustive Generation of Benzenoid Structures Sharing Common Patterns
inferred← citeshttps://doi.org/10.48550/arxiv.0908.2050openalex-snapshot
View-based Propagator Derivation
inferred← citeshttps://doi.org/10.48550/arxiv.1002.0134openalex-snapshot
Constraint solvers: An empirical evaluation of design decisions
inferred← citeshttps://doi.org/10.48550/arxiv.1401.5334openalex-snapshot
A Microkernel Architecture for Constraint Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1504.05846openalex-snapshot
Generalized Support and Formal Development of Constraint Propagators
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-111openalex-snapshot
Exploiting short supports for generalised arc consistency for arbitrary constraints
inferred← citeshttps://doi.org/10.70675/03e04021z39fcz4f3bz9d7fza5cd0b4d1b2aopenalex-snapshot
On the use of tasks ordering to solve scheduling problems with constraint programming
inferred← citeshttps://doi.org/10.70675/82a54e1dz8c85z4f6dz9f3az60324fa2f8c1openalex-snapshot
Hybridation de techniques d'apprentissage de clauses en programmation par contraintes
inferred← citeshttps://doi.org/10.70675/9df2da4bz0a0cz4f79z9e51zc54a2aedf39bopenalex-snapshot
POSL a parallel-oriented solver language
inferred← citeshttps://doi.org/10.70675/d211d05az77e8z4a13z8586z26eef1becf74openalex-snapshot
Constrained clustering by constraint programming
inferred← citeshttps://doi.org/10.70675/d79e1ec2zb3ffz45b6z9d97za60d60da54f1openalex-snapshot
SAT en Parallèle
inferred← citeshttps://doi.org/10.82444/warw.33643609openalex-snapshot
Variable elimination in binary CSP via forbidden patterns
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.