Polarity and variable selection heuristics for SAT-based anytime MaxSAT

DOI10.3233/SAT-200126zbMATH Open1483.68356OpenAlexW3087533836MaRDI QIDQ5014283FDOQ5014283

Authors: Alexander Nadel 

Publication date: 1 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/sat-200126

Recommendations

• Open-WBO: a modular MaxSAT solver
• Minimaxsat: an efficient weighted Max-SAT solver
• \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
• An efficient solver for weighted Max-SAT
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing

zbMATH Keywords

heuristicsSATMaxSAT

Mathematics Subject Classification ID

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

Cites Work

• Iterative and core-guided maxsat solving: a survey and assessment
• Combining approaches for solving satisfiability problems with qualitative preferences
• Generating Diverse Solutions in SAT
• WPM3: an (in)complete algorithm for weighted partial MaxSAT
• Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT
• Maximum satisfiability in software analysis: applications and techniques

Cited In (3)

• Local search with a SAT oracle for combinatorial optimization
• \texttt{TT-Open-WBO-Inc}: an efficient anytime MaxSAT solver
• Integrating multi-armed bandit with local search for MaxSAT

Uses Software

• Chaff
• Sat4j
• Glucose
• WPM3
• Open-WBO-Inc

This page was built for publication: Polarity and variable selection heuristics for SAT-based anytime MaxSAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014283)