Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT

DOI10.3233/SAT-200126zbMath1483.68356OpenAlexW3087533836MaRDI QIDQ5014283

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

zbMATH Keywords

heuristicsSATMaxSAT

Mathematics Subject Classification ID

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

Related Items (1)

Local search with a SAT oracle for combinatorial optimization

Uses Software

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

Cites Work

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

This page was built for publication: Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT