{"type":"ScholarlyArticle","title":"The Complexity of Searching Several Classes of AND/OR Graphs","authors":[{"name":"Howard E. Motteler","slug":"howard-e-motteler","given":"Howard E.","family":"Motteler","affiliation":""},{"name":"Laveen N. Kanal","slug":"laveen-n-kanal","given":"Laveen N.","family":"Kanal","affiliation":""}],"abstract":"The complexity of searching for a minimum cost solution graph of an AND/OR graph is analyzed for the dass of AND/OR graphs representable by a context free grammar with cost functions; finding a minimum cost solution graph is then equivalent to finding a lowest cost derivation. Several classes of search problems are defined, based on properties of the cost functions and grammar. We show that certain of these classes have different search complexities-specifically, we show that there are distinct classes for which the complexity of finding a minimum cost solution graph is non-recursive, exponential, NPcomplete, and O(n 2 ), where n is the size of the grammar representing the problem. The correspondence between problern structure and search complexity may serve as a guide for modeling real problems with AND/OR graphs.","doi":null,"url":"https://ijcai.org/proceedings/1985/221","pdf":"https://ijcai.org/proceedings/1985/0221.pdf","markdown":"https://ijcai.org/proceedings/1985/221.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/221","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning and Search","track":"Planning and Search","number":221,"pages":{"first":1083,"last":1084},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}