ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver

DOI10.3233/SAT190104zbMath1484.68214OpenAlexW2403091164MaRDI QIDQ5015596

André Abramé, Djamal Habet

Publication date: 9 December 2021

Published in: Journal on Satisfiability, Boolean Modeling and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/sat190104

zbMATH Keywords

branch and boundMax-SATmax-resolution

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items

New local search methods for partial MaxSAT, An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem, MaxSAT resolution for regular propositional logic, Boosting branch-and-bound MaxSAT solvers with clause learning, On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes, Understanding the power of Max-SAT resolution through up-resilience, Voting on multi-issue domains with conditionally lexicographic preferences, Proofs and Certificates for Max-SAT, A proof builder for Max-SAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• MaxSAT by improved instance-specific algorithm configuration
• Resolution-based lower bounds in MaxSAT
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• SCIP: solving constraint integer programs
• Algorithms for the maximum satisfiability problem
• Learning action models from plan examples using weighted MAX-SAT
• Resolution for Max-SAT
• Solving propositional satisfiability problems
• Branching rules for satisfiability
• A logical approach to efficient Max-SAT solving
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
• Generalized Conflict-Clause Strengthening for Satisfiability Solvers
• Cores in Core Based MaxSat Algorithms: An Analysis
• Open-WBO: A Modular MaxSAT Solver,
• A Generalized Framework for Conflict Analysis
• Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
• Local Consistency in Weighted CSPs and Inference in Max-SAT
• Exploiting Cycle Structures in Max-SAT
• New Upper Bounds for Maximum Satisfiability
• GRASP: a search algorithm for propositional satisfiability
• Optimal Protein Structure Alignment Using Maximum Cliques
• Theory and Applications of Satisfiability Testing
• Exploiting the Power of mip Solvers in maxsat
• Community-Based Partitioning for MaxSAT Solving
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• On Solving the Partial MAX-SAT Problem
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems