An exhaustive matching procedure for the improvement of learning efficiency

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2835, Issue , 2003, Pages 112-129

  Di Mauro, Nicola ^a   Basile, Teresa Maria Altomare ^a   Ferilli, Stefano ^a   Esposito, Floriana ^a   Fanizzi, Nicola ^a  

^a UNIVERSITY OF BARI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; LOGIC PROGRAMMING; PROBLEM SOLVING; SET THEORY; STRUCTURED PROGRAMMING; COMPUTER CIRCUITS; EFFICIENCY; FORMAL LOGIC; RECONFIGURABLE HARDWARE;

ILP ALGORITHMS; LOGIC THEORY; REAL-WORLD PROBLEMS; STRUCTURED DOCUMENT LAYOUT; DEDUCTION SYSTEMS; FIRST ORDER LOGIC; LEARNING EFFICIENCY; SPEED UP;

LEARNING SYSTEMS; INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 9444252355     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39917-9_9     Document Type: Conference Paper

References (17)

1. N. Eisinger. Subsumption and connection graphs. In J. H. Siekmann, editor, GWAI-81, German Workshop on Artificial Intelligence, Bad Honnef, January 1981, pages 188-198. Springer, Berlin, Heidelberg, 1981.
2. F. Esposito, N. Fanizzi, D. Malerba, and G. Semeraro. Downward refinement of hierarchical datalog theories. In M.I. Sessa and M. Alpuente Frasnedo, editors, Proceedings of the Joint Conference on Declarative Programming - GULP-PRODE'95, pages 148-159. Università degli Studi di Salerno, 1995.
3. F. Esposito, G. Semeraro, N. Fanizzi, and S. Ferilli. Multistrategy Theory Revision: Induction and abduction in INTHELEX. Machine Learning Journal, 38(1/2):133-156, 2000.
4. M.R. Garey and D.S. Johnson. Computers and Intractability. Freeman, San Francisco, 1979.
5. A. Giordana, M. Botta, and L. Saitta. An experimental study of phase transitions in matching. In Dean Thomas, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99-Vol2), pages 1198-1203, S.F., July 31-August 6 1999. Morgan Kaufmann Publishers.
6. G. Gottlob and A. Leitsch. On the efficiency of subsumption algorithms. Journal of the Association for Computing Machinery, 32(2):280-295, 1985.
7. N. Helft. Inductive generalization: A logical framework. In I. Bratko and N. Lavrač, editors, Progress in Machine Learning, pages 149-157, Wilmslow, UK, 1987. Sigma Press.
8. J.-U. Kietz and M. Lübbe. An efficient subsumption algorithm for inductive logic programming. In W. Cohen and H. Hirsh, editors, Proc. Eleventh International Conference on Machine Learning (ML-94), pages 130-138, 1994.
9. J.W. Lloyd. Foundations of Logic Programming. Springer, Berlin, New York, 2nd edition, 1987.
10. J. Maloberti and M. Sebag. θ-subsumption in a constraint satisfaction perspective. In Céline Rouveirol and Michèle Sebag, editors, Inductive Logic Programming, 11th International Conference, ILP 2001, Strasbourg, Prance, volume 2157, pages 164-178. Springer, September 2001.
11. S.H. Muggleton and L. De Raedt. Inductive logic programming. Journal of Logic Programming: Theory and Methods, 19:629-679, 1994.
12. S.-H. Nienhuys-Cheng and R. de Wolf. Foundations of Inductive Logic Programming, volume 1228 of Lecture Notes in Artificial Intelligence. Springer, 1997.
13. T. Scheffer, R. Herbrich, and F. Wysotzki. Efficient θ-subsumption based on graph algorithms. In Stephen Muggleton, editor, Proceedings of the 6th International Workshop on Inductive Logic Programming (ILP-96), volume 1314 of LNAI, pages 212-228, Berlin, August 26-28 1997. Springer.
14. 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, Logic Program Synthesis and Transformation, number 1463 in Lecture Notes in Computer Science, pages 300-321. Springer-Verlag, 1998.
15. Barbara M. Smith and Martin E. Dyer. Locating the phase transition in binary constraint satisfaction. Artificial Intelligence, 81(1-2):155-181, 1996.
16. Ashwin Srinivasan, Stephen Muggleton, Michael J.E. Sternberg, and Ross D. King. Theories for mutagenicity: A study in first-order and feature-based induction, Artificial Intelligence, 85(1-2):277-299, 1996.
17. P. Wadler. How to replace failure by a list of successes. In J.-P. Jouannaud, editor, Functional Programming Languages and Computer Architecture, volume 201 of Lecture Notes in Computer Science, pages 113-128. Springer-Verlag, 1985.