scientific article; zbMATH DE number 4051039
[For the entire collection see Zbl 0638.00038.] The performance of problem solvers and theorem provers can be improved by means of mechanisms that enable the application of old solutions to new problems. One such (learning) mechanism consists of generalizing an old solution to obtain a specification of the most general problem that it solves. The generalized solution can then be applied in the solution of new problems wherever intances of the general problem it solves can be identified. We present a method based on higher order unification and resolution for the generalization of solutions and the flexible application of such generalizations in the solution of new problems. Our use of higher order unification renders the generalizations useful in the solution of both sub- and superproblems of the original problem. The flexibility thus gained is controlled by means of filter expressions that restrict the unifiers considered. In this way we show how the bulk of the problem solving, generalization and application tasks of a (learning) problem solving system can be performed by the one algorithm. This work generalizes ad hoc techniques developed in the field of explanation based learning and presents the results in a formal setting.
- Proving theorems by reuse
- Tractable and intractable second-order matching problems
- scientific article; zbMATH DE number 4166897 (Why is no real title available?)
- Higher-order unification with dependent function types
- A new application for explanation-based generalisation within automated deduction
- Decidable higher-order unification problems
- Programming by example and proving by example using higher-order unification
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787520)