Lazy Clause Exchange Policy for Parallel SAT Solvers

DOI10.1007/978-3-319-09284-3_15zbMath1423.68431OpenAlexW37608273MaRDI QIDQ3192066

Laurent Simon, Gilles Audemard

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09284-3_15

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (8)

HordeSat: A Massively Parallel Portfolio SAT Solver ⋮ SAT race 2015 ⋮ On the impact of configuration on abstract argumentation automated reasoning ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ Three-dimensional stable matching with cyclic preferences ⋮ How we designed winning algorithms for abstract argumentation and which insight we attained ⋮ SAT competition 2020 ⋮ Leveraging GPUs for effective clause sharing in parallel SAT solving

Uses Software

• ManySAT
• Chaff
• SArTagnan
• ppfolio
• Treengeling

This page was built for publication: Lazy Clause Exchange Policy for Parallel SAT Solvers