Leveraging GPUs for effective clause sharing in parallel SAT solving
From MaRDI portal
Publication:2118339
DOI10.1007/978-3-030-80223-3_32OpenAlexW3184444919MaRDI QIDQ2118339
Kuldeep S. Meel, Nicolas Prevot, Mate Soos
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_32
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Boosting complete techniques thanks to local search methods
- PSATO: A distributed propositional prover and its application to quasigroup problems
- Community and LBD-based clause sharing policy for parallel SAT solving
- Lazy Clause Exchange Policy for Parallel SAT Solvers
- Adaptive Restart Strategies for Conflict Driven SAT Solvers
- Local Restarts
- Fast unfolding of communities in large networks
- Survey propagation: An algorithm for satisfiability
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
This page was built for publication: Leveraging GPUs for effective clause sharing in parallel SAT solving