Common Contracts
1 similar null contracts
Grant agreement number: 257414 Funding Scheme: FET Proactive Project Type: Integrated ProjectJune 30th, 2011
The existence of an algebra of nominal hypergraphs allows us to recursively compute the cost function of a nominal hypergraph by performing the computation on any of the corresponding terms. However, nominal graphs still lack a description of the variable elimination strategy. We describe this information as hierarchical nominal hypergraphs, that are trees describing the decomposition of a nominal hypergraph in terms of nested components, each corresponding to a subproblem. Such trees correspond to terms without the scope extension axioms, i.e., where the scope of restrictions is fixed. An example of a term, and the corresponding hierarchical nominal hypergraph, is shown in Figure 6. Here the scope of each restriction determines a component in the tree, where a vertex for the restricted name is added. Notice that the root is the empty graph because all names are restricted.
