Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT

DOI10.3233/SAT190118zbMath1484.68219MaRDI QIDQ5015607

Ruben Martins, Saurabh Joshi, Sukrut Rao, Prateek Kumar

Publication date: 9 December 2021

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

zbMATH Keywords

approximationMaxSATweightedincomplete

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Open-WBO-Inc, Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT

Uses Software

• Sat4j
• StarExec
• QMaxSAT
• LMHS
• PySAT
• RC2
• CCLS
• CCEHC
• WPM3

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time transformation of linear inequalities into conjunctive normal form
• Boolean lexicographic optimization: algorithms \& applications
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• Dynamic polynomial watchdog encoding for solving weighted MaxSAT
• Solving MaxSAT with bit-vector optimization
• PySAT: a Python toolkit for prototyping with SAT oracles
• WPM3: an (in)complete algorithm for weighted partial MaxSAT
• Hierarchical clustering schemes
• LMHS: A SAT-IP Hybrid MaxSAT Solver
• CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
• Open-WBO: A Modular MaxSAT Solver,