Abstract
This paper describes empirical Inductive Logic Programming system Markus, which was designed as a shell for experimenting in different real-life domains. The current version of the system uses as its basis ’covering’ paradigm (also used by some other systems, e.g. Quinlan’s Foil). Within this paradigm, the development of single program clauses is performed by iterative deepening search of optimally generated refinement graphs (also used in Shapiro’s Model Inference System). The system was successfully applied to several nontrivial learning tasks: construction of qualitative models, program verification, formula invention and construction of some typical Prolog programs, the most difficult being the quick-sort.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bratko, I., Muggleton, S. and Varsek, A. (1991) Learning qualitative models of dynamic systems. Proceedings of First International Inductive Logic Programming Workshop, Viana de Castelo, Portugal, March 1991.
Bratko, I. (1992) - personal communication.
Bratko, I., Grobelnik, M. (1992) Inductive Learning Applied to Program Construction and Verification. Proceedings of AIFIPP Workshop, Madrid, September 1992.
Flener, P., Deville, Y. (1992) Logic Program Synthesis from Incomplete Specifications. Research Report RR 92–22, Université Catholique de Louvain, UNITE D’INFORMATIQUE, 1992.
Huntbach, M. (1986) An improved version of Shapiro’s Model Inference System. Third International Conference On Logic Programming. London, UK: Springer-Verlag.
Kirschenbaum, M., Sterling, L.S. (1991) Refinement Strategies for Inductive Learning Of Simple Prolog Programs. Proceedings of 12. IJCAI, Melbourne (1991).
Lavrae, N., Dieroski, S. and Grobelnik, M. (1991) Learning nonrecursive definitions of relations with LINUS. Fifth European Working Session on Learning, EWSL 91. Porto, Portugal: Springer-Verlag.
Muggleton, S.H. (1991) Inductive logic programming. New Generation Computing 8 (4), 295–318.
Muggleton, S.H. and Feng, C. (1990) Efficient induction of logic programs. First Conference on Algorithmic Learning Theory. Tokyo: Ohmsha.
Quinlan, J.R. (1990) Learning logical definitions from relations. Machine Learning 5 (3), 239–266.
Quinlan, J.R. (1991) Determinate Literals as an Aid in Inductive Logic Programming.
Shapiro, E.Y. (1983) Algorithmic program debugging. Cambridge, MA: MIT Press.
Shapiro, E.Y. (1981) Inductive Inference of Theories From Facts. TR 192, Department of Computer Science, Yale University.
Tinkhman, N.L. (1990) Induction of Schemata for Program Synthesis. PhD thesis, Research Report CS-1990–14, Duke University ( NC, USA ), 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 British Computer Society
About this paper
Cite this paper
Grobelnik, M. (1994). Induction of Prolog programs with Markus. In: Deville, Y. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3234-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3234-9_5
Publisher Name: Springer, London
Print ISBN: 978-3-540-19864-2
Online ISBN: 978-1-4471-3234-9
eBook Packages: Springer Book Archive