R. Dechter
ABSTRACT
We present an efficient algorithm for decomposing an n-ary relation into a tree of binary relations, and provide an efficient test for checking whether or not the tree formed represents the relation. If there exists a tree-decomposition, the algorithm is guaranteed to find one, otherwise, the tree generated will fail the test, then indicating that no tree decomposition exist. The unique features of the algorithm presented in this paper, is that it does not apriori assume any dependencies in the initial relation, rather it derives such dependencies from the bare relation instance.
- 1.Chow, C K and C N Llu, "Approx,matmg d~screte prob,abd~ty dtstnbutxons v,~th dependence trees," IEEE Transacnon on Informatton Ttzeor~, 1968, pp 462-467Google Scholar
Digital Library
- 2.Dechter, R and J Pearl, "The anatomy of easy problems a constraint-satisfaction formulauon," m Proceedtngs Ntnth International Conference on Arnfictal Intelhgence, Los Angeles, Cal 1985, pp 1066- 1072Google Scholar
- 3.Doyle, Jon, "A truth maintenance system," Arttficzal Intelhgence, Vol 12, 1979, pp 231-272Google ScholarCross Ref
- 4.Freuder, E C, "A sufficlent condmon of backtrack-free search," Journal of ttze ACM, Vol 29, No 1, 1982, pp 24-32 Google ScholarDigital Library
- 5.Mackworth, A K, "Cons,stency ~n networks of relations," Arttffictal tntelhgence, Vol 8, No 1, 1977, pp 99-118Google ScholarDigital Library
- 6.Maxer, David, The theory of relational databases, Rocky,lie, Maryland Computer science press, 1983 Google ScholarDigital Library
- 7.Pearl, J and A Paz, "On the log~c of representing dependencies by graphs," m Proceedmgs AI-86, Canadtan Conference,, Montreal Canada 1986Google Scholar
Index Terms
- Decomposing an N-ary relation into a tree of binary relations
Recommendations
Fuzzy n-ary subpolygroups
Recently, n-ary hypergroups were introduced and analyzed by Davvaz and Vougiouklis. n-ary polygroups are suitable generalizations of polygroups and a special case of n-ary hypergroups. The aim of this paper is to introduce the notion of a fuzzy n-ary ...
Hypergroups and n-ary relations
In this paper we associate a hypergroupoid with an n-ary relation @r defined on a nonempty set H. We investigate when it is an H"v-group, a hypergroup or a join space. Then we determine some connections between this hypergroupoid and Rosenberg's ...
Comments