Refinement Strategies for Inductive Leaming of Simple Prolog Programs
Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Learning Be Knowledge Acquisition. Pages 757-762.
Abstract
This paper extends Shapiro's Model Inference System for synthesizing logic programs from examples of input/output behavior. A new refinement operator for clause generation, based upon the decomposition of Prolog programs into 8keleton.,, basic Prolog programs with a well-understood control flow, and technique.,, standard Prolog programming practices is described. Shapiro's original system is introduced; skeletons and techniques are discussed, and simple examples are provided, to familiarize the reader with the necessary terminology. The Model Inference System equipped with this new refinement operator is compared and contrasted with the original version presented by Shapiro . The strengths and weaknesses of applying skeletons and techniques to synthesizing Prolog programs is discussed.
@inproceedings{ijcai1991p111,
title = {Refinement Strategies for Inductive Leaming of Simple Prolog Programs},
author = {Kirschenbaum, Marc and Sterling, Leon},
booktitle = {Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, {IJCAI-91}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John Mylopoulos and Ray Reiter},
pages = {757--762},
year = {1991},
month = {8},
note = {Learning Be Knowledge Acquisition},
url = {https://ijcai.org/proceedings/1991/111},
}
TY - CPAPER TI - Refinement Strategies for Inductive Leaming of Simple Prolog Programs AU - Kirschenbaum, Marc AU - Sterling, Leon T2 - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91 PB - International Joint Conferences on Artificial Intelligence PY - 1991 SP - 757 EP - 762 UR - https://ijcai.org/proceedings/1991/111 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
