MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
DOI10.1016/J.ARTINT.2005.01.004zbMATH Open1132.68716OpenAlexW2029688740MaRDI QIDQ2457672
Publication date: 23 October 2007
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2005.01.004
linear programmingnonlinear programmingvariable orderingunit propagationDPLLweighted maximum satisfiability
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Approximation algorithms for combinatorial problems
- The complexity of theorem-proving procedures
- Linear Programming
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Smoothed analysis of algorithms
- Some results and experiments in programming techniques for propositional logic
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Branch-and-cut solution of inference problems in propositional logic
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Algorithms for the maximum satisfiability problem
- Branching rules for satisfiability
- New Upper Bounds for Maximum Satisfiability
- Exact Algorithms for MAX-SAT
- Input Proofs and Rank One Cutting Planes
- Integer optimization by local search. A domain-independent approach
- An Empirical Study of MAX-2-SAT Phase Transitions
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2004
Cited In (30)
- A Spectral Method for MAX2SAT in the Planted Solution Model
- A framework for certified Boolean branch-and-bound optimization
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Solving satisfiability problems with preferences
- Title not available (Why is that?)
- Core-boosted linear search for incomplete MaxSAT
- A framework for reasoning under uncertainty based on non-deterministic distance semantics
- Simplified forms of computerized reasoning with distance semantics
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
- Resolution for Max-SAT
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- A Preprocessor for Max-SAT Solvers
- A logical approach to efficient Max-SAT solving
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
- Dynamic polynomial watchdog encoding for solving weighted MaxSAT
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
- MaxSolver
- Iterative and core-guided maxsat solving: a survey and assessment
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Comparing action descriptions based on semantic preferences
- Exact Max-SAT solvers for over-constrained problems
- Title not available (Why is that?)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Scatter search and genetic algorithms for MAX-SAT problems
- On Inconsistent Clause-Subsets for Max-SAT Solving
- Theory and Applications of Satisfiability Testing
- Semidefinite Programming and Constraint Programming
- The \textsc{MergeSat} solver
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
Uses Software
This page was built for publication: MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457672)
