An Admissible and Optimal Algorithm for Searching AND/OR Graphs

@article{Chang1971AnAA,
  title={An Admissible and Optimal Algorithm for Searching AND/OR Graphs},
  author={Chin-Liang Chang and James R. Slagle},
  journal={Artif. Intell.},
  year={1971},
  volume={2},
  pages={117-128}
}
An AND/OR graph is a graph which represents a problem-solving process. A solution graph is a subgraph of the ANDIOR graph which represents a derivation for a solution of the problem. Therefore, solving a problem can be viewed as searching for a ~olution grtph in an AND/OR gra~,h. A "cost" is associated with every solution grapm~. A minimal solutiou graph is… CONTINUE READING