Computer Science ›› 2010, Vol. 37 ›› Issue (7): 169-173.
Previous Articles Next Articles
WANG Xue-song,ZHAO Ling-zhong,GU Tian-long
Online:
Published:
Abstract: Searching AND/OR graph is an important problem-solving technique in the area of artificial intelligence. The representation of AND/OR graph based on traditional data structures greatly limits the scale of the graph that could be handled with existing AND/OR graph searching algorithm. Based on the symbolic representation of acyclic AND/OR graph using 0BDD(ordered binary decision diagram),we proposed a novel symbolic algorithm for searching minimal-cost solution graph of acyclic AND/OR graph. It is shown that the symbolic algorithm has lower space complexity and can be used to handle larger-scale acyclic AND/OR graphs.
Key words: AND/OR graph, Minimal-cost solution graph, OBDDs
WANG Xue-song,ZHAO Ling-zhong,GU Tian-long. OBDD Based Symbolic Algorithm for Searching Acyclic AND/OR Graphs[J].Computer Science, 2010, 37(7): 169-173.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2010/V37/I7/169
Cited