Improving SAT Solving Using Monte Carlo Tree Search-Based Clause Learning

DOI10.1007/978-3-030-20323-8_5MaRDI QIDQ6181725zbMATH OpenOpenAlexFDO

Authors Oliver Keszocze, Jens Schlöter, Rolf Drechsler

Publication date 23 January 2024

Published in Advanced Boolean Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-20323-8_5

zbMATH Keywords

heuristicMonte Carlo tree searchSATSAT preprocessingSAT solversatisfiability

Mathematics Subject Classification ID

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

Recommendations

• Anatomy and empirical evaluation of modern SAT solvers
• scientific article; zbMATH DE number 2243370
• On the effect of learned clauses on stochastic local search
• Concurrent clause strengthening
• Better Decision Heuristics in CDCL through Local Search and Target Phases

Cites work

• A Computing Procedure for Quantification Theory
• Formal Methods for Hardware Verification
• From bandits to Monte-Carlo tree search: the optimistic principle applied to optimization and planning
• Learning rate based branching heuristic for SAT solvers

Cited in

(1)

• Optimal pivot path of the simplex method for linear programming based on reinforcement learning

This page was built for publication: Improving SAT Solving Using Monte Carlo Tree Search-Based Clause Learning

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