Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.

DOI10.1007/b12055zbMath1035.68036OpenAlexW263344851MaRDI QIDQ1405987

Ute Schmid

Publication date: 8 September 2003

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b12055

zbMATH Keywords

artificial intelligenceprogram synthesisautomatic programming

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Artificial intelligence (68T99) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (7)

Higher-order pattern anti-unification in linear time ⋮ Unranked second-order anti-unification ⋮ A Library of Anti-unification Algorithms ⋮ A Prolog assisted search for new simple Lie algebras ⋮ Anti-unification and the theory of semirings ⋮ Higher-order pattern generalization modulo equational theories ⋮ Anti-unification for unranked terms and hedges

Uses Software

• Graphplan

This page was built for publication: Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.