Incorporating a folding rule into inductive logic programming

Rosenblueth, David A.

Incorporating a folding rule into inductive logic programming

Download BibTeX Cite

Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1630-1630.

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.

David A. Rosenblueth. 2005. Incorporating a folding rule into inductive logic programming. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 1630–1630. https://ijcai.org/proceedings/2005/280

@inproceedings{ijcai2005p280,
  title     = {Incorporating a folding rule into inductive logic programming},
  author    = {Rosenblueth, David A.},
  booktitle = {Proceedings of the Nineteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-05}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  pages     = {1630--1630},
  year      = {2005},
  url       = {https://ijcai.org/proceedings/2005/280},
}

TY  - CPAPER
TI  - Incorporating a folding rule into inductive logic programming
AU  - Rosenblueth, David A.
T2  - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2005
SP  - 1630
EP  - 1630
UR  - https://ijcai.org/proceedings/2005/280
ER  -