Schema induction for logic program synthesis
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 792049
- Logic program synthesis as problem reduction using combining forms
- Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.
- An abstract formalization of correct schemas for program synthesis
Cites work
- scientific article; zbMATH DE number 3821093 (Why is no real title available?)
- scientific article; zbMATH DE number 3963167 (Why is no real title available?)
- scientific article; zbMATH DE number 4047035 (Why is no real title available?)
- scientific article; zbMATH DE number 193511 (Why is no real title available?)
- scientific article; zbMATH DE number 3607946 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 545219 (Why is no real title available?)
- scientific article; zbMATH DE number 704873 (Why is no real title available?)
- scientific article; zbMATH DE number 788036 (Why is no real title available?)
- scientific article; zbMATH DE number 3349328 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- scientific article; zbMATH DE number 3349330 (Why is no real title available?)
- scientific article; zbMATH DE number 3403744 (Why is no real title available?)
- scientific article; zbMATH DE number 3412190 (Why is no real title available?)
- A Methodology for LISP Program Construction from Examples
- A Transformation System for Developing Recursive Programs
- A theory of the learnable
- Language identification in the limit
- The Inference of Regular LISP Programs from Examples
Cited in
(15)- Logic program synthesis as problem reduction using combining forms
- Logic Based Program Synthesis and Transformation
- Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.
- scientific article; zbMATH DE number 3965414 (Why is no real title available?)
- scientific article; zbMATH DE number 1396180 (Why is no real title available?)
- scientific article; zbMATH DE number 2079536 (Why is no real title available?)
- An abstract formalization of correct schemas for program synthesis
- scientific article; zbMATH DE number 792049 (Why is no real title available?)
- scientific article; zbMATH DE number 67805 (Why is no real title available?)
- scientific article; zbMATH DE number 4098740 (Why is no real title available?)
- scientific article; zbMATH DE number 1765701 (Why is no real title available?)
- scientific article; zbMATH DE number 177791 (Why is no real title available?)
- scientific article; zbMATH DE number 4072443 (Why is no real title available?)
- Schema-Guided Synthesis of Imperative Programs by Constraint Solving
- Efficient program synthesis using constraint satisfaction in inductive logic programming
This page was built for publication: Schema induction for logic program synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1128483)