\textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
From MaRDI portal
Publication:5015607
DOI10.3233/SAT190118zbMATH Open1484.68219MaRDI QIDQ5015607FDOQ5015607
Authors: Saurabh Joshi, Prateek Kumar, Sukrut Rao, Ruben Martins
Publication date: 9 December 2021
Published in: Journal on Satisfiability, Boolean Modeling and Computation (Search for Journal in Brave)
Recommendations
Cites Work
- PySAT: a Python toolkit for prototyping with SAT oracles
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Hierarchical clustering schemes
- QMaxSAT: A partial Max-SAT solver
- Title not available (Why is that?)
- A linear-time transformation of linear inequalities into conjunctive normal form
- Open-WBO: a modular MaxSAT solver
- Boolean lexicographic optimization: algorithms \& applications
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Dynamic polynomial watchdog encoding for solving weighted MaxSAT
- Solving MaxSAT with bit-vector optimization
- LMHS: a SAT-IP hybrid MaxSat solver
Cited In (3)
Uses Software
This page was built for publication: \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015607)