Parallel algorithms for satisfiability (SAT) testing

MaRDI QIDQ4251078zbMATH OpenFDO

Authors J. Gu

Publication date 17 June 1999

zbMATH Keywords

SAT problemsatisfiability

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 828719
• scientific article; zbMATH DE number 1113992
• Formula dissection: A parallel algorithm for constraint satisfaction
• scientific article; zbMATH DE number 5510692
• scientific article; zbMATH DE number 1929156

Cited in

(15)

• Some interesting research directions in satisfiability
• Parallelizing SMT solving: lazy decomposition and conciliation
• The Multi-SAT algorithm
• PaSAT -- parallel SAT-checking with lemma exchange: Implementation and applications
• Satisfiability-based set membership filters
• scientific article; zbMATH DE number 5510692 (Why is no real title available?)
• scientific article; zbMATH DE number 1113992 (Why is no real title available?)
• Partitioning methods for satisfiability testing on large formulas
• scientific article; zbMATH DE number 1929156 (Why is no real title available?)
• scientific article; zbMATH DE number 776082 (Why is no real title available?)
• scientific article; zbMATH DE number 828719 (Why is no real title available?)
• An overview of parallel SAT solving
• Parallel genetic algorithm for SAT problems based on OpenMP
• Formula dissection: A parallel algorithm for constraint satisfaction
• Thread-parallel integrated test pattern generator utilizing satisfiability analysis

This page was built for publication: Parallel algorithms for satisfiability (SAT) testing

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