Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance

DOI10.1007/978-3-540-74970-7_33zbMath1145.68523OpenAlexW180890605MaRDI QIDQ3523073

Lakhdar Saïs, Vincent Vidal, Sébastien Tabary, Christophe Lecoutre

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)

Uses Software

• MiniSat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Backjump-based backtracking for constraint satisfaction problems
• Symmetry breaking revisited
• Theory and Applications of Satisfiability Testing

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