Unifying Tree-decomposition Schemes for Automated Reasoning Keywords : Automated Reasoning

@inproceedings{UnifyingTS,
  title={Unifying Tree-decomposition Schemes for Automated Reasoning Keywords : Automated Reasoning},
  author={}
}
    The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas, such a s join-tree clustering for constraint-satisfaction and the clique-tree algorithm for probabilis-tic reasoning. Subsequently, the paper extends the variable-elimination scheme called bucket-elimination (BE) into a two-phase message passing along a bucket-tree (BTE), making it another instance of tree-decomposition. Our analysis shows that the new algorithm BTE may p r… CONTINUE READING

    References

    Publications referenced by this paper.
    Showing 1-10 of 13 references

    A comparison of structural csp decomposition methods

    • Georg Gottlob, Scarello
    • Ijcai
    • 1999
    Highly Influential
    6 Excerpts

    Generalizing variableelimination in bayesian networks

    • F G Cozman, Cozman
    • Workshop on Probabilistic reasoning in Bayesian…
    • 2000

    Local computation with probabilities on graphical structures and their application to expert systems

    • Lauritzen, S L Spiegelhalter, D J Lauritzen, Spiegelhalter
    • Journal of the Royal Statistical Society , Series…
    • 1988
    1 Excerpt

    Similar Papers

    Loading similar papers…