Using SAT encodings to derive CSP value ordering heuristics

MaRDI QIDQ5457275zbMATH OpenFDO

Authors Christophe Lecoutre, Lakhdar Sais, Julien Vion

Publication date 14 April 2008

zbMATH Keywords

backtracking search algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Efficient encodings from CSP into SAT, and from MaxCSP into MaxSAT
• Evaluating and improving modern variable and revision ordering strategies in CSPs
• meSAT: multiple encodings of CSP to SAT
• Representative encodings to translate finite CSPs into SAT
• Value ordering for quantified CSPs

Cited in

(8)

• Value ordering for quantified CSPs
• Weight-based heuristics for constraint satisfaction and combinatorial optimization problems
• Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
• Evaluating and improving modern variable and revision ordering strategies in CSPs
• scientific article; zbMATH DE number 6519724 (Why is no real title available?)
• CSPs with counters: a likelihood-based heuristic
• Recent Advances in Constraints
• Theory and Applications of Satisfiability Testing

This page was built for publication: Using SAT encodings to derive CSP value ordering heuristics

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