Premium
Completing open logic programs by constructive induction
Author(s) -
Erdem Esra,
Flener Pierre
Publication year - 1999
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/(sici)1098-111x(199910)14:10<995::aid-int4>3.0.co;2-w
Subject(s) - computer science , recursion (computer science) , unification , relation (database) , constructive , programming language , mutual recursion , schema (genetic algorithms) , generalization , algorithm , theoretical computer science , mathematics , process (computing) , mathematical analysis , database , machine learning
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 reverse ). 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. ©1999 John Wiley & Sons, Inc.