Fuzzy general AND/OR graphs of a new type are defined on triangle norm and its extension.The backward heuristic search algorithm BFAO" for fuzzy general AND/OR graphs is presented
in terms of newly-defined heuristic function h(n
x) and the principle that all subtrees of the optimum solution tree for fuzzy general AND/OR graph are also optimum subtrees.The admissibliry of algorithm BFAO is proved.In this paper
two new monotone restrictions for heuristic function h(n
x) are also defined.Based on these
the characteristic of monotone restrictions for algorithm BFAO is investigated
and the comparison between two BFAO algorithm is discussed.