Deterministic parallel DPLL

MaRDI QIDQ2786913zbMATH OpenFDO

Authors Youssef Hamadi, Said Jabbour, Cedric Piette, Lakhdar Sais

Publication date 23 February 2016

Published in Journal of Satisfiability, Boolean Modeling and Computation (Search for Journal in Brave)

zbMATH Keywords

parallelismSAT solving

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)

Recommendations

• ManySAT: a parallel SAT solver
• HordeSat: a massively parallel portfolio SAT solver
• A parallelization scheme based on work stealing for a class of SAT solvers
• scientific article; zbMATH DE number 5510692
• PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications

Cited in

(5)

• What we can learn from conflicts in propositional satisfiability
• A review of literature on parallel constraint solving
• An overview of parallel SAT solving
• Deterministic Lindenmayer Systems with Dynamic Control of Parallelism
• Deterministic parallel backtrack search

This page was built for publication: Deterministic parallel DPLL

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