Adaptive logic programming
Maarten Keijzer, Vladan Babovic, Conor Ryan, Michael O’Neill, Mike Cattolico · 2001
A new hybrid of Evolutionary Automatic Programming which employs logic programs is presented. In contrast with tree-based methods, it employs a simple GA on variable length strings containing integers. The strings represent sequences of choices used in the derivation of non-deterministic logic programs. A family of Adaptive Logic Programming systems (ALPs) are proposed and from those, two promising members are examined. A proof of principle of this approach is given by running the system on three problems of increasing grammatical difficulty. Although the initialization routine might need improvement, the system as presented here provides a feasible approach to the induction of solutions in grammatically and logically constrained languages.