✍ Scribed by Esra Erdem; Pierre Flener
No coin nor oath required. For personal study only.
We consider part of the problem of schema-biased inductive synthesis of recursive logic Ž programs from incomplete specifications, such as clausal evidence for instance, but not . necessarily, ground positive and negative examples . After synthesizing the base clause Ž . and introducing recursive call s to the recursive clause, it remains to combine the overall result from the partial results obtained through recursion, so as to complete the recursive clause. Evidence for this combination relation can be abduced from the initially given evidence for the top-level relation. A program for this combination relation can be Ž . anything, from a single clause performing a unification such as for lastElem to multiple Ž . guarded clauses performing unifications such as for filtering programs to recursive Ž . programs such as for naive re¨erse . Existing methods cannot induce guarded clause programs for this combination relation from the abduced evidence. Some existing methods cannot even detect that the combination program itself may have to be recursive and thus they then do not recursively invoke themselves the overall recursive program synthesizer. We introduce our Program Completion Method as a suitable extension and generalization of the existing methods.
📜 SIMILAR VOLUMES