Skip to main content
SpringerLink
Log in

Parallel Algorithms for Satisfiability (SAT) Testing

  • Chapter
Parallel Processing of Discrete Problems

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 106))

  • 215 Accesses

Abstract

The satisfiability (SAT) problem is a central problem in mathematical logic, computing theory, and artificial intelligence. In practice, the SAT problem is fundamental in solving many practical application problems. Methods to solve the SAT problem play an important role in the development of computing theory and intelligent computing systems. There has been great interest in the design of efficient algorithms to solve the SAT problem. Since the past decade, a variety of parallel processing techniques have been developed to solve the SAT problem. The goal of this paper is to expose the rapidly growing field, to discuss tradeoff and limitations, and to describe state-of-the-art techniques, both algorithms and special-purpose architectures, for parallel processing of the satisfiability problem.

Article Footnote

This research was supported in part by 1987–1988 and 1988–1989 ACM/IEEE Academic Scholarship Awards, and is presently supported in part by NSERC Research Grant OGP0046423, NSERC Strategic Grants MEF0045793 and STR0167029, 1996 DIMACS Workshop on the satisfiability (SAT) problems, and DIMACS visitor program.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Ashar, A. Ghosh, and S. DevadasBoolean satisfiability and equivalence checking using general Binary Decision Diagrams, Integration, the VLSI journal 13 (1992), 1–16.

    Article  Google Scholar 

  2. W. Ahrens, Mathematische unterhaltungen and spiele (ingerman), B.G. Teubner (Publishing Company), Leipzig, 1918–1921.

    Google Scholar 

  3. A.V. Aho, J.E. Hoperoft, and J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, 1974.

    MATH  Google Scholar 

  4. B. Aspvall, M.F. Plass, and R.E. TarjanA linear-time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters 8 (1979), no. 3, 121–132.

    Article  MathSciNet  MATH  Google Scholar 

  5. B. Abramson and M. YungDivide and conquer under global constraints: A solution to the n-queens problem, Journal of Parallel and Distributed Computing 6 (1989), 649–662.

    Article  Google Scholar 

  6. M. Buro and H.K. Buning Report on a SAT competition, Bulletin of the European Association for Theoretical Computer Science 49 (1993), 143–151.

    MATH  Google Scholar 

  7. C. G. Bell, Parallelism advancing computing technologies, Keynote Speech, ACM/IEEE Fall Joint Computer Conference, Nov. 2–6 1986.

    Google Scholar 

  8. C. G. Bell, The future of high performance computers in science and engineering, Comm. ACM 32 (1989), no. 9, 1091–1101.

    Google Scholar 

  9. B. Bernhardsson, Explicit solutions to the n-queens problems for all n, ACM SIGART Bulletin 2 no. 2, page 7, 1991, ACM Press.

    Article  Google Scholar 

  10. C.E. Blair, R.G. Jeroslow, and J.K. Lowe, Some results and experiments in programming techniques for propositional logic, Computers and Operations Research 5 (1986), 633–645.

    Article  MathSciNet  Google Scholar 

  11. C.A. Brown and P.W. Purdom, An average time analysis of backtracking, SIAM J. on Computing 10 (1981), no. 3, 583–593.

    Article  MathSciNet  MATH  Google Scholar 

  12. K. Bugrara and P. Purdom, Clause order backtracking, Tech. Report 311, 1990.

    Google Scholar 

  13. J. R. Bitner and E. M. Reingold, Backtrack programming techniques, Comm. of ACM 18 (1975), no. 11, 651–656.

    Article  MATH  Google Scholar 

  14. R.E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Trans. on Computers C-35 (1986), no. 8, 677–691.

    Google Scholar 

  15. M. Bohm and E. Speckenmeyer, A fast parallel SAT-solver — efficient workload balancing, Presented at the 3rd International Symposium on AI & Mathematics, Jan. 1994.

    Google Scholar 

  16. S. Chakradhar, V. Agrawal, and M. Bushnell Neural net and Boolean satisfiability model of logic circuits, IEEE Design & Test of Computers (1990), 54–57.

    Google Scholar 

  17. W.T. Chen and L.L. Liu, Parallel approach for theorem proving in propositional logic, Inform. Sci. 41 (1987), no. 1, 61–76.

    Article  MathSciNet  MATH  Google Scholar 

  18. M.B. Clowes, On seeing things, Artificial Intelligence 2 (1971), 79–116.

    Article  Google Scholar 

  19. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms, MIT Press, Cambridge, 1990.

    MATH  Google Scholar 

  20. J.S. Conery, Parallel execution of logic programs, Kluwer Academic Publishers, Boston, 1987.

    Book  Google Scholar 

  21. S.A. Cook, The complexity of theorem-proving procedures, Proceedings of the Third ACM Symposium on Theory of Computing, 1971, pp. 151–158.

    Google Scholar 

  22. V. Chvátal and E. Szemerédi, Many hard examples for resolution, J. of ACM 35 (1988), 759–770.

    Article  MATH  Google Scholar 

  23. P. R. Cooper and M. J. Swain, Parallelism and domain dependence in constraint satisfaction, Tech. Report TR 255, Dept. of Computer Science, Univ. of Rochester, Dec. 1988.

    Google Scholar 

  24. O. Dubois, P. Andre, Y. Boufkhad, and J. Caller, SAT versus UNSAT, DIMACS Series Volume 26: Clique, Graph Coloring, and Satisfiability — Second DIMACS Implementation Challenge. Editors: D.S. Johnson and M.A. Trick, American Mathematical Society, 1996.

    Google Scholar 

  25. N. Dershowitz, J. Hsiang, N. Josephson, and D. Plaisted, Associative-commutative rewriting, Proceedings of IJCAI, 1983, pp. 940–944.

    Google Scholar 

  26. M. Davis, G. Logemann, and D. Loveland, A machine program for theorem proving, Communications of the ACM 5 (1962), 394–397.

    Article  MathSciNet  MATH  Google Scholar 

  27. M. Davis and H. PutnamA computing procedure for quantification theory, J. of ACM 7 (1960), 201–215.

    Article  MathSciNet  MATH  Google Scholar 

  28. S. Even, A. Itai, and A. ShamirOn the complexity of timetable and multi-commodity flow problems,SIAM J. on Computing 5 (1976), no. 4, 691–703.

    Article  MathSciNet  MATH  Google Scholar 

  29. M.Y. Fang and W.T. Chen, Vectorization of a generalized procedure for theorem proving in propositional logic on vector computers, IEEE Trans. on Knowledge and Data Engineering 4 (1992), no. 5, 475–486.

    Article  Google Scholar 

  30. M.J. Flynn, Some computer organizations and their effectiveness,IEEE Trans. on Computers C-21 (1972), no. 9, 948–960.

    Article  MathSciNet  Google Scholar 

  31. J. Franco, Elimination of infrequent variables improves average case performance of satisfiability algorithms,SIAM J. on Computing 20 (1991), 1119–1127.

    Article  MathSciNet  MATH  Google Scholar 

  32. Z. Galil, On the complexity of regular resolution and the Davis-Putnam procedure, Theoretical Computer Science (1977), 23–46.

    Google Scholar 

  33. A.V. Gelder, A satisfiability tester for non-clausal propositional calculus, Information and Computation 79 (Oct. 1988), no. 1, 1–21.

    Article  MATH  Google Scholar 

  34. P.C. Gilmore, A proof method for quantification theory, IBM J. Res. Develop. 4 (1960), 28–35.

    Article  MathSciNet  MATH  Google Scholar 

  35. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of np-completeness, W.H. Freeman and Company, San Francisco, 1979.

    MATH  Google Scholar 

  36. M.R. Genesereth and N. J. Nilsson, Logical foundations of artificial intelligence,Morgan Kaufmann Publishers, Los Altos, California, 1987.

    MATH  Google Scholar 

  37. A. Goldberg, P.W. Purdom, and C.A. Brown, Average time analysis of simplified davis-putnam procedures.2, Information Processing Letters 15 (1982), no. 2, 72–75.

    Article  MathSciNet  MATH  Google Scholar 

  38. J. Gu, P.W. Purdom, J. Franco, and B.W. Wah, Algorithms for satisfiability (SAT) problem: A survey, DIMACS Volume Series on Discrete Mathematics and Theoretical Computer Science, Vol. 35: The Satisfiability (SAT) Problem, pp. 19–151, American Mathematical Society, 1997.

    MathSciNet  Google Scholar 

  39. J. Gu, P.W. Purdom, J. Franco, and B.W. Wah, Algorithms for satisfiability (SAT) problem, Cambridge University Press, New York, 1998.

    Google Scholar 

  40. J. Gu, Parallel algorithms and architectures for very fast search, Tech. Report UUCS-TR-88–005, Jul. 1988.

    Google Scholar 

  41. J. Gu, Local search with backtracking: A complete algorithm for SAT problem, 1989.

    Google Scholar 

  42. J. Gu, How to solve Very Large-Scale Satisfiability problems. Technical Report UUCS-TR-88–032, 1990.

    Google Scholar 

  43. J. Gu, An nß-relaxation for global optimization, Tech. Report UCECE-TR-91003, Dept. of ECE, Univ. of Calgary, Apr. 1991.

    Google Scholar 

  44. J. Gu, Efficient local search for very large-scale satisfiability problem, SIGART Bulletin 3 no. 1, pp. 8–12, ACM Press, 1992.

    Article  Google Scholar 

  45. J. Gu, The UniSAT problem models (appendix), IEEE Trans. on Pattern Analysis and Machine Intelligence 14 no. 8, page 865, 1992.

    Article  Google Scholar 

  46. J. Gu, Efficient neural computing for global optimization, Tech. Report UCECE-TR-92–012, Dept. of ECE, Univ. of Calgary, Nov. 1992.

    Google Scholar 

  47. J. Gu, Local search for satisfiability (SAT) problem, IEEE Trans. on Systems, Man, and Cybernetics 23 no. 4, pp. 1108–1129, 1993, and 24 no. 4, page 709, 1994.

    Google Scholar 

  48. J. Gu, Optimization algorithms for the satisfiability (SAT) problem. in advances in optimization and approximation., pp. 72–154, Kluwer Academic Publishers, 1994.

    Google Scholar 

  49. J. Gu, Global optimization for satisfiability (SAT) problem, IEEE Trans. on Knowledge and Data Engineering 6 no. 3, pp. 361–381, 1994, and 7 no. 1, page 192, 1995.

    Google Scholar 

  50. J. Gu, An aß relaxation for global optimization. in minimax and applications, pp. 251–268, Kluwer Academic Publishers, 1995.

    Google Scholar 

  51. J. Gu, Parallel algorithms for satisfiability (SAT) problem, DIMACS Volume Series on Discrete Mathematics and Theoretical Computer Science, Vol. 22, pp. 105–161, American Mathematical Society, 1995.

    Google Scholar 

  52. J. Gu, Constraint-based search,Cambridge University Press, New York, to appear.

    Google Scholar 

  53. J. Gu and W. Wang, A novel discrete relaxation architecture, IEEE Trans. on Pattern Analysis and Machine Intelligence 14 no. 8, pp. 857–865, 1992.

    Article  Google Scholar 

  54. J. Gu, W. Wang, and T. C. Henderson, A parallel architecture for discrete relaxation algorithm, IEEE Trans. on Pattern Analysis and Machine Intelligence 9 (1987), no. 6, 816–831.

    Article  Google Scholar 

  55. J. Gu and Q.P. Gu, Average time complexities of several local search algorithms for the satisfiability problem, Tech. Report UCECE-TR-91–004, 1991. In Lecture Notes in Computer Science, Vol. 834, pp. 146–154, 1994, and to appear in IEEE Trans. on Knowledge and Data Engineering.

    Google Scholar 

  56. J. Gu, X. Huang, and B. Du, A quantitative solution to constraint satisfaction,New Generation Computing 13 no. 1, pp. 99–115, 1994.

    Article  Google Scholar 

  57. G.E. Hinton and J.A. Anderson (eds.), Parallel models of associative memory, Lawrence Erlbaum Publishers, New Jersey, 1981.

    Google Scholar 

  58. J.N. Hooker and C. Fedjki, Branch-and-cut solution of inference problems in propositional logic, Tech. Report 77–88–89, GSIA, Carnegie Mellon University, Aug. 1989.

    Google Scholar 

  59. R. Hecht-NielsenNN91a, Neurocomputing, Addison-Wesley, Reading, 1991.

    Google Scholar 

  60. J. Hopfield, Neurons with graded response have collective computational properties like those of two-state neurons, Proc. of Nat. Acad. Sci. 81 (1984),3088–3092.

    Article  Google Scholar 

  61. J.N. Hooker, Generalized resolution and cutting planes, Annals of Operations Research 12 (1988), 217–239.

    Article  MathSciNet  Google Scholar 

  62. J.N. Hooker, A quantitative approach to logical inference, Decision Support Systems 4 (1988), 45–69.

    Article  Google Scholar 

  63. J.N. HookerResolution vs. cutting plane solution of inference problems: Some computational experience, Operations Research Letter 7 (1988), no. 1, 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  64. J. Hsiang, Refutational theorem proving using term-rewriting systems, Artificial Intelligence (1985), 255–300.

    Google Scholar 

  65. T.H. Hu, C.Y. Tang, and R.C.T. Lee, An average case analysis of a resolution principle algorithm in mechanical theorem proving, Annals of Mathematics and Artificial Intelligence 6 (1992), 235–252.

    Article  MathSciNet  MATH  Google Scholar 

  66. D.A. Huffman, Impossible objects as nonsense sentences. in b. meltzer and d. michie, eds., machine intelligence, pp. 295–323, Edinburgh University Press, Edinburgh, Scotland, 1971.

    Google Scholar 

  67. K. Hwang, Advanced parallel processing with supercomputer architectures, Proceedings of the IEEE 75 (1987), no. 10, 1348–1379.

    Article  Google Scholar 

  68. K. Iwama, CNF satisfiability test by counting and polynomial average time, SIAM J. on Computing (1989), 385–391.

    Google Scholar 

  69. R.G. Jeroslow, Computation-oriented reductions of predicate to propositional logic, Decision Support Systems 4 (1988), 183–197.

    Article  Google Scholar 

  70. R. R. Johnson, Discrete wafer scale integration, pp. 345–352, Elsevier Science Publishers B. V. (North-Holland), 1986.

    Google Scholar 

  71. R. R. Johnson, Unipro silicon circuit board series 2000/3000, MOSAIC Systems Inc., San Jose, California, 1987.

    Google Scholar 

  72. J.L. Johnson, A neural network approach to the 3-satisfiability problem, J. of Parallel and Distributed Computing 6 (1989), 435–449.

    Article  Google Scholar 

  73. R. R. Johnson, Multichip modules: Next-generation packages, IEEE Spectrum 27 (1990), no. 3, 34–48.

    Article  Google Scholar 

  74. R. R. Johnson, Critical issues in computer architecture design, Private Communication, 1987–1994.

    Google Scholar 

  75. R.E. Jeroslow and J. Wang, Solving propositional satisfiability problems, Annals of Mathematics and AI 1 (1990), 167–187.

    MATH  Google Scholar 

  76. N. Karmarkar, A new polynomial-time algorithm for linear programming, Cornbinatorica (1984), no. 4, 373–395.

    Article  MathSciNet  MATH  Google Scholar 

  77. A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan, and M.G.C. Resende, Computational experience with an interior point algorithm on the satisfiability problem, Mathematical Sciences Research Center, AT&T Bell Laboratories (Oct. 1989).

    Google Scholar 

  78. A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan, and M.G.C. Resende, Computational experience with an interior point algorithm on the satisfiability problem, Annals of Operations Research 25 (1990), 43–58.

    Article  MathSciNet  MATH  Google Scholar 

  79. A.N. Kolmogorov, On the representation of continuous functions of many variables by superposition of continuous functions of one variable and addition (in Russian), Dokl. Akad. Nauk. USSR 114 (1957), 953–956.

    MathSciNet  MATH  Google Scholar 

  80. D. C-L. Ku, DRA1 chip implementation report, Project Report, Dept. of Computer Science, Univ. of Utah, Mar. 1986.

    Google Scholar 

  81. T. Larrabee, Test pattern generation using Boolean satisfiability, IEEE Trans. on Computer-Aided Design 11 (1992), no. 1, 4–15.

    Article  Google Scholar 

  82. X.P. Li, T.W. Chen, and J. Gu, A new dynamic neural network for nonlinear system control and identification, Tech. Report UCECE-TR-93–003, Dept. of ECE, Univ. of Calgary, Apr. 1993.

    Google Scholar 

  83. Y.-J. Lin, A parallel implementation of logic programs, Ph.D. thesis, The Univ. of Texas at Austin, Dept. of Computer Science, May 1988.

    Google Scholar 

  84. W. M. Lin and V. K. P. Kumar, Parallel architectures for discrete relaxation algorithm, AAAI Workshop on Parallel Algorithms for AI, Detroit, 20 Aug. 1989.

    Google Scholar 

  85. D.W. Loveland, Automated theorem proving: A logical basis, North-Holland, 1978.

    MATH  Google Scholar 

  86. D.G. Luenberger, Linear and nonlinear programming, Addison-Wesley, Reading, 1984.

    MATH  Google Scholar 

  87. A. K. Mackworth, Consistency in networks of relations, Artificial Intelligence 8 (1977), 99–119.

    Article  MATH  Google Scholar 

  88. C.R. McLean and C.R. Dyer, An analog relaxation processor, Proceedings of the 5th International Conference on Pattern Recognition, 1980, pp. 58–60.

    Google Scholar 

  89. J. Peysalch, A fast algorithm to convert boolean expressions into CNF, IBM Computer Science RC 12913 (#57971) (1987), Watson, New York.

    Google Scholar 

  90. J.L. McClelland and D.E. Rumelhart, Parallel distributed processing: Explorations in the microstructure of cognition. volume 2: Psychological and biological models, The MIT Press, Cambridge, 1986.

    Google Scholar 

  91. J. T. McCall, J. G. Tront, F. G. Gray, R. M. Haralick, and W. M. McCormack, Parallel computer architectures and problem solving strategies for the consistent labeling problem, IEEE Trans. On Computers C-34 (1985), no. 11, 973–980.

    Google Scholar 

  92. N.J. Nilsson, Principles of artificial intelligence, Tioga Publishing Company, Palo Alto, California, 1980.

    MATH  Google Scholar 

  93. C.H. Papadimitriou, On selecting a satisfying truth assignment, Proceedings of the 32nd Annual Symposium of the Foundations of Computer Science, 1991, pp. 163–169.

    Google Scholar 

  94. C.H. Papadimitriou, Private Communications, Mar. 1992.

    Google Scholar 

  95. P.W. Purdom and C.A. Brown, The pure literal rule and polynomial average time, SIAM J. on Computing 14 (1985), 943–953.

    Article  MathSciNet  MATH  Google Scholar 

  96. P.W. Purdom and G.N. Haven, Backtracking and probing, Tech. Report No. 387, Dept. of Computer Science, Indiana University, Aug. 1993.

    Google Scholar 

  97. C.H. Papadimitriou and K. Steiglitz, Combinatorial optimization: Algorithms and complexity, Prentice Hall, Englewood Cliffs, 1982.

    MATH  Google Scholar 

  98. P.W. Purdom, Search rearrangement backtracking and polynomial average time, Artificial Intelligence 21 (1983), 117–133.

    Article  Google Scholar 

  99. M. Reiss and J.G. Taylor, Storing temporal sequences, Neural Networks 4 (1991), 773–787.

    Article  Google Scholar 

  100. A. Rosenfeld, R. A. Hummel, and S. W. Zucker, Scene labeling by relaxation operations, IEEE Trans. on Systems, Man, and Cybernetics SMC-6 (1976), no. 6, 420–433.

    Article  MathSciNet  Google Scholar 

  101. D.E. Rumelhart and J.L. McClelland, Parallel distributed processing: Explorations in the microstructure of cognition. volume 1: Foundations, The MIT Press, Cambridge, 1986.

    Google Scholar 

  102. J.A. Robinson, A machine-oriented logic based on the resolution principle, Journal of the ACM (1965), 23–41.

    Google Scholar 

  103. A. Samal, Parallel split-level relaxation, Ph.D. thesis, Dept. of Computer Science, Univ. of Utah, Aug. 1988.

    Google Scholar 

  104. T.J. Schaefer, The complexity of satisfiability problems, Proceedings of the 10th ACM Symposium on Theory of Computing, 1978, pp. 216–226.

    Google Scholar 

  105. R. Sosie and J. Gu, How to search for million queens, Tech. Report UUCS-TR-88–008, Dept. of Computer Science, Univ. of Utah, Feb. 1988.

    Google Scholar 

  106. R. Sosie and J. Gu, Quick n-queen search on VAX and Bobcat machines, CS 547 AI Class Project, Winter Quarter Feb. 1988.

    Google Scholar 

  107. R. Sosie and J. Gu, Fast search algorithms for the n-queens problem, IEEE Trans. on Systems, Man, and Cybernetics SMC-21 (1991), no. 6, 1572–1576.

    Google Scholar 

  108. R. Sosie and J. Gu, A parallel local search algorithm for satisfiability (SAT)problem, Submitted for publication (1993).

    Google Scholar 

  109. R. Sosie and J. Gu, A parallel local search algorithm for the n-queen problem, Submitted for publication (1993).

    Google Scholar 

  110. R. Sosie and J. GuEfficient local search with conflict minimization, IEEE Trans. on Knowledge and Data Engineering 6 (1994), no. 5, 661–668.

    Article  Google Scholar 

  111. R. Sosie, J. Gu, and R. Johnson, A universal Boolean evaluator, IEEE Trans.on Computers (accepted for publication in 1992).

    Google Scholar 

  112. R. Sosie, J. Gu, and R. Johnson, The Unison algorithm: Fast evaluation of Boolean expressions, ACM Transactions on Design Automation of Electronic Systems 1 (1996), no. 4, pp. 456–477.

    Article  Google Scholar 

  113. A. Samal and T. C. Henderson, Performance of arc consistency algorithms on the Cray, Tech. Report DUCS-TR-87–017, Dept. of Computer Science, Univ. of Utah, July 23 1987.

    Google Scholar 

  114. A. Samal and T.C. Henderson, Parallel consistent labeling algorithms,International Journal of Parallel Programming (1988).

    Google Scholar 

  115. M.J. Shensa, A computational structure for the propositional calculus, Proceedings of IJCAI, 1989, pp. 384–388.

    Google Scholar 

  116. P. Siegel, Representation et utilization de la connaissances en calcul propositionel, Ph.D. thesis, University Aix-Marseille II, 1987.

    Google Scholar 

  117. B. Selman, H. Levesque, and D. Mitchell, A new method for solving hard satisfiability problems, Proceedings of AAAI’92, Jul. 1992, pp. 440–446.

    Google Scholar 

  118. W. E. Snyder, Industrial robots: Computer interfacing and control, Prentice-Hall, Englewood Cliffs, 1985.

    Google Scholar 

  119. R.C.-J. Shi, A. Vannelli, and J. Vlach, An improvement on Karmarkar’s algorithm for integer programming, COAL Bulletin of the Mathematical Programming Society (1992).

    Google Scholar 

  120. C. E. Shannon and W. Weaver, Mathematical theory of communication, The University of Illinois Press, 1949.

    MATH  Google Scholar 

  121. A. Thayse and M. Davio Boolean differential calculus and its application to switching theory, IEEE Trans. on Computers 22 (1973), 409–420.

    Article  MathSciNet  MATH  Google Scholar 

  122. K. Truemper, Polynomial algorithms for problems over d-systems, Presented at the 3rd International Symposium on AI & Mathematics, Jan. 1994.

    Google Scholar 

  123. G.S. Tseitin, On the complexity of derivations in propositional calculus. in structures in constructive mathematics and mathematical logic, part ii, a.o. slisenko, ed., pp. 115–125, 1968.

    Google Scholar 

  124. J. E. Tyler, Parallel computer architectures and problem solving strategies for the consistent labeling problem, Master’s thesis, Dept. of Elec. Engg., Virginia Polytech. Inst. State Univ., Blacksburg, Virginia, Oct. 1983.

    Google Scholar 

  125. A. Urquhart, The complexity of propositional proofs, The Bulletin of Symbolic Logic 1 (1995), no. 4, 425–467.

    Article  MathSciNet  MATH  Google Scholar 

  126. B.D. Vries and J.C. Principe, The gamma model-A new neural model for temporal processing, Neural Networks 5 (1992), 565–576.

    Article  Google Scholar 

  127. B.W. Wah (ed.), New computers for artificial intelligence processing. ieee computer, vol. 20, number 1, IEEE Computer Society Press, 1987.

    Google Scholar 

  128. A. Waibel, K.J. Lang, and G.E. HintonA time-delay neural network architecture for isolated word recognition, Neural Networks 3 (1990), 23–43.

    Article  Google Scholar 

  129. D. Waltz, Generating semantic descriptions from drawings of scenes with shadows, Tech. Report AI271, MIT, Nov. 1972.

    Google Scholar 

  130. W. Wang, J. Gu, and T. C. Henderson, A pipelined architecture for parallel image relaxation operations, IEEE Trans. on Circuits and Systems CAS-34 (1987), no. 11, 1375–1384.

    Article  Google Scholar 

  131. W. Wang, J. Gu, and K.F. Smith, A regular layout for concurrent discrete relaxation computation, Proceedings of 1987 IEEE International CAS Symposium, May 1987, pp. 927–933.

    Google Scholar 

  132. H.P. Williams, Linear and integer programming applied to the propositional calculus, Systems Research and Information Sciences 2 (1987), 81–100.

    Google Scholar 

  133. P.H. Winston, Artificial intelligence, Addison-Wesley, Reading, 1984.

    MATH  Google Scholar 

  134. B. Wah and G.J. Li, Computers for artificial intelligence applications, IEEE Computer Society Press, Washington D. C., 1986.

    Google Scholar 

  135. B.W. Wah, M.B. Lowrie, and G.-J. Li, Computers for symbolic processing, Proceedings of the IEEE 77 (1989), no. 4, 509–540.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical and Computer Engineering, Univ. of Calgary, Calgary, Alberta, T2N 1N4, Canada

    Jun Gu

Authors
  1. Jun Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Applied Optimization Industrial and Systems Engineering Department, University of Florida, Gainesville, FL, 32611, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Gu, J. (1999). Parallel Algorithms for Satisfiability (SAT) Testing. In: Pardalos, P.M. (eds) Parallel Processing of Discrete Problems. The IMA Volumes in Mathematics and its Applications, vol 106. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1492-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1492-2_5

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7165-9

  • Online ISBN: 978-1-4612-1492-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation