Abstract: "A forward-chaining hypothetical reasoner with the assumption-based truth maintenance system (ATMS) has some advantages such as avoiding repeated proofs. However, it may prove subgoals unrelated to proofs of the given goal. To simulate top-down reasoning on bottom-up reasoners, we can...

Full description

Bibliographic Details

Main Authors:	Ohta, Yoshihiko (Author), Inoue, Katsumi (Author)
Format:	Book
Language:	English
Published:	Tokyo, Japan 1991
Series:	Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 700
Subjects:	Expert systems (Computer science) Reasoning
Summary:	Abstract: "A forward-chaining hypothetical reasoner with the assumption-based truth maintenance system (ATMS) has some advantages such as avoiding repeated proofs. However, it may prove subgoals unrelated to proofs of the given goal. To simulate top-down reasoning on bottom-up reasoners, we can apply the upside-down meta-interpretation method to hypothetical reasoning. Unfortunately, when programs include negative clauses, it does not achieve speedups because checking consistency of solutions by negative clauses should be globally evaluated. We present a new transformation algorithm of programs for efficient forward-chaining hypothetical reasoning based on the upside-down meta-interpretation This transformation algorithm analyzes dependencies among predicate symbols in programs by using an ATMS. By this pre-dependency- analysis, we are able to restrict consistency checking to those negative clauses relevant to the given goal. The transformation algorithm has been evaluated with a logic circuit design problem.
Physical Description:	15 S.