Compiling finite linear CSP into SAT

Authors:
Naoyuki Tamura;Akiko Taga;Satoshi Kitagawa;Mutsunori Banbara
Affiliations:
Information Science and Technology Center, Kobe University, Japan;Graduate School of Science and Technology, Kobe University, Japan;Graduate School of Science and Technology, Kobe University, Japan;Information Science and Technology Center, Kobe University, Japan
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 12
Cited 19

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
Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling

Computers and Operations Research
Automatic SAT-compilation of planning problems

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
A comparison of ATMS and CSP techniques

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
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

Modelling for lazy clause generation

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Global difference constraint propagation for finite domain solvers

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Universal Booleanization of Constraint Models

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Compiling finite linear CSP into SAT

Constraints
SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM

Cybernetics and Systems
Propagation via lazy clause generation

Constraints
Finite Satisfiability in Infinite-Valued Łukasiewicz Logic

SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Propagation = lazy clause generation

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Lazy clause generation reengineered

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Promoting robust black-box solvers through competitions

Constraints
A translational approach to constraint answer set solving

Theory and Practice of Logic Programming
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
Models and strategies for variants of the job shop scheduling problem

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop

Mathematical and Computer Modelling: An International Journal
An Optimal Constraint Programming Approach to the Open-Shop Problem

INFORMS Journal on Computing
Translation-based constraint answer set solving

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
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
Just-in-time compilation of knowledge bases

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a 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 is basically the same with 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 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.