2Muhammad A,Srinivas P.Learning how to program.Proceedings of the 1999 IEEE Canadian Conference,Shaw Conference Center,Edmonton,Alberta,Canada,1999:134-145.
3Juan L E,Nieola Galesia,Jochen Messnerb.On the complexity of Resolution with bounded conjunctions.Theoretical Computer Science,2004,3 (21):347-370.
4陆钟万.面向计算机科学的数理逻辑.北京:科学出版社,2004
5Flach P A,Giraud-Carrier C,Lloyd J W.Strongly typed inductive concept learning[C]//LNAI 1446:Proceedings of the Eighth International Conference on Inductive Logic Programming.Springer-Verlag, 1998:185-194.
6Flach P A.The use of functional and logic languages in machine leanling[ EB/OL].[2006-12].http ://www.cs.bris.ac.uk/-flach/.
7Bowers A F,Giraud-Carrier C,Lloyd J W.A unifying view of knowledge representation for inductive learning[EB/OL].[2006-12].http:// eiteseer.ist.psu.edu/331762.html.
8De Raedt L.Attribute-value learning versus inductive logic programming:the missing links(extended abstract)[C]//LNAI 1446:Proceedings of the 8th International Conference on Inductive Logic Programming.Springer-Verlag, 1998.
9Quinlan J R.Learning first-order definitions of functions[J].Journal of Artificial Intelligence Research, 1996,5: 139-161.
10Kuramoehi M,Karypis G.Frequent subgraph discovery[C]//Proceedings of the 1st International Conference on Data Mining,2001.
