GENERAL BOTTOM-UP PROCEDURE FOR SEARCHING AND/OR GRAPHS.

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

3 Scopus citations

Abstract

This paper summarizes work on a general bottom-up procedure for searching AND/OR graphs which includes a number of procedure for seaching 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 procedures.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherAmerican Assoc for Artificial Intelligence, USA. Distributed by William Kaufmann Inc
Pages182-187
Number of pages6
StatePublished - Dec 1 1983

Fingerprint Dive into the research topics of 'GENERAL BOTTOM-UP PROCEDURE FOR SEARCHING AND/OR GRAPHS.'. Together they form a unique fingerprint.

Cite this