仮説推論に対する3種の近似解法

抄録

Cost-based abduction, which is a technique for identifying the best explanation for a given observation based on the assumption of a set of hypothesis, is a useful knowledge processing framework for practical problems such as diagnosis, design and planning. However, the speed of reasoning of this approach is often slow. To overcome this problem, Kato et al. previously presented a more efficient cost-based abduction system, that utilized the A^* search technique, however, the time and space complexities in this technique are exponential, so the identification of the optimal solution is difficult in practical applications. In this paper, we present three new systems in which the user can define the computational complexity (polynomial order), for identification of a near-optimal solution. First, we introduce two search control techniques; a real-time A^* search approach in which the user can define the look-ahead depth or space, and the multi-agent real-time A^* approach in which the user can define the number of real-time A^* agents used in the search. We describe the implementation of three cost-based abduction reasoning systems for predicate logic knowledge bases and test the proposed systems using a diagnostic logic circuit problem. The results show that proposed systems can identify a near-optimal solution according to the predefined polynomial order of complexity, including the selection of either linear or exponential computational complexity. It is also shown that inference time and success rate are dependent on the user-defined parameters, that the three proposed systems exhibit similar performance characteristics, and that they all offer significant speed advantages over the previously described technique.