scientific article; zbMATH DE number 4020482

MaRDI QIDQ3763593zbMATH OpenFDO

Authors Rolf Wiehagen

Publication date 1986

zbMATH Keywords

enumeration strategiesprogram synthesissynthesis of programs of recursive functions from input/output examples

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 4049027
• A knowledge-based approach to program synthesis from examples
• scientific article; zbMATH DE number 4078789
• Constructing simply recursive programs from a finite set of good examples
• Synthesizing imperative programs from examples guided by static analysis
• scientific article; zbMATH DE number 3934386
• scientific article; zbMATH DE number 3960973
• scientific article; zbMATH DE number 3845028
• Soundness and completeness of a synthesis algorithm based on example computations

Cited in

(18)

• Language learning from texts: Degrees of intrinsic complexity and their characterizations
• Intrinsic complexity of learning geometrical concepts from positive data
• A knowledge-based approach to program synthesis from examples
• scientific article; zbMATH DE number 3858406 (Why is no real title available?)
• scientific article; zbMATH DE number 3932374 (Why is no real title available?)
• scientific article; zbMATH DE number 3960972 (Why is no real title available?)
• scientific article; zbMATH DE number 3960973 (Why is no real title available?)
• Soundness and completeness of a synthesis algorithm based on example computations
• scientific article; zbMATH DE number 4049027 (Why is no real title available?)
• scientific article; zbMATH DE number 517034 (Why is no real title available?)
• scientific article; zbMATH DE number 2077170 (Why is no real title available?)
• scientific article; zbMATH DE number 939514 (Why is no real title available?)
• Efficient program synthesis: semantics, logic, complexity
• Two examples of computational creativity: ILP multiple predicate synthesis and the `assets' in theorem proving
• Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
• Alien coding
• Synthesis with asymptotic resource bounds
• Counterexample-guided partial bounding for recursive function synthesis

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 Q3763593)