Leveraging GPUs for effective clause sharing in parallel SAT solving

DOI10.1007/978-3-030-80223-3_32OpenAlexW3184444919MaRDI QIDQ2118339FDOQ2118339

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

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

Cited In (2)

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

Uses Software

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

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)