Propagation via lazy clause generation
From MaRDI portal
Publication:2272160
DOI10.1007/s10601-008-9064-xzbMath1192.68654OpenAlexW2059035667MaRDI QIDQ2272160
Michael Codish, Olga Ohrimenko, Peter J. Stuckey
Publication date: 6 August 2009
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-008-9064-x
Related Items (44)
On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming ⋮ Learning general constraints in CSP ⋮ Branch-and-cut-and-price for multi-agent path finding ⋮ Automatic Minimal-Height Table Layout ⋮ Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations ⋮ Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint ⋮ Coupling different integer encodings for SAT ⋮ A MinCumulative resource constraint ⋮ Towards breaking more composition symmetries in partial symmetry breaking ⋮ Comparing optimization methods for radiation therapy patient scheduling using different objectives ⋮ Clingcon: The next generation ⋮ Automatic generation of dominance breaking nogoods for a class of constraint optimization problems ⋮ Exact and metaheuristic methods for a real-world examination timetabling problem ⋮ Using constraint programming for solving RCPSP/MAX-cal ⋮ MDD propagators with explanation ⋮ Solving RCPSP/max by lazy clause generation ⋮ Solving finite-domain linear constraints in presence of the $\texttt{alldifferent}$ ⋮ Constraint CNF: SAT and CSP Language Under One Roof. ⋮ Exploiting subproblem dominance in constraint programming ⋮ Explaining the \texttt{cumulative} propagator ⋮ Modular Constraint Solver Cooperation via Abstract Interpretation ⋮ Nutmeg: a MIP and CP hybrid solver using branch-and-check ⋮ Solving constraint satisfaction problems with SAT modulo theories ⋮ Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One ⋮ Integrating operations research in constraint programming ⋮ SMCHR: Satisfiability modulo constraint handling rules ⋮ Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems ⋮ A complete solution to the maximum density still life problem ⋮ Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges ⋮ Scenario-based learning for stochastic combinatorial optimisation ⋮ Approximating \(k\)-forest with resource augmentation: a primal-dual approach ⋮ A constraint programming primer ⋮ CP methods for scheduling and routing with~time-dependent task costs ⋮ Inlining External Sources in Answer Set Programs ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories ⋮ Wombit: a portfolio bit-vector solver using word-level propagation ⋮ A new branch-and-filter exact algorithm for binary constraint satisfaction problems ⋮ Explaining circuit propagation ⋮ Explanation-based large neighborhood search ⋮ meSAT: multiple encodings of CSP to SAT ⋮ Dominance breaking constraints ⋮ Learning variable activity initialisation for lazy clause generation solvers ⋮ Assessing progress in SAT solvers through the Lens of incremental SAT
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Radio link frequency assignment
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- Propagation = Lazy Clause Generation
- Compiling Finite Linear CSP into SAT
- Design, implementation, and evaluation of the constraint language cc(FD)
- Removing propagation redundant constraints in redundant modeling
- A machine program for theorem-proving
- Logic for Programming, Artificial Intelligence, and Reasoning
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2003
- Recent Advances in Constraints
This page was built for publication: Propagation via lazy clause generation
