A discrete Lagrangian-based global-search method for solving satisfiability problems
From MaRDI portal
Recommendations
Cited in
(21)- Trace-based methods for solving nonlinear global optimization and satisfiability problems
- Experimental complexity analysis of continuous constraint satisfaction problems.
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- A Lagrangian reconstruction of GENET
- Automatically improving constraint models in Savile Row
- A SAT approach to query optimization in mediator systems
- Improving the performance of weighted Lagrange-multiplier methods for nonlinear constrained optimization
- Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient
- A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization
- Timescales of Boolean satisfiability solver using continuous-time dynamical system
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Constraint partitioning in penalty formulations for solving temporal planning problems
- The distributed breakout algorithms
- Solving SAT problem by heuristic polarity decision-making algorithm
- The state of SAT
- scientific article; zbMATH DE number 1114000 (Why is no real title available?)
- Advances in Artificial Intelligence – SBIA 2004
- Practical optimization of group piles using discrete Lagrange multiplier method
- Local search characteristics of incomplete SAT procedures
- Meta-heuristics and artificial intelligence
- Clause weighting local search for SAT
This page was built for publication: A discrete Lagrangian-based global-search method for solving satisfiability problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383842)
