Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability

DOI10.1016/j.artint.2020.103354zbMath1493.68340OpenAlexW3038094279MaRDI QIDQ2211872

Zhendong Lei, Shaowei Cai

Publication date: 16 November 2020

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2020.103354

zbMATH Keywords

local searchmaximum satisfiabilityhybridizationunit propagationclause weightingindustrial instances

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Generalization of the subset sum problem and cubic forms ⋮ SATLike ⋮ Efficient local search for pseudo Boolean optimization

Uses Software

• Sat4j
• QMaxSAT
• Open-WBO
• MaxHS
• RC2
• CCLS
• CCEHC
• WPM3

Cites Work

• New local search methods for partial MaxSAT
• SAT-based MaxSAT algorithms
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• WPM3: an (in)complete algorithm for weighted partial MaxSAT
• Iterative and core-guided maxsat solving: a survey and assessment
• CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
• Open-WBO: A Modular MaxSAT Solver,
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Algorithms for Weighted Boolean Optimization
• On Solving the Partial MAX-SAT Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability