Abstract: | The new model matcher discussed here counters the combinatorial explosion in searching the whole interpretation tree by using a best first search strategy and exploiting constraints to prune the search tree. Several heuristics have been investigated to guide the search. parameter for constraint evaluation are related to parameter expressing performance of the algorithm. The matching algorithm has been tested on two objects with different degree of difficulty. In addition the relationship between heuristic evaluation and performance has been investigated.
|