Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance

DOI10.1007/978-3-540-74970-7_33MaRDI QIDQ3523073zbMATH OpenOpenAlexFDO

Authors Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal

Publication date 2 September 2008

Published in Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74970-7_33

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2080297
• Partial (neighbourhood) singleton arc consistency for constraint satisfaction problems
• Exploiting subproblem dominance in constraint programming
• Caching Search States in Permutation Problems
• A CSP search algorithm with responsibility sets and kernels

Cites work

• Backjump-based backtracking for constraint satisfaction problems
• Domain filtering consistencies
• scientific article; zbMATH DE number 1149402 (Why is no real title available?)
• scientific article; zbMATH DE number 2084698 (Why is no real title available?)
• scientific article; zbMATH DE number 2084699 (Why is no real title available?)
• Recording and minimizing nogoods from restarts
• Symmetry breaking revisited
• Theory and Applications of Satisfiability Testing

Cited in

(1)

• Exploiting subproblem dominance in constraint programming

Describes a project that uses

Uses Software

• MiniSat

This page was built for publication: Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance

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