Propagation = Lazy Clause Generation
From MaRDI portal
Recommendations
- Propagation via lazy clause generation
- Lazy clause generation: combining the power of SAT and CP (and MIP?) solving
- Explaining the \texttt{cumulative} propagator
- Automatic generation of rule-based constraint solvers over finite domains
- Generalized support and formal development of constraint propagators
Cites work
- Compiling Finite Linear CSP into SAT
- Design, implementation, and evaluation of the constraint language cc(FD)
- scientific article; zbMATH DE number 1312992 (Why is no real title available?)
- scientific article; zbMATH DE number 2080324 (Why is no real title available?)
- Logic for Programming, Artificial Intelligence, and Reasoning
- Propagation redundancy in redundant modelling
Cited in
(16)- Redundant cumulative constraints to compute preemptive bounds
- Scheduling double round-robin tournaments with divisional play using constraint programming
- Debugging unsatisfiable constraint models
- Finding subgraphs with side constraints
- Propagation via lazy clause generation
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Explaining circuit propagation
- Symmetries, almost symmetries, and lazy clause generation
- Clause-learning for modular systems
- Watched Literals for Constraint Propagation in Minion
- Lazy clause generation: combining the power of SAT and CP (and MIP?) solving
- Constraint and satisfiability reasoning for graph coloring
- An interdisciplinary experimental evaluation on the disjunctive temporal problem
- Explaining the \texttt{cumulative} propagator
- Synchronization and control of cellular automata
- Decision levels are stable: towards better SAT heuristics
This page was built for publication: Propagation = Lazy Clause Generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523077)
