Integrating multi-armed bandit with local search for MaxSAT

DOI10.1016/J.ARTINT.2024.104242MaRDI QIDQ6665727zbMATH OpenFDO

Authors Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manya

Publication date 17 January 2025

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2024.104242

zbMATH Keywords

hybrid decimationlocal searchmaximum satisfiabilitymulti-armed bandit

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• New local search methods for partial MaxSAT
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• scientific article; zbMATH DE number 1954176
• WPM3: an (in)complete algorithm for weighted partial MaxSAT

Cites work

• Bandit algorithms
• Better Decision Heuristics in CDCL through Local Search and Target Phases
• Boosting branch-and-bound MaxSAT solvers with clause learning
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• Core-boosted linear search for incomplete MaxSAT
• Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
• scientific article; zbMATH DE number 1256700 (Why is no real title available?)
• scientific article; zbMATH DE number 956863 (Why is no real title available?)
• Introduction to multi-armed bandits
• maxSAT-based large neighborhood search for high school timetabling
• New inference rules for Max-SAT
• New local search methods for partial MaxSAT
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
• On Solving the Partial MAX-SAT Problem
• Polarity and variable selection heuristics for SAT-based anytime MaxSAT
• Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
• Randomized allocation with nonparametric estimation for contextual multi-armed bandits with delayed rewards
• Resolution-based lower bounds in MaxSAT
• SMAC3: a versatile Bayesian optimization package for hyperparameter optimization
• Understanding the power of Max-SAT resolution through up-resilience
• WPM3: an (in)complete algorithm for weighted partial MaxSAT

Cited in

(3)

• Improving local search for weighted partial MaxSAT by initializing with historical information
• Improving local search algorithm for pseudo Boolean optimization
• Local-MIP: efficient local search for mixed integer programming

This page was built for publication: Integrating multi-armed bandit with local search for MaxSAT

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