Fast hypothetical reasoning system using inference-path network

Abstract

A fast hypothetical reasoning system is described which is named KICK-SHOTGAN, and which avoids inefficient backtracking by the forward synthesis of necessary hypothesis combination along this network. The formation of inference-path network is based on a linear-time algorithm for the satisfiability testing of propositional Horn clauses. This system differs from ATMS mainly in its total problem solving nature. That is, it works for the logical problem-solving framework which yields a solution for a given goal, whereas the ATMS calculates possible data supported by hypotheses incrementally in response to the input of a justification (rule) from a problem solver existing outside the ATMS.<>