A Tree Representation for Parallel Problem Solving

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988
PublisherAmerican Association for Artificial Intelligence (AAAI) Press
Pages677-681
Number of pages5
ISBN (Electronic)0262510553, 9780262510554
StatePublished - 1988
Event7th National Conference on Artificial Intelligence, AAAI 1988 - St. Paul, United States
Duration: Aug 21 1988Aug 26 1988

Publication series

NameProceedings of the 7th National Conference on Artificial Intelligence, AAAI 1988

Conference

Conference7th National Conference on Artificial Intelligence, AAAI 1988
Country/TerritoryUnited States
CitySt. Paul
Period8/21/888/26/88

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software

Fingerprint

Dive into the research topics of 'A Tree Representation for Parallel Problem Solving'. Together they form a unique fingerprint.

Cite this