Compiling Finite Linear CSP into SAT

DOI10.1007/11889205_42zbMath1160.68567OpenAlexW1986964870MaRDI QIDQ3524260

Naoyuki Tamura, Akiko Taga, Mutsunori Banbara, Satoshi Kitagawa

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11889205_42

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Compiling finite linear CSP into SAT, Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop, Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction, Promoting robust black-box solvers through competitions, Propagation = Lazy Clause Generation, Propagation via lazy clause generation, An Optimal Constraint Programming Approach to the Open-Shop Problem, SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM

Uses Software

• Sugar