A universal parallel SAT checking kernel

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications

Volumn 4, Issue , 2003, Pages 1720-1725

  Blochinger, Wolfgang ^a   Sinz, Carsten ^a   Küchlin, Wolfgang ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Mobile agents; Multithreading; Parallel SAT checking; Parallel symbolic computation

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMBINATORIAL MATHEMATICS; HEURISTIC PROGRAMMING; INTELLIGENT AGENTS; SEQUENTIAL MACHINES; TIME SHARING PROGRAMS;

MOBILE AGENT PROGRAMMING MODEL; PARALLEL SATISFIABILITY CHECKING KERNEL; PARALLEL SYMBOLIC COMPUTATION; SEQUENTIAL SATISFIABILITY CHECKING ALGORITHM;

PARALLEL PROCESSING SYSTEMS;

EID: 1642403841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. The ADAPTIVE Communication Environment (ACE). http://www.cs.wustl.edu/~schmidt/ACE.html.
2. W. Blochinger. Distributed high performance computing in heterogeneous environments with DOTS. In Proc. of Intl. Parallel and Distributed Processing Symp. (IPDPS 2001), page 90, San Francisco, CA, U.S.A., April 2001. IEEE Computer Society Press.
3. W. Blochinger, W. Küchlin, C. Ludwig, and A. Weber. An object-oriented platform for distributed high-performance Symbolic Computation. Mathematics and Computers in Simulation, 49:161-178, 1999.
4. W. Blochinger, C. Sinz, and W. Küchlin. Distributed parallel SAT checking with dynamic learning using DOTS. In T. Gonzales, editor, Proc. of the IASTED Intl. Conference Parallel and Distributed Computing and Systems (PDCS 2001), pages 396-401, Anaheim, CA, August 2001, ACTA Press.
5. W. Blochinger, C. Sinz, and W. Küchlin. Parallel consistency checking of automotive product data. In. G.R. Joubert, A. Murli, F. J. Peters, and M. Vanneschi, editors, Proc. of the Intl. Conf. ParCo 2001: Parallel Computing-Advances and Current Issues, pages 50-57, Naples, Italy, 2002. Imperial College Press.
6. W. Blochinger, C. Sinz, and W. Küchlin. Parallel propositional satisfiability checking with distributed dynamic learning. Parallel Computing, 2003. To appear.
7. M. Boehm and E. Speckenmeyer. A fast parallel SAT-solver - efficient workload balancing. Annals of Mathematics and Artificial Intelligence, 17(3-4):381-400, 1996.
8. S. A. Cook. The complexity of theorem proving procedures. In 3rd Symp. on Theory of Computing, pages 151-158. ACM press, 1971.
9. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5(7):394-397, July 1962.
10. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, 1960.
11. J. N. Hooker and V. Vinay. Branching rules for satisfiability. Journal of Automated Reasoning, 15(3):359-383, 1995.
12. J. P. M. Silva and K. A. Sakallah. Conflict analysis in search algorithms for propositional satisfiability. In Proc. of the IEEE International Conference on Tools with Artificial Intelligence, Nov 1996.
13. C. Sinz, W. Blochinger, and W. Küchlin. PaSAT - parallel SAT-checking with lemma exchange: Implementation and applications. In H. Kautz and B. Selman, editors, LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001), volume 9 of Electronic Notes in Discrete Mathematics, Boston, MA, June 2001. Elsevier Science Publishers.
14. H. Zhang, M. P. Bonacina, and J. Hsiang, PSATO: A distributed propositional prover and its application to quasi-group problems. Journal of Symbolic Computation, 21:543-560 1996.