KICK-SHOTGANとKICK-HOPEの実行比較

概要

論文の詳細を見る
A logic-based hypothetical reasoning is an effective system that enables to apply to the problems such as a design and diagnosis, by handling incomplete knowledge as a hypothesis. However, inference speed has been slow, and that has been serious problem. There is a proof that hypothetical reasoning is NP-complete even on propositional logic. Therefore, many high speed hypothetical reasoning methods have been proposed. There are hypothetical reasoning systems that require all solutions, such as KICK-SHOTGAN or KICK-HOPE. KICK-SHOTGAN is a fast hypothetical reasoning system on propositional logic with inference-path network. KICK-HOPE is a fast hypothetical reasoning system on predicate logic and it is anapplication of QSQR method in deductive data base technology. In this paper, we carried out a comparative experiment of running time for these 2 systems, KICK-SHOTGAN and KICK-HOPE. First, we use knowledge-base written in propositional logic, and compare running time of these 2 systems. And next, we use knowledge-base written in first-order predicate logic. From consequence of this experiment, we clarify superiority or inferiority of both systems.
社団法人人工知能学会の論文
1999-07-01