ML Anthology

A General Bottom-up Procedure for Searching And/Or Graphs

Vipin Kumar
AAAI 1984 pp. 182-187
/aaai/1984/kumar1984aaai-general/

Abstract

This paper summarizes work on a general bottom-up procedure for searching AND/OR graphs which includes a number of procedures for searching AND/OR graphs, state-space graphs, and dynamic programming procedures as its special cases. The paper concludes with comments on the significance of this work in the context of the author’s unified approach to search pro-cedures. 1.

PDF AAAI Semantic Scholar

Cite

Text

Kumar. "A General Bottom-up Procedure for Searching And/Or Graphs." AAAI Conference on Artificial Intelligence, 1984.

Markdown

[Kumar. "A General Bottom-up Procedure for Searching And/Or Graphs." AAAI Conference on Artificial Intelligence, 1984.](https://mlanthology.org/aaai/1984/kumar1984aaai-general/)

BibTeX

@inproceedings{kumar1984aaai-general,
  title     = {{A General Bottom-up Procedure for Searching And/Or Graphs}},
  author    = {Kumar, Vipin},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1984},
  pages     = {182-187},
  url       = {https://mlanthology.org/aaai/1984/kumar1984aaai-general/}
}