A learning mechanism for logic programs using dynamically shared substructures

摘要

A reasoning method that proves a predicate logic formula by reducing its graph representation is proposed. Since the method directly reduces a logic formula represented by a graph. it can be understood to self-optimize a graph representation, meaning that it automatically transforms a logic formula into an efficient form equivalent to that acquired by explanation-based learning. By sharing the original subgraph between the learned formulae, reasoning efficiency does not deteriorate even after learning several examples. Therefore, the utility problem is overcome in the sense that no extra search is necessary for macros. The present paper demonstrates these facts in simple list manipulation problems and by proving geometric theories.