An Algorithm for Reducing Acyclic Hypergraphs

摘要

The report gives a description of an algorithm to compute efficiently the Graham reduction of an acyclic hypergraph with sacred nodes. To apply the algorithm we must already have a tree representation of the hypergraphs, and therefore it is useful when we have a fixed hypergraph and wish to compute Graham reductions many times, as we do in the System/U query interpretation algorithm. (Author)