Showing cs.AIShow all
2 papers · 1 filter
cs.AI2026
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
Piyush Jha, Zhengyu Li, Zhengyang Lu +3
This paper introduces AlphaMapleSAT, a Cube-and-Conquer (CnC) parallel SAT solver that integrates Monte Carlo Tree Search (MCTS) with deductive feedback to efficiently solve challe…
cs.AI2024
Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis
Zhengyang Lu, Stefan Siemer, Piyush Jha +3
Modern SMT solvers, such as Z3, offer user-controllable strategies, enabling users to tailor solving strategies for their unique set of instances, thus dramatically enhancing solve…