Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
SAT-Encodings, Search Space Structure, and Local Search Performance
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
To Encode or Not to Encode - Linear Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Automatic SAT-compilation of planning problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Solving linear pseudo-Boolean constraint problems with local search
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Capturing Structure with Satisfiability
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Bridging the Gap between SAT and CSP
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
CAMA: A Multi-Valued Satisfiability Solver
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings
Journal of Automated Reasoning
Regular-SAT: A many-valued approach to solving combinatorial problems
Discrete Applied Mathematics
Exploiting hierarchy and structure to efficiently solve graph coloring as SAT
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Solving quantified constraint satisfaction problems
Artificial Intelligence
Comparison of Boolean satisfiability encodings on FPGA detailed routing problems
Proceedings of the conference on Design, automation and test in Europe
Modelling and solving temporal reasoning as propositional satisfiability
Artificial Intelligence
On the refutational completeness of signed binary resolution and hyperresolution
Fuzzy Sets and Systems
Compact Representation of Sets of Binary Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
SAT-based versus CSP-based constraint weighting for satisfiability
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
Mapping CSP into many-valued SAT
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
The log-support encoding of CSP into SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A complete multi-valued SAT solver
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Towards an efficient SAT encoding for temporal reasoning
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Mapping problems with finite-domain variables to problems with boolean variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Programming for modular reconfigurable robots
Programming and Computing Software
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
Fundamenta Informaticae
An algorithm for random signed 3-SAT with intervals
Theoretical Computer Science
| Hi-index | 0.00 |
Much excitement has been generated by the recent success of stochastic local search procedures at finding satisfying assignments to large formulas. Many of the problems on which these methods have been effective are non-Boolean in that they are most naturally formulated in terms of variables with domain sizes greater than two. To tackle such a problem with a Boolean procedure the problem is first reformulated as an equivalent Boolean problem. This paper introduces and studies the alternative of extending a Boolean stochastic local search procedure to operate directly on non-Boolean problems. It then compares the non-Boolean representation to three Boolean representations and presents experimental evidence that the non-Boolean method is often superior for problems with large domain sizes.