scientific article; zbMATH DE number 3868611

MaRDI QIDQ3334984zbMATH OpenFDO

Authors Thomas Zeugmann

Publication date 1983

zbMATH Keywords

computable operatorsfastest programinductive inference of recursive functionsprogram synthesissynthesized programs

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 3934386
• Efficient program synthesis using constraint satisfaction in inductive logic programming
• scientific article; zbMATH DE number 517034
• An approach to the inductive synthesis of programs
• Tradeoffs in the inductive inference of nearly minimal size programs
• scientific article; zbMATH DE number 3982491
• Inductive synthesis of recursive logic programs: achievements and prospects
• Fast narrowing-driven partial evaluation for inductively sequential programs

Cited in

(10)

• On the power of recursive optimizers
• Inductive synthesis of models from facts
• Fast narrowing-driven partial evaluation for inductively sequential programs
• Tradeoffs in the inductive inference of nearly minimal size programs
• scientific article; zbMATH DE number 3858406 (Why is no real title available?)
• scientific article; zbMATH DE number 3861134 (Why is no real title available?)
• scientific article; zbMATH DE number 3960973 (Why is no real title available?)
• scientific article; zbMATH DE number 3960974 (Why is no real title available?)
• scientific article; zbMATH DE number 4049027 (Why is no real title available?)
• scientific article; zbMATH DE number 517034 (Why is no real title available?)

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