Chapter 5. Parallel Resolution of the Satisfiability Problem: A Survey

  1. El-Ghazali Talbi
  1. Daniel Singer

Published Online: 10 APR 2006

DOI: 10.1002/9780470053928.ch5

Parallel Combinatorial Optimization

Parallel Combinatorial Optimization

How to Cite

Singer, D. (2006) Parallel Resolution of the Satisfiability Problem: A Survey, in Parallel Combinatorial Optimization (ed E.-G. Talbi), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470053928.ch5

Editor Information

  1. LIFL—University of Lille—INRIA—CNRS, Bat.M3 Cité Scientifique, 59655 Villeneuve d'Ascq, France

Author Information

  1. LITA—EA 3097, Université de Metz—Faculté des Sciences, Ile de Saulcy 57045 Metz Cedex, France

Publication History

  1. Published Online: 10 APR 2006
  2. Published Print: 13 OCT 2006

Book Series:

  1. Wiley Series on Parallel and Distributed Computing

Book Series Editors:

  1. Albert Y. Zomaya

ISBN Information

Print ISBN: 9780471721017

Online ISBN: 9780470053928

SEARCH

Keywords:

  • Satisfiability problem (SAT);
  • parallel resolution of SAT;
  • longmult family and BMC (Bounded Model Checking) domain

Summary

This chapter contains sections titled:

  • Introduction

  • Preliminaries

  • Efficiency of Sequential DPLL SAT Solvers

  • Parallel Resolution of SAT

  • Our Experimentation

  • Conclusion

  • References