Propagation = Lazy Clause Generation

DOI10.1007/978-3-540-74970-7_39zbMath1145.68527OpenAlexW1546943373WikidataQ56039655 ScholiaQ56039655MaRDI QIDQ3523077

Peter J. Stuckey, Olga Ohrimenko, Michael Codish

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_39

Mathematics Subject Classification ID

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

Related Items (11)

Clause-Learning for Modular Systems ⋮ Redundant cumulative constraints to compute preemptive bounds ⋮ An interdisciplinary experimental evaluation on the disjunctive temporal problem ⋮ Explaining the \texttt{cumulative} propagator ⋮ Constraint and Satisfiability Reasoning for Graph Coloring ⋮ Scheduling double round-robin tournaments with divisional play using constraint programming ⋮ Debugging unsatisfiable constraint models ⋮ Propagation via lazy clause generation ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories ⋮ Symmetries, almost symmetries, and lazy clause generation ⋮ Finding subgraphs with side constraints

Cites Work

• Compiling Finite Linear CSP into SAT
• Design, implementation, and evaluation of the constraint language cc(FD)
• Logic for Programming, Artificial Intelligence, and Reasoning
• Principles and Practice of Constraint Programming – CP 2003
• Unnamed Item
• Unnamed Item

This page was built for publication: Propagation = Lazy Clause Generation