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

DOI10.1007/978-3-030-20323-8_5zbMath1528.68361OpenAlexW2962022044MaRDI QIDQ6181725

Rolf Drechsler, Oliver Keszocze, Unnamed Author, Jens Schlöter

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

heuristicsatisfiabilitySATMonte Carlo tree searchSAT solverSAT preprocessing

Mathematics Subject Classification ID

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

Cites Work

• Learning Rate Based Branching Heuristic for SAT Solvers
• From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning
• A Computing Procedure for Quantification Theory
• Formal Methods for Hardware Verification

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