Compiling Finite Linear CSP into SAT

DOI10.1007/11889205_42MaRDI QIDQ3524260zbMATH OpenOpenAlexFDO

Authors Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara

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

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

Recommendations

• Compiling finite linear CSP into SAT
• meSAT: multiple encodings of CSP to SAT
• The Log-Support Encoding of CSP into SAT
• Representative encodings to translate finite CSPs into SAT
• Efficient encodings from CSP into SAT, and from MaxCSP into MaxSAT

Cited in

(12)

• The Log-Support Encoding of CSP into SAT
• Compiling problem specifications into SAT
• An optimal constraint programming approach to the open-shop problem
• scientific article; zbMATH DE number 1975617 (Why is no real title available?)
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• Propagation = Lazy Clause Generation
• Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
• Promoting robust black-box solvers through competitions
• Propagation via lazy clause generation
• Compiling finite linear CSP into SAT
• Compiling finite domain constraints to SAT with BEE

Describes a project that uses

Uses Software

• Sugar

This page was built for publication: Compiling Finite Linear CSP into SAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524260)