Experimental results on the application of satisfiability algorithms to scheduling problems
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
A branch & bound algorithm for the open-shop problem
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Local search with constraint propagation and conflict-based heuristics
Artificial Intelligence
SAT-Encodings, Search Space Structure, and Local Search Performance
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A competitive and cooperative approach to propositional satisfiability
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Computers and Operations Research
Automatic SAT-compilation of planning problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Complete MCS-based search: application to resource constrained project scheduling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling finite linear CSP into SAT
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
On the use of different types of knowledge in metaheuristics based on constructing solutions
Engineering Applications of Artificial Intelligence
Automatic and efficient simulation of operation contracts
GPCE '10 Proceedings of the ninth international conference on Generative programming and component engineering
A complete multi-valued SAT solver
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Local consistency and SAT-solvers
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
The order encoding: from tractable CSP to tractable SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
A compact and efficient SAT-encoding of finite domain CSP
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
A CSP solver focusing on FAC variables
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Boolean equi-propagation for optimized SAT encoding
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Solving constraint satisfaction problems with SAT technology
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
Journal of Automated Reasoning
Azucar: a SAT-based CSP solver using compact order encoding
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Constraint propagation as the core of local search
SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
Solving periodic event scheduling problems with SAT
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Local consistency and SAT-solvers
Journal of Artificial Intelligence Research
Compiling finite domain constraints to sat with bee*
Theory and Practice of Logic Programming
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
Journal of Artificial Intelligence Research
A SAT approach to clique-width
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Scarab: a rapid prototyping tool for SAT-based constraint programming systems
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Automatic generation of basis test paths using variable length genetic algorithm
Information Processing Letters
| Hi-index | 0.00 |
In this paper, we propose a new method to encode Constraint Satisfaction Problems (CSP) and Constraint Optimization Problems (COP) with integer linear constraints into Boolean Satisfiability Testing Problems (SAT). The encoding method (named order encoding) is basically the same as the one used to encode Job-Shop Scheduling Problems by Crawford and Baker. Comparison x驴驴驴a is encoded by a different Boolean variable for each integer variable x and integer value a. To evaluate the effectiveness of this approach, we applied the method to the Open-Shop Scheduling Problems (OSS). All 192 instances in three OSS benchmark sets are examined, and our program found and proved the optimal results for all instances including three previously undecided problems.