Abstract
We present a framework for theory refinement operators ful- filling properties that ensure the efficiency and effectiveness of the learning process. A refinement operator satisfying these requirements is de- fined ideal. Past results have demonstrated the impossibility of defining ideal operators in search spaces ordered by the logical implication or the θ-subsumption relationships. By assuming the object identity bias over a space defined by a clausal language ordered by logical implication, we obtain OI-implication, a novel ordering relationship, and show that ideal operators can be defined for the resulting search space.
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
M. Bain and S.H. Muggleton. Non-monotonic learning. In S.H. Muggleton, editor, Inductive Logic Programming. Academic Press, London, U.K., 1992.
S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Springer, 1990.
F. Esposito, N. Fanizzi, S. Ferilli, and G. Semeraro. Ideal theory refinement under object identity. In Proceedings of the 17th International Conference on Machine Learning-ICML2000. Morgan Kaufmann, 2000. (forthcoming).
F. Esposito, A. Laterza, D. Malerba, and G. Semeraro. Locally finite, proper and complete operators for refining datalog programs. In Z.W. Raś and M. Michalewicz, editors, Proceedings of the 9th International Symposium on Methodologies for Intelligent Systems-ISMIS96, volume 1079 of LNAI, pages 468–478. Springer, 1996.
N. Fanizzi. Refinement Operators in Multistrategy Incremental Learning. Ph.D. thesis, Dipartimento di Informatica, Universitá di Bari, Italy, 1999.
G. Gottlob. Subsumption and implication. Information Processing Letters, 24(2):109–111, 1987.
P. Idestam-Almquist. Generalization of Clauses. Ph.D. thesis, Stockholm University and Royal Institute of Technology, Kiesta, Sweden, 1993.
J.W. Lloyd. Foundations of Logic Programming. Springer, 2nd edition, 1987.
T.M. Mitchell. Generalization as search. Artificial Intelligence, 18:203–226, 1982.
S.H. Muggleton. Inverting implication. In S. Muggleton and K. Furukawa, editors, Proceedings of the 2nd International Workshop on Inductive Logic Programming, ICOT Technical Memorandum TM-1182, 1992.
S.-H. Nienhuys-Cheng and R. de Wolf. Foundations of Inductive Logic Programming, volume 1228 of LNAI. Springer, 1997.
G.D. Plotkin. A note on inductive generalization. Machine Intelligence, 5:153–163, 1970.
J.A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23–41, January 1965.
G. Semeraro, F. Esposito, D. Malerba, N. Fanizzi, and S. Ferilli. A logic framework for the incremental inductive synthesis of datalog theories. In N.E. Fuchs, editor, Proceedings of the 7th International Workshop LOPSTR97, volume 1463 of LNCS, pages 300–321. Springer, 1998.
P.R.J. van der Laag. An Analysis of Refinement Operators in Inductive Logic Programming. Ph.D. thesis, Erasmus University, Rotterdam, NL, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Esposito, F., Fanizzi, N., Ferilli, S., Semeraro, G. (2000). Refining Logic Theories under OI-Implication. In: Raś, Z.W., Ohsuga, S. (eds) Foundations of Intelligent Systems. ISMIS 2000. Lecture Notes in Computer Science(), vol 1932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39963-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-39963-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41094-2
Online ISBN: 978-3-540-39963-6
eBook Packages: Computer ScienceComputer Science (R0)