A Distributed Algorithm to Evaluate Quantified Boolean Formulae

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 285-290

  Feldmann, Rainer ^a   Monien, Burkhard ^a   Schamberger, Stefan ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA;

DISTRIBUTED GAMES; DISTRIBUTED SYSTEMS; GAME TREE SEARCH; PARALLEL SEARCH; PARALLEL SYSTEM; QUANTIFIED BOOLEAN FORMULAS; SEARCH TECHNIQUE; SEARCH TREES; SEQUENTIAL ALGORITHM; THEOREM PROVERS;

TREES (MATHEMATICS);

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

References (10)

1. Böhm, M.; and Speckenmeyer, E. 1996. A fast parallel SAT-solver - efficient workload balancing. Annals of Mathematics and Artificial Intelligence 17:381-400.
2. Cadoli, M.; Giovanardi, A.; and Schaerf, M. 1998. An Algorithm to Evaluate Quantified Boolean Formulae. Proc. of the 15th National Conference on Artificial Intelligence (AAAI-98) 262-267. AAAI Press.
3. Feldmann, R.; Monien, B.; Mysliwietz, P.; and Vornberger O. 1990. Distributed Game Tree Search. In Parallel Algorithms for Machine Intelligence and Pattern Recognition, Kumar, V., Kanal, L.N., and Gopalakrishnan, P.S. eds., 66-101, Springer-Verlag.
4. Feldmann, R.; Monien, B.; and Mysliwietz, P. 1994. Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. Proc. of the 6th ACM Symp. on Parallel Algorithms and Architectures (SPAA-94) 94-103. ACM.
5. Feldmann, R. 1997. Computer Chess: Algorithms and Heuristics for a Deep Look into the Future. Proc. of the 24th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM-97) LNCS 1338, 511-522, Springer Verlag.
6. Gent, I.P.; and Walsh, T. 1999. Beyond NP: The QSAT Phase Transition. Proc. of the 16th National Conference on Artificial Intelligence (AAAI-99) 648-653. AAAI Press.
7. Gu, J.; Purdom, P.W.; Franco, J.; and Wah, B.W. 1997. Algorithms for the Satisfiability (SAT) Problem: A Survey. In Satisfiability Problem: Theory and Applications, Du, D., Gu, J., and Pardalos, P.M. eds. DIMACS 35, 19-151. American Mathematical Society.
8. Kleine-Büning, H.; Karpinski, M.; and Flögel, A. 1995. Resolution for quantified boolean formulas. Information and Computation, 117:12-18.
9. Rintanen, J. 1999. Improvements to the Evaluation of Quantified Boolean Formulae. Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), 1192-1197. Morgan Kaufman.
10. Speckenmeyer, E; Monien, B; and Vornberger, O. 1987. Superlinear speedup for parallel backtracking. Proc. of the International Conference on Supercomputing (ICS-87) LNCS 385, 985-993, Springer-Verlag.