Abstract
Learning systems have been devised as a way of overcoming the knowledge acquisition bottleneck in the development of knowledge-based systems. They often cast learning to a search problem in a space of candidate solutions. Since such a space can grow exponentially, techniques for pruning it are needed in order to speed up the learning process. One of the biases used by Inductive Logic Programming (ILP) systems for this purpose is mode declaration. This paper presents an algorithm to incrementally learn this type of meta-knowledge from the available observations, without requiring the final user’s intervention.
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
McCreath, E., Sharma, A.: Extraction of Meta-Knowledge to Restrict the Hypothes Space for ILP Systems. In: Eight Australian Joint Conference on Artificial Intelligence, Xin Yao, pp. 75–82 (1995)
Warren, D.H.D.: Implementing Prolog – Compiling Predicate Logic Programs. Research Reports 39 and 40, Dept. of Artificial Intelligence, University of Edinburgh (1977)
Mellish, C.S.: The Automatic Generation of Mode Declarations for Prolog Programs. DAI Research Paper 163, Dept. of Artificial Intelligence, University of Edinburgh (August 1981)
Mellish, C.S.: Some Global Optimizations for a Prolog Compiler. J. Logic Programming 2(1), 43–66 (1985)
Reddy, U.S.: Transformation of Logic Programs into Functional Programs. In: Proc. 1984 Int.Symposium on Logic Programming, February 1984, pp. 187–196. IEEE Computer Society, Atlantic City (1984)
Bruynooghe, M., Demoen, B., Callebaut, A., Janssens, G.: Abstract Interpretation: Towards the Global Optimization of Prolog Programs. In: Proc. Fourth IEEE Symposium on Logic Programming, San Francisco, CA (September 1987)
Manilla, H., Ukkonen, E.: Flow Analysis of Prolog Programs. In: Proc. Fourth IEEE Symposium on Logic Programming, San Francisco, CA (September 1987)
Debray, S.K., Warren, D.S.: Automatic Mode Inference for Logic Programs. Journal of Logic Programming 5(3), 207–229 (1988)
Morik, K., Wrobel, S., Kietz, J., Emde, W.: Knowledge Acquisition and Machine Learning: Theory Methods and Applications. Academic Press, London (1993)
Muggleton, S., Feng, C.: Efficient Induction of Logic Programs. In: Proceedings of the First Conference on Algorithmic Learning Theory, Tokyo, pp. 368–381. Ohmsa Publishers (1990)
Cameron-Jones, R.M., Quinlan, J.R.: Efficient top-down induction of logic programs. SIGART Bulletin 5(1), 33–42 (1994)
Muggleton, S.: Inverse Entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming 13(3-4), 245–286 (1995)
Furusawa, M., Inuzuka, N., Seki, H., Itoh, H.: Bottom-up induction of logic programs with more than one recursive clause. In: Proceedings of IJCAI 1997 workshop Frontiers of ILP, Nagoya (1997)
Idestam-Almquist, P.: Efficient induction of recursive definitions by structural analysis of saturations. In: De Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 192–205. IOS Press, Amsterdam (1996)
McCreath, E., Sharma, A.: LIME: A System for Learning Relations. Algorithmic Learning Theory, 336–374 (1998)
Rouveirol, C.: Extensions of Inversion of Resolution Applied to Theory Completion. In: Muggleton, S. (ed.) Inductive Logic Programming, pp. 64–90. Academic Press, London (1992)
Esposito, F., Ferilli, S., Fanizzi, N., Basile, T.M.A., Di Mauro, N.: Incremental Multistrategy Learning for Document Processing. Applied Artificial Intelligence Journal 17, 859–883 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Mauro, N., Esposito, F., Ferilli, S., Basile, T.M.A. (2004). An Algorithm for Incremental Mode Induction. In: Orchard, B., Yang, C., Ali, M. (eds) Innovations in Applied Artificial Intelligence. IEA/AIE 2004. Lecture Notes in Computer Science(), vol 3029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24677-0_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-24677-0_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22007-7
Online ISBN: 978-3-540-24677-0
eBook Packages: Springer Book Archive