Incorporating a Folding Rule into Inductive Logic Programming
Abstract
Many inductive logic programming systems have operators reorganizing the program so far inferred, such as the intra-construction operator of CIGOL. At the same time, there is a similar reorganizing operator, called the “folding rule, ” developed in program transformation. We argue that there are advantages in using an extended folding rule as a reorganizing operator for inductive-inference systems. Such an extended folding rule allows an inductive-inference system not only to recognize already-learned concepts, but also to increase the efficiently of execution of inferred programs. 1
Cite
Text
Rosenblueth. "Incorporating a Folding Rule into Inductive Logic Programming." International Joint Conference on Artificial Intelligence, 2005.Markdown
[Rosenblueth. "Incorporating a Folding Rule into Inductive Logic Programming." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/rosenblueth2005ijcai-incorporating/)BibTeX
@inproceedings{rosenblueth2005ijcai-incorporating,
title = {{Incorporating a Folding Rule into Inductive Logic Programming}},
author = {Rosenblueth, David A.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2005},
pages = {1630-1631},
url = {https://mlanthology.org/ijcai/2005/rosenblueth2005ijcai-incorporating/}
}