JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check
Authors:
- 28 May 2008
- book chapter
- Published by Springer Nature
- p. 249-258
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Parallel Resolution of the Satisfiability Problem (SAT) with OpenMP and MPILecture Notes in Computer Science, 2006
- An Optimal Skew-insensitive Join and Multi-join Algorithm for Distributed ArchitecturesLecture Notes in Computer Science, 2005
- Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative studyInternational Journal of Computational Science and Engineering, 2005
- kcnfs: An Efficient Solver for Random k-SAT FormulaeLecture Notes in Computer Science, 2004
- Exploiting hypergraph partitioning for efficient Boolean satisfiability2004
- Simplifying Binary Propositional Theories into Connected Components Twice as FastLecture Notes in Computer Science, 2001
- Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report)Electronic Notes in Discrete Mathematics, 2001
- Partitioning Methods for Satisfiability Testing on Large FormulasInformation and Computation, 2000
- Join processing in relational databasesACM Computing Surveys, 1992
- A machine program for theorem-provingCommunications of the ACM, 1962