Abstract
Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of larger systems (e.g., learning systems). Hence, the need of techniques that can speed up such a process. This paper proposes a new algorithm for matching first-order logic descriptions under θ-subsumption that is able to return the set of all substitutions by which such a relation holds between two clauses, and shows experimental results in support of its performance.
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
Eisinger, N.: Subsumption and connection graphs. In: Siekmann, J.H. (ed.) GWAI-81, German Workshop on Artificial Intelligence, Bad Honnef, pp. 188–198. Springer, Heidelberg (1981)
Esposito, F., Fanizzi, N., Malerba, D., Semeraro, G.: Downward refinement of hierarchical datalog theories. In: Sessa, M.I., Alpuente Frasnedo, M. (eds.) Proceedings of the Joint Conference on Declarative Programming - GULP-PRODE 1995, Università degli Studi di Salerno, pp. 148–159 (1995)
Esposito, F., Semeraro, G., Fanizzi, N., Ferilli, S.: Multistrategy Theory Revision: Induction and abduction in INTHELEX. Machine Learning Journal 38(1/2), 133–156 (2000)
Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)
Giordana, A., Botta, M., Saitta, L.: An experimentals tudy of phase transitions in matching. In: Thomas, D. (ed.) Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), July 31–August 6, vol. 2, pp. 1198–1203. Morgan Kaufmann Publishers, San Francisco (1999)
Gottlob, G., Leitsch, A.: On the efficiency of subsumption algorithms. Journal of the Association for Computing Machinery 32(2), 280–295 (1985)
Helft, N.: Inductive generalization: A logical framework. In: Bratko, I., Lavrač, N. (eds.) Progress in Machine Learning, Wilmslow, UK, pp. 149–157. Sigma Press (1987)
Kietz, J.-U., Lübbe, M.: An efficient subsumption algorithm for inductive logic programming. In: Cohen, W., Hirsh, H. (eds.) Proc. Eleventh International Conference on Machine Learning (ML 1994), pp. 130–138 (1994)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987)
Maloberti, J., Sebag, M.: θ-subsumption in a constraint satisfaction perspective. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, pp. 164–178. Springer, Heidelberg (2001)
Muggleton, S.H., De Raedt, L.: Inductive logic programming. Journal of Logic Programming: Theory and Methods 19, 629–679 (1994)
Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS (LNAI), vol. 1228. Springer, Heidelberg (1997)
Scheffer, T., Herbrich, R., Wysotzki, F.: Efficient θ-subsumption based on graph algorithms. In: Muggleton, S. (ed.) ILP 1996. LNCS, vol. 1314, pp. 212–228. Springer, Heidelberg (1997)
Semeraro, G., Esposito, F., Malerba, D., Fanizzi, N., Ferilli, S.: A logic framework for the incrementali nductive synthesis of datalog theories. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol. 1463, pp. 300–321. Springer, Heidelberg (1998)
Smith, B.M., Dyer, M.E.: Locating the phase transition in binary constraint satisfaction. Artificial Intelligence 81(1–2), 155–181 (1996)
Srinivasan, A., Muggleton, S., Sternberg, M.J.E., King, R.D.: Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence 85(1-2), 277–299 (1996)
Wadler, P.: How to replace failure by a list of successes. In: Jouannaud, J.-P. (ed.) FPCA 1985. LNCS, vol. 201, pp. 113–128. Springer, Heidelberg (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Mauro, N., Basile, T.M.A., Ferilli, S., Esposito, F., Fanizzi, N. (2003). An Exhaustive Matching Procedure for the Improvement of Learning Efficiency. In: Horváth, T., Yamamoto, A. (eds) Inductive Logic Programming. ILP 2003. Lecture Notes in Computer Science(), vol 2835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39917-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-39917-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20144-1
Online ISBN: 978-3-540-39917-9
eBook Packages: Springer Book Archive