Leveraging GPUs for effective clause sharing in parallel SAT solving

DOI10.1007/978-3-030-80223-3_32MaRDI QIDQ2118339zbMATH OpenOpenAlexFDO

Authors Nicolas Prevot, Mate Soos, Kuldeep S. Meel

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-80223-3_32

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 5510692 (Why is no real title available?)
• Adaptive Restart Strategies for Conflict Driven SAT Solvers
• Boosting complete techniques thanks to local search methods
• Community and LBD-based clause sharing policy for parallel SAT solving
• Fast unfolding of communities in large networks
• Lazy clause exchange policy for parallel SAT solvers
• Local Restarts
• ManySAT: a parallel SAT solver
• PSATO: A distributed propositional prover and its application to quasigroup problems
• Survey propagation: An algorithm for satisfiability
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing

Cited in

(2)

• Certified SAT solving with GPU accelerated inprocessing
• Simulating a P system based efficient solution to SAT by using GPUs

Describes a project that uses

Uses Software

• CUD@SAT
• Lingeling
• Treengeling
• Plingeling
• Chaff
• SATO
• PSATO
• MiniSat
• ManySAT

This page was built for publication: Leveraging GPUs for effective clause sharing in parallel SAT solving

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