Parallel clause sharing strategy based on graph structure of SAT problem

DOI10.4230/LIPICS.SAT.2024.17MaRDI QIDQ6864425zbMATH OpenFDO

Authors Yoichiro Iida, Tomohiro Sonobe, Mary Inaba

Publication date 3 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAT.2024.17

zbMATH Keywords

clause learningparallel applicationSAT solverstructure of SAT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• \textsf{SATGraf}: visualizing the evolution of SAT formula structure in solvers
• A machine program for theorem-proving
• An empirical study of branching heuristics through the lens of global learning rate
• Centrality-based improvements to CDCL heuristics
• Community and LBD-based clause sharing policy for parallel SAT solving
• Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT
• GRASP: a search algorithm for propositional satisfiability
• HordeSat: a massively parallel portfolio SAT solver
• scientific article; zbMATH DE number 956863 (Why is no real title available?)
• Impact of Community Structure on SAT Solver Performance
• Lazy clause exchange policy for parallel SAT solvers
• Leveraging GPUs for effective clause sharing in parallel SAT solving
• ManySAT: a parallel SAT solver
• On freezing and reactivating learnt clauses
• Scalable SAT solving in the cloud
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• The community structure of SAT formulas
• Treewidth in Verification: Local vs. Global

This page was built for publication: Parallel clause sharing strategy based on graph structure of SAT problem

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