@inproceedings{8034f4ff5bb94fda9918c1943faea188,
title = "A Tree Representation for Parallel Problem Solving",
abstract = "A tree-representation for problem-solving suited for parallel processing is proposed. We give a formal definition of REDUCE-OR trees and illustrate it with a detailed example. Each node of the proposed tree denotes a completely described subproblem. When literals share variables, it permits solutions from one literal to prune the search space for the other literals. Attempts to get such pruning with AND-OR trees lose a significant form of 'OR parallelism'. An alternative strategy for searching AND-OR trees leads to the SLD trees, which miss the 'AND-parallelism'. The REDUCE-OR trees are especially useful for problems with a generate-and-test flavor.",
author = "Kal{\'e}, {L. V.}",
note = "Publisher Copyright: Copyright {\textcopyright} 1988, AAAI (www.aaai.org). All rights reserved.; 7th National Conference on Artificial Intelligence, AAAI 1988 ; Conference date: 21-08-1988 Through 26-08-1988",
year = "1988",
language = "English (US)",
series = "Proceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988",
publisher = "American Association for Artificial Intelligence (AAAI) Press",
pages = "677--681",
booktitle = "Proceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988",
address = "United States",
}