PSATO a Distributed Propositional Prover and its Application to Quasigroup Problems.
We present a distributed/parallel prover for propositional satisfiability (SAT), called PSATO, for networks of workstations. PSATO is based on the sequential SAT prover SATO, which is an efficient implementation of the Davis ?Putnam algorithm. The master?slave model is used for communication. A simp...
| Publicat a: | Journal of symbolic computation. 21, 4-6 (1996). |
|---|---|
| Autor principal: | |
| Format: | Article |
| Idioma: | English |