Pages that link to "Item:Q2457672"

The following pages link to MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability (Q2457672):

Displaying 36 items.

• MaxSolver (Q14538) (← links)
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
• A framework for reasoning under uncertainty based on non-deterministic distance semantics (Q541819) (← links)
• Simplified forms of computerized reasoning with distance semantics (Q545150) (← links)
• Solving satisfiability problems with preferences (Q606909) (← links)
• A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
• Scatter search and genetic algorithms for MAX-SAT problems (Q928686) (← links)
• An efficient solver for weighted Max-SAT (Q933784) (← links)
• Resolution for Max-SAT (Q1028942) (← links)
• A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems (Q1288467) (← links)
• Dynamic polynomial watchdog encoding for solving weighted MaxSAT (Q1656559) (← links)
• The \textsc{MergeSat} solver (Q2118329) (← links)
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (Q2211872) (← links)
• Core-boosted linear search for incomplete MaxSAT (Q2327238) (← links)
• Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
• A logical approach to efficient Max-SAT solving (Q2389619) (← links)
• A framework for certified Boolean branch-and-bound optimization (Q2429985) (← links)
• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
• A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
• Comparing action descriptions based on semantic preferences (Q2457799) (← links)
• Exact Max-SAT solvers for over-constrained problems (Q2506236) (← links)
• CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
• Efficient solution of MAX-SAT and SAT via higher order Boltzmann machines (Q2726419) (← links)
• (Q2728900) (← links)
• Semidefinite Programming and Constraint Programming (Q2802541) (← links)
• (Q3112651) (← links)
• A Preprocessor for Max-SAT Solvers (Q3502688) (← links)
• On Inconsistent Clause-Subsets for Max-SAT Solving (Q3523061) (← links)
• Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (Q3637179) (← links)
• Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem (Q3651486) (← links)
• ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
• Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
• A Spectral Method for MAX2SAT in the Planted Solution Model (Q5387750) (← links)
• Theory and Applications of Satisfiability Testing (Q5713725) (← links)
• Principles and Practice of Constraint Programming – CP 2004 (Q5900327) (← links)