Inductive synthesis of recursive logic programs: achievements and prospects

Journal of Logic Programming

Volumn 41, Issue 2-3, 1999, Pages 141-195

  Flener, Pierre ^a   Yilmaz, Serap ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER APPLICATIONS; FORMAL LOGIC; INPUT OUTPUT PROGRAMS; KNOWLEDGE ACQUISITION; RECURSIVE FUNCTIONS; SOFTWARE ENGINEERING;

INDUCTIVE INFERENCE; INDUCTIVE LOGIC PROGRAMMING; RECURSION;

LOGIC PROGRAMMING;

EID: 0033224258     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00028-X     Document Type: Article

References (82)

1. D.W. Aha, S. Lapointe, C.X. Ling, S. Matwin, Inverting implication with small training sets, in: F. Bergadano, L. De Raedt (Eds.), Proceedings of ECML'94, LNAI 784, Springer, Berlin, 1994, pp. 31-48.
2. D.W. Aha, S. Lapointe, C.X. Ling, S. Matwin, Learning recursive relations with randomly selected small training sets, in: W.W. Cohen, H. Hirsh (Eds.), Proceedings of ICML'94, Morgan Kaufmann, Los Altos, 1994.
3. D. Angluin, C.H. Smith, Inductive inference: Theory and methods, Computing Surveys 15 (3) (1983) 237-269.
4. F. Bergadano et al., Inductive test case generation, in: S. Muggleton (Ed.), Proceedings of ILP'93, Technical Report IJS-DP-6707, J. Stefan Inst., Ljubljana, Slovenia, 1993, pp. 11-24.
5. F. Bergadano, D. Gunetti, An interactive system to learn functional logic programs, in: R. Bajcsy (Ed.), Proceedings of IJCAI'93, Morgan Kaufmann, Los Altos, 1993, pp. 1044-1049.
6. F. Bergadano, D. Gunetti, Inductive synthesis of logic programs and inductive logic programming, in: Y. Deville (Ed.), Proc. of LOPSTR'93, Springer, Berlin, 1994, pp. 45-56.
7. F. Bergadano, D. Gunetti, Inductive Logic Programming: From Machine Learning to Software Engineering. The MIT Press, Cambridge, 1995.
8. A.W. Biermann, Automatic programming, in: S.C. Shapiro (Ed.), Encyclopedia of Artificial Intelligence, second, extended edition, John Wiley, 1992, pp. 59-83.
9. H. Boström, Specialization of recursive predicates, in: Proceedings of ECML'95. LNAI, Springer, Berlin, 1995.
10. H. Boström, Theory-guided induction of logic programs by inference of regular languages, in: Proceedings of ICML'96. Morgan Kaufmann, Los Altos, 1996.
11. H. Boström, P. Idestam-Almquist, Specialization of logic programs by pruning SLD-trees, in: S. Wrobel (Ed.), Proceedings of ILP'94, GMD-Studien Nr. 237, Sankt Augustin, Germany, 1994, pp. 31-48.
12. I. Bratko, M. Grobelnik, Inductive learning applied to program construction and verification, in: S. Muggleton (Ed.), Proceedings of ILP'93, TR IJS-DP-6707, J. Stefan Inst., Ljubljana, Slovenia, 1993, pp. 279-292.
13. P.B. Brazdil, A.M. Jorge, Learning by refining algorithm sketches, in: A. Cohn (Ed.), Proceedings of ECAI'94, Wiley, New York, 1994, pp. 443-447.
14. M. Bruynooghe, D. De Schreye, Some thoughts on the role of examples in program transformation and its relevance for explanation-based learning, in: K.P. Jantke (Ed.), Proceedings of AII'89, LNCS 397, Springer, Berlin, 1989, pp. 60-77.
15. W. Buntine, Generalized subsumption and its applications to induction and redundancy. Artificial Intelligence 36 (2) (1988) 149-176.
16. W.W. Cohen, The generality of over-generality, in: Proceedings of IWML'91, Morgan Kaufmann, Los Altos, 1991, pp. 490-494.
17. W.W. Cohen, Compiling prior knowledge into an explicit bias, in: P. Edwards, D. Sleeman (Eds.), Proceedings of ICML'92, Morgan Kaufmann, Los Altos, 1992, pp. 102-110.
18. W.W. Cohen, PAC-learning a restricted class of recursive logic programs, in: S. Muggleton (Ed.), Proceedings of ILP'93, Technical Report IJS-DP-6707, J. Stefan Institute, Ljubljana, Slovenia, 1993, pp. 73-86.
19. W.W. Cohen, PAC-learning recursive logic programs: Efficient algorithms, Journal Artificial Intelligence Research 2 (1995) 501-539.
20. W.W. Cohen, PAC-learning recursive logic programs: Negative results, Journal of Artificial Intelligence Research 2 (1995) 541-573.
21. A. Cypher, EAGER: Programming repetitive tasks by example, in: Human Factors in Computing Systems, Proceedings of CHI'91, ACM Press, 1991, pp. 33-39.
22. L. DeRaedt, M. Bruynooghe, Belief updating from integrity constraints and queries, Artificial Intelligence 53 (2/3) (1992) 291-307.
23. N. Dershowitz, Y.J. Lee, Logical debugging, J. Symbolic Computation, Special Issue on Automatic Programming 15 (5/6) (1993) 745-773.
24. Y. Deville, Logic Programming: Systematic Program Development, Addison-Wesley, Reading, 1990.
25. Y. Deville, K.K. Lau, Logic program synthesis: A survey, J. Logic Programming, Special Issue on 10 Years of Logic Programming 19-20 (1994) 321-350.
26. W. Drabent, S. Nadjm-Tehrani, J. Maluszynski, Algorithmic debugging with assertions, in: H. Abramson, M.H. Rogers (Eds.), Proceedings of META'88, The MIT Press, Cambridge, 1988, pp. 501-521.
27. E. Erdem, P. Flener, Completing open logic programs by constructive induction, International Journal of Intelligent Systems, 1999.
28. P. Flener, Logic Program Synthesis from Incomplete Information, Kluwer Academic Press, New York, 1995.
29. P. Flener, Predicate invention in inductive program synthesis, Technical Report, 1995. (Available as http://www.csd.uu.se/∼pierref/pub/TRpred Inv.ps.gz.)
30. P. Flener, Inductive logic program synthesis with DIALOGS, in: S. Muggleton (Ed.), Proceedings of ILP'96, LNAI 1314, Springer, Berlin, 1997, pp. 175-198.
31. P. Flener, Y. Deville, Logic program synthesis from incomplete specifications, J. Symbolic Computation, Special Issue on Automatic Programming 15 (5-6) (1993) 775-805.
32. P. Flener, L. Popelínský, On the use of inductive reasoning in program synthesis: Prejudice and prospects, in: L. Fribourg, F. Turini (Eds.), Joint Proceedings of META'94 and LOPSTR'94, LNCS 883, Springer, Berlin, 1994, pp. 69-87.
33. P. Flener, K.-K. Lau, M. Ornaghi, On correct program schemas, in: N.E. Fuchs (Ed.), Proceedings of LOPSTR'97, LNCS 1463, Springer, Berlin, 1998, pp. 124-143.
34. M. Grobelnik, Induction of Prolog programs with Markus, in: Y. Deville (Ed.), Proceedings of LOPSTR'93, Springer, Berlin, 1994, pp. 57-63.
35. M. Hagiya, Programming by example and proving by example using higher-order unification, in: M.E. Stickel (Ed.), Proc. of CADE'90, LNCS 449, Springer, Berlin, 1990, pp. 588-602.
36. M. Hagiya, From programming-by-example to proving-by-example, in: T. Ito and A.R. Meyer (Eds.), Proceedings of TACS'91, LNCS 526, Springer, Berlin, 1991, pp. 387-419.
37. A. Hamfelt, J. Fischer-Nilsson, Inductive metalogic programming, in: S. Wrobel (Ed.), Proceedings of ILP'94, GMD-Studien Nr. 237, Sankt Augustin, Germany, 1994, pp. 85-96.
38. M.M. Huntbach, An improved version of Shapiro's Model Inference System, in: E.Y. Shapiro (Ed.), Proceedings of ICLP'86, LNCS 225, Springer, Berlin, 1986, pp. 180-187.
39. M.M. Huntbach, Program synthesis by inductive inference, in: B. du Boulay, D. Hogg, L. Steels (Eds.), Proceedings of ECAI'86, Elsevier, Amsterdam, 1987, pp. 335-344.
40. P. Idestam-Almquist, Efficient induction of recursive definitions by structural analysis of saturations. in: L. DeRaedt (Ed.), Advances in Inductive Logic Programming, IOS Press, 1996, pp. 192-205.
41. A.M. Jorge, P.B. Brazdil, Exploiting algorithm sketches in ILP, in: S. Muggleton (Ed.), Proceedings of ILP'93, Technical Report IJS-DP-6707, J. Stefan Institute, Ljubljana, Slovenia, 1993, pp. 193-203.
42. A.M. Jorge, P.B. Brazdil, Architecture for iterative learning of recursive definitions, in: L. De Raedt (Ed), Advances in Inductive Logic Programming, IOS Press, 1996, pp. 206-218.
43. A.M. Jorge, P.B. Brazdil, Integrity constraints in ILP using a Monte Carlo approach, in: S. Muggleton (Ed.), Proceedings of ILP'96, LNAI 1314, Springer, Berlin, 1997, pp. 229-244.
44. J.-P. Jouannaud, Y. Kodratoff, Characterization of a class of functions synthesized from examples by a Summers-like method using the Boyer-Moore-Wegbreit matching technique, in: Proceedings of IJCAI'79, pp. 440-447.
45. T. Kanamori, H. Seki, Verification of Prolog programs using an extension of execution, in: E.Y. Shapiro (Ed.), Proceedings of ICLP'86, LNCS 225, Springer, Berlin, 1986, pp. 475-489.
46. Y. Kodratoff, J.-P. Jouannaud, Synthesizing LISP programs working on the list level of embedding, in: A.W. Biermann, G. Guiho, Y. Kodratoff (Eds.), Automatic Program Construction Techniques, Macmillan, New York, 1984, pp. 325-374.
47. S. Lapointe, S. Matwin, Sub-unification: A tool for efficient induction of recursive programs, in: Proceedings of ICML'92, Morgan Kaufmann, Los Altos, 1992, pp. 273-281.
48. S. Lapointe, C. Ling, S. Matwin, Constructive inductive logic programming, in: S. Muggleton (Ed.), Proceedings of ILP'93, Technical Report IJS-DP-6707, J. Stefan Inst., Ljubljana, Slovenia, 1993, pp. 255-264.
49. N. Lavrac, S. Dzeroski, Inductive Logic Programming, Techniques and Applications, Ellis Horwood, Chichester, 1994.
50. k revisited: Generalization and formalization of an algorithm for detecting recursive relations in term sequences, in: F. Bergadano, L. De Raedt (Eds.), Proceedings of ECML'94, LNAI 784, Springer, Berlin, 1994, pp. 183-197.
51. B. Le Charlier, P. Flener, Specifications are necessarily informal, or: Some more myths of formal methods, J. Systems and Software 40 (3) (1998) 275-296.
52. Y. Lichtenstein, E.Y. Shapiro, Abstract algorithmic debugging, in: R.A. Kowalski, K.A. Bowen (Eds.), Proceedings of ICLP'88, The MIT Press, Cambridge, 1988, pp. 512-531.
53. J. Marcinkowski, L. Pacholski, Undecidability of the Horn-clause implication problem, in: Proceedings of the 33rd IEEE Annual Symposium on Foundations of Computer Science, 1992, pp. 354-362.
54. C.R. Mofizur, M Numao, Top-down induction of recursive programs from small number of sparse examples, in: L. De Raedt (Ed.), Advances in Inductive Logic Programming, IOS Press, 1996, pp. 236-253.
55. S. Muggleton, Inductive logic programming, New Generation Computing 8 (4) 295-317, 1991. Also in: S. Muggleton (Ed.), Inductive Logic Programming, vol. APIC-38, Academic Press, New York, 1992, pp. 3-27.
56. S. Muggleton, Inductive logic programming, New Generation Computing 8 (4) 295-317, 1991. Also in: S. Muggleton (Ed.), Inductive Logic Programming, vol. APIC-38, Academic Press, New York, 1992, pp. 3-27.
57. S. Muggleton, Inverse entailment and Progol, New Generation Computing 13 (1995) 245-286.
58. S. Muggleton, W. Buntine, Machine invention of first-order predicates by inverting resolution, in: Proceedings of ICML'88; Also in S. Muggleton (Ed.), Inductive Logic Programming, vol. APIC-38, Academic Press, New York, 1992, pp. 331-352.
59. S. Muggleton, W. Buntine, Machine invention of first-order predicates by inverting resolution, in: Proceedings of ICML'88; Also in S. Muggleton (Ed.), Inductive Logic Programming, vol. APIC-38, Academic Press, New York, 1992, pp. 331-352.
60. S. Muggleton, C. Feng, Efficient induction of logic programs, in: S. Muggleton (Ed.), Inductive Logic Programming, vol. APIC-38, Academic Press, New York, 1992, pp. 281-298.
61. S. Muggleton, L. De Raedt. Inductive logic programming: Theory and methods. J. Logic Programming, special issue on 10 years of logic programming, 19-20, 1994, pp. 629-679.
62. C. Nédellec, C. Rouveirol, H. Adé, F. Bergadano, B. Tausend, Declarative bias in inductive logic programming, in: L. De Raedt (Ed.), Advances in Inductive Logic Programming, IOS Press, 1996, pp. 82-103.
63. S.H. Nienhuys-Cheng, R. de Wolf, Foundations of Inductive Logic Programming. LNAI 1228, Springer, Berlin, 1997.
64. G. Plotkin, A note on inductive generalization, in: B. Meltzer, D. Michie (Eds.), Machine Intelligence vol. 5, Elsevier, Amsterdam, 1970, pp. 153-163.
65. G. Plotkin, Automatic Methods of Inductive Inference. Ph.D. thesis, University of Edinburgh, 1971.
66. G. Polya, Induction and Analogy in Mathematics, Mathematics and Plausible Reasoning, vol. I, 1968. Reprinted by Princeton University Press, 1990.
67. J.R. Quinlan, Learning logical definitions from relations. Machine Learning 5 (1990) 239-266.
68. J.R. Quinlan, R.M. Cameron-Jones, FOIL: A midterm report, in: P. B. Brazdil (Ed.), Proceedings of ECML'93, LNCS 667, Springer, Berlin, 1993, pp. 3-20.
69. C. Rouveirol, J.-F. Puget, Beyond inversion of resolution, in: Proceedings of ICML'90, 1990.
70. E.Y. Shapiro, Algorithmic Program Debugging. The MIT Press, Cambridge, 1983.
71. E.Y. Shapiro, Inductive inference of theories from facts, in: J.-L. Lassez, G.D. Plotkin (Eds.), Computational Logic: Essays in Honor of Alan Robinson, The MIT Press, Cambridge, 1991, pp. 199-254.
72. D.R. Smith, The synthesis of LISP programs from examples, A survey, in: A.W. Biermann, G. Guiho, Y. Kodratoff (Eds.), Automatic Program Construction Techniques, Macmillan, New York, 1984, pp. 307-324.
73. Z. Somogyi, F. Henderson, T. Conway, Mercury: An efficient purely declarative logic programming language, in: Proceedings of the Australian Computer Science Conference, 1995, pp. 499-512.
74. I. Stahl, Predicate invention in inductive logic programming, An overview, in: P.B. Brazdil (Ed.), Proceedings of ECML'93, LNAI, Springer, Berlin, 1993, pp. 313-322.
75. I. Stahl, The appropriateness of predicate invention as bias shift operation in ILP, Machine Learning 20 (1-2) (1993) 95-117.
76. L.S. Sterling, M. Kirschenbaum, Applying techniques to skeletons, in: J.-M. Jacquet (Ed.), Constructing Logic Programs, Wiley, New York, 1993, pp. 127-140.
77. P.D. Summers, A methodology for LISP program construction from examples, Journal of the ACM 24 (1) (1977) 161-175.
78. B. Tausend, A unifying representation for language restrictions, in: S. Muggleton (Ed.), Proceedings of ILP'93, Technical Report IJS-DP-6707, Stefan Institute, Ljubljana, Slovenia, 1993, pp. 205-220.
79. N. L. Tinkham, Schema Induction for Logic Program Synthesis, Artificial Intelligence 98 (1-2) (1998) 1-47.
80. I. Weber, ILP systems on the ILPnet systems repository. Available as http://www-ai.ijs.si/ilpnet/ irenefinal.ps, 1996.
81. R. Wirth, P. O'Rorke, Constraints for predicate invention, in: S. Muggleton (Ed.), Inductive Logic Programming, Volume APIC-38, Academic Press, New York, 1992, pp. 299-318.
82. S. Yilmaz, Inductive Synthesis of Recursive Logic Programs, M.Sc. Thesis, Ankara, Turkey, Available as http://www.csd.uu.se/∼pierref/pub/SerapMSc.ps.gz, 1997.