MaxSolver

swMATH1990MaRDI QIDQ14538FDOQ14538

Author name not available (Why is that?)

Described by source

• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability

Cited In (18)

• A framework for certified Boolean branch-and-bound optimization
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• Solving satisfiability problems with preferences
• 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
• A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
• Title not available (Why is that?)
• A logical approach to efficient Max-SAT solving
• Title not available (Why is that?)
• Iterative and core-guided maxsat solving: a survey and assessment
• Comparing action descriptions based on semantic preferences
• Exact Max-SAT solvers for over-constrained problems
• On SAT Modulo Theories and Optimization Problems
• Scatter search and genetic algorithms for MAX-SAT problems
• Semidefinite Programming and Constraint Programming
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks

This page was built for software: MaxSolver