A review of literature on parallel constraint solving
As multi-core computing is now standard, it seems irresponsible for constraints researchers
to ignore the implications of it. Researchers need to address a number of issues to exploit …
to ignore the implications of it. Researchers need to address a number of issues to exploit …
Complexity of n-queens completion
The n-Queens problem is to place n chess queens on an n by n chessboard so that no two
queens are on the same row, column or diagonal. The n-Queens Completion problem is a …
queens are on the same row, column or diagonal. The n-Queens Completion problem is a …
[HTML][HTML] Conjure: Automatic generation of constraint models from problem specifications
When solving a combinatorial problem, the formulation or model of the problem is critical to
the efficiency of the solver. Automating the modelling process has long been of interest …
the efficiency of the solver. Automating the modelling process has long been of interest …
Progress towards the holy grail
EC Freuder - Constraints, 2018 - Springer
Progress towards the Holy Grail | SpringerLink Skip to main content Advertisement
SpringerLink Log in Menu Find a journal Publish with us Search Cart 1.Home 2.Constraints …
SpringerLink Log in Menu Find a journal Publish with us Search Cart 1.Home 2.Constraints …
Enumeration of set-theoretic solutions to the Yang–Baxter equation
Ö Akgün, M Mereb, L Vendramin - Mathematics of Computation, 2022 - ams.org
We use Constraint Satisfaction methods to enumerate and construct set-theoretic solutions
to the Yang–Baxter equation of small size. We show that there are 321,931 involutive …
to the Yang–Baxter equation of small size. We show that there are 321,931 involutive …
Efficiently explaining CSPs with unsatisfiable subset optimization
We build on a recently proposed method for stepwise explaining the solutions to Constraint
Satisfaction Problems (CSPs) in a human understandable way. An explanation here is a …
Satisfaction Problems (CSPs) in a human understandable way. An explanation here is a …
Constraint programming and operations research
JN Hooker, WJ van Hoeve - Constraints, 2018 - Springer
We present an overview of the integration of constraint programming (CP) and operations
research (OR) to solve combinatorial optimization problems. We interpret CP and OR as …
research (OR) to solve combinatorial optimization problems. We interpret CP and OR as …
[PDF][PDF] Selecting SAT encodings for pseudo-boolean and linear integer constraints
F Ulrich-Oltean, P Nightingale… - … Conference on Principles …, 2022 - pure.york.ac.uk
Many constraint satisfaction and optimisation problems can be solved effectively by
encoding them as instances of the Boolean Satisfiability problem (SAT). However, even the …
encoding them as instances of the Boolean Satisfiability problem (SAT). However, even the …
Automatic detection of at-most-one and exactly-one relations for improved SAT encodings of pseudo-boolean constraints
Pseudo-Boolean (PB) constraints often have a critical role in constraint satisfaction and
optimisation problems. Encoding PB constraints to SAT has proven to be an efficient …
optimisation problems. Encoding PB constraints to SAT has proven to be an efficient …
SAT encodings for Pseudo-Boolean constraints together with at-most-one constraints
When solving a combinatorial problem using propositional satisfiability (SAT), the encoding
of the problem is of vital importance. We study encodings of Pseudo-Boolean (PB) …
of the problem is of vital importance. We study encodings of Pseudo-Boolean (PB) …