Chakrabarti, P. P. (1994) Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search Artificial Intelligence, 65 (2). pp. 329-345. ISSN 0004-3702
Full text not available from this repository.
Official URL: http://linkinghub.elsevier.com/retrieve/pii/000437...
Related URL: http://dx.doi.org/10.1016/0004-3702(94)90020-5
Abstract
We present algorithms for finding out optimal cost solutions of an explicit AND/OR graph. We show that these new algorithms can work on AND/OR graphs containing cycles. Finally, we show how these algorithms can be incorporated in implicit graph search schemes like AO* so that they work for transformation rules which lead to graphs with cycles.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| ID Code: | 5913 |
| Deposited On: | 19 Oct 2010 10:13 |
| Last Modified: | 20 May 2011 09:46 |
Repository Staff Only: item control page
