A Bucket-Tree Based Algorithm for Automated Reasoning

Abstract

Both bucket elimination algorithm and junction tree reasoning algorithm are popular automated reasoning algorithms. In this paper, a new junction tree reasoning (JTR) algorithm is proposed to improve efficiency of message propagation through the junction tree. In addition, based on JTR algorithm and bucket elimination algorithm, a bucket-junction-tree reasoning (BJTR) algorithm is proposed to improve inefficiency of multi-task automated reasoning of classical bucket elimination(BE) algorithm. Compared with the homogenous bucket-tree elimination (BTE) algorithm, the proposed algorithm BJTR can effectively improve time performance while space performance decreases a little. Furthermore, compared with classical bucket elimination algorithm, BJTR effectively improves time performance with a slightly lower space performance for multi-task automated reasoning. Finally, both examples and experiments demonstrate that BJTR algorithm can effectively improve time performance for multi-task reasoning.