归纳逻辑程序设计综述
|
摘要
归纳逻辑程序设计(inductive logic programming,ILP)是以一阶逻辑归纳理论为基础,并以一阶逻辑为表达语言的符号规则学习方法.ILP学得的模型是易于理解的一阶逻辑符号规则,而非难以解释的黑箱模型;在学习中可以相对容易地显式利用以一阶逻辑描述的领域知识;学得模型能对领域中个体间的关系进行建模,而非仅仅对个体的标记进行预测.然而,由于潜在假设空间巨大,进行高效学习有相当的困难.综述了ILP领域的研究情况,从不同一阶逻辑归纳理论的角度对主流的ILP方法做出了梳理.还介绍了近年来ILP基于二阶诱导推理理论的扩展、基于概率的扩展和引入可微构件的扩展.最后,介绍了ILP在实际任务中的代表性应用,探讨了ILP方法目前所遇到的挑战,并对其未来发展进行了展望.
Inductive logic programming(ILP)is a subfield of symbolic rule learning that is formalized by first-order logic and rooted in first-order logical induction theories.The model learned by ILP is a set of highly interpretable first-order rules rather than black boxes;owing to the strong expressive power of first-order logic language,it is relatively easier to exploit domain knowledge during learning;the learned model by ILP can be used for modeling relationships between subjects,rather than predicting the labels of independent objects.However,due to its huge and complicated underlying hypothesis space,it is difficult for ILP to learn models efficiently.This paper tries to review most of the current researches in this area.Mainstream ILP approaches are introduced according to different categorizations of first-order logical induction theories.This paper also reviews the most recent progress in the ILP area,including ILP techniques based on second-order logical abduction,probabilistic inductive logic programming(PILP)and the ILP approaches that introduce differentiable components.This paper also introduces some representative applications of ILP approaches in practical problems,and then talks about its major challenges,and finally discusses about the prospects for future research directions.
Inductive logic programming(ILP)is a subfield of symbolic rule learning that is formalized by first-order logic and rooted in first-order logical induction theories.The model learned by ILP is a set of highly interpretable first-order rules rather than black boxes;owing to the strong expressive power of first-order logic language,it is relatively easier to exploit domain knowledge during learning;the learned model by ILP can be used for modeling relationships between subjects,rather than predicting the labels of independent objects.However,due to its huge and complicated underlying hypothesis space,it is difficult for ILP to learn models efficiently.This paper tries to review most of the current researches in this area.Mainstream ILP approaches are introduced according to different categorizations of first-order logical induction theories.This paper also reviews the most recent progress in the ILP area,including ILP techniques based on second-order logical abduction,probabilistic inductive logic programming(PILP)and the ILP approaches that introduce differentiable components.This paper also introduces some representative applications of ILP approaches in practical problems,and then talks about its major challenges,and finally discusses about the prospects for future research directions.
引文
[1]Zhou Zhihua.Machine Learning[M].Beijing:Tsinghua University Press,2016(in Chinese)(周志华.机器学习[M].北京:清华大学出版社,2016)
[2]Muggleton S H.Inductive logic programming[J].New Generation Computing,1991,8(4):295-318
[3]Enderton H.A Mathematical Introduction to Logic[M].2nd ed.Amsterdam:Academic Press,2001
[4]Jackson P.Introduction to Expert Systems[M].3rd ed.Reading,MA:Addison-Wesley,1999
[5]Baral C,Gelfond M.Logic programming and knowledge representation[J].Journal of Logic Programming,1994,19(20):73-148
[6]Plotkin G D.A note on inductive generalization[C]Proc of the 5th Annual Machine Intelligence Workshop.Edinburgh,UK:Edinburgh University Press,1969:153-163
[7]Plotkin G D.A further note on inductive generalizatio[C]Proc of the 6th Annual Machine Intelligence Workshop.Edinburgh,UK:Edinburgh University Press,1970:101-124
[8]Plotkin G D.Automatic Methods of Inductive Inference[M].Edinburgh,Scotland:Edinburgh University,1971
[9]Vere S A.Induction of concepts in the predicate calculus[C]Proc of the 4th IJCAI.San Francisco,CA:Morgan Kaufmann,1975:282-287
[10]Sammut C,Banerji R B,Plotkin G D.Learning concepts by asking questions[J].Machine Learning:An Artificial Intelligence Approach,1969,2:167-192
[11]Muggleton S H.Duce,an oracle based approach to constructive induction[C]Proc of the 10th IJCAI.San Francisco,CA:Morgan Kaufmann,1987:287-292
[12]Muggleton S H,Buntine W.Machine invention of first-order predicates by inverting resolution[C]Proc of the 5th ICML.San Francisco,CA:Morgan Kaufmann,1988:339-352
[13]Muggleton S H.Inverting the resolution principle[J].Machine Intelligence,1991,12:93-104
[14]Rouveirol C,Puget J F.A simple and general solution for inverting resolution[C]Proc of EWSL-89.London:Pitman,1989:201-210
[15]Muggleton S H.Inverting implication[C]Proc of the 1st European Workshop on ILP.Berlin:Springer,1992:19-39
[16]Muggleton S H.Inverse entailment and Progol[J].New Generation Computing,1995,13(3/4):245-286
[17]Muggleton S H.Completing inverse entailment[C]Proc of the 8th Int Workshop on ILP.Berlin:Springer,1998:245-249
[18]Nienhuys-Cheng S H,De Wolf R.Foundations of Inductive Logic Programming[M].Berlin:Springer,1997
[19]Valiant L G.A theory of the learnable[J].Communications of the ACM,1984,27(11):1134-1142
[20]D6eroski S,Muggleton S H,Russell S.PAC-learnability of determinate logic programs[C]Proc of the 5th ACMWorkshop on CLT.New York:ACM,1992:128-135
[21]D6eroski S,Muggleton S H,Russell S.Learnability of constrained logic programs[C]Proc of the 6th ECML.Berlin:Springer,1993:342-347
[22]Cohen W.PAC-learning a restricted class of logic programs[C]Proc of the 3rd Int Workshop on ILP.Berlin:Springer,1993:41-72
[23]Kietz J U.Some lower bounds on the computational complexity of inductive logic programming[C]Proc of the6th ECML.Berlin:Springer,1993:115-123
[24]Muggleton S H,Feng,C.Efficient induction of logic programs[C]Proc of the 2nd Int Workshop on ILP.Amsterdam:Academic Press,1992:281-298
[25]LavracˇN,Dcˇeroski S,Grobelnik M.Learning non-recursive definitions of relations with LINUS[C]Proc of the 5th European Working Session on Learning.Berlin:Springer,1991:265-281
[26]De Raedt L,Bruynooghe M.CLINT:A multistrategy interactive concept-learner and theory revision system[C]Proc of the 1st Int Workshop on Multistrategy Learning.San Francisco,CA:Morgan Kaufmann,1991:175-191
[27]Muggleton,S H,King R D,Sternberg M J E.Protein secondary structure prediction using logic-based machine learning[J].Protein Engineering,1992,5(7):647-657
[28]Feng C.Inducing temporal fault diagnostic rules from a qualitative model[C]Proc of the 1st Int Workshop on ILP.Amsterdam:Academic Press,1991:403-406
[29]King R D,Muggleton S H,Srinivasan A,et al.Structureactivity relationships derived by machine learning:The use of atoms and their bond connectives to predict mutagenicity by inductive logic programming[J].Proceedings of the National Academy of Sciences,1996,93(1):438-442
[30]King R D,Whelan K E,Jones F M,et al.Functional genomic hypothesis generation and experimentation by a robot scientist[J].Nature,2004,427:47-252
[31]King R D,Rowland J,Oliver S G,et al.The automation of science[J].Science,2009,324(5923):85-89
[32]Dantsin E.Probabilistic logic programs and their semantics[C]Proc of the 1st Russian Conf on Logic Programming.Berlin:Springer,1992:152-164
[33]Poole D.Logic programming,abduction and probability[J].New Generation Computing,1993,11(3):377-400
[34]Sato T.A statistical learning method for logic programs with distribution semantics[C]Proc of the 12th Int Conf on Logic Programming.Cambridge,MA:MIT Press,1995:715-729
[35]De Raedt L,Kersting K.Probabilistic inductive logic programming[C]Proc of the 15th Int Conf on ALT.Berlin:Springer,2004:19-36
[36]Sato T,Kameya T.PRISM:A language for symbolicstatistical modeling[C]Proc of the 15th IJCAI.San Francisco,CA:Morgan Kaufmann,1997:1330-1335
[37]Muggleton S H.Stochastic logic programs[J].Advances in Inductive Logic Programming,1996,32:254-264
[38]Poole D.The independent choice logic for modelling multiple agents under uncertainty[J].Artificial Intelligence,1997,94(1):7-56
[39]Costa V S,Page D,Qazi M,et al.CLP(BN):Constraint logic programming for probabilistic knowledge[C]Proc of the 19th Conf on UAI.San Francisco,CA:Morgan Kaufmann,2002:517-524
[40]Vennekens J,Verbaeten S,Bruynooghe M.Logic programs with annotated disjunctions[C]Proc of the 27th ICLP.Berlin:Springer,2004:431-445
[41]De Raedt L,Kimmig A,Toivonen H.ProbLog:Aprobabilistic prolog and its application in link discovery[C]Proc of the 20th IJCAI.San Francisco,CA:Morgan Kaufmann,2007:2462-2467
[42]Baral C,Gelfond M,Rushton N.Probabilistic reasoning with answer sets[J].Theory and Practice of Logic Programming,2009,9(1):57-144
[43]Vennekens J,Denecker M,Bruynooghe M.CP-logic:Alanguage of causal probabilistic events and its relation to logic programming[J].Theory and Practice of Logic Programming,2009,9(3):245-308
[44]Muggleton S H.Learning stochastic logic programs[J].Electronic Transactions on Artificial Intelligence,2000,4(B):141-153
[45]Cussens J.Parameter estimation in stochastic logic programs[J].Machine Learning,2001,44(3):245-271
[46]De Raedt L,Kersting K,Kimming A,et al.Compressing probabilistic prolog programs[J].Machine Learning,2008,70(2):151-168
[47]Gutmann B,Kimmig A,Kersting K,et al.Parameter learning in probabilistic databases:A least squares approach[C]Proc of 2008ECML PKDD.Berlin:Springer,2008:473-488
[48]Meert W,Struyf J,Blockeel H.Learning ground CP-logic theories by leveraging Bayesian network learning techniques[J].Fundamenta Informaticae,2008,89(1):131-160
[49]Inoue K,Furukawa K,Kobayashi I,et al.Discovering rules by meta-level abduction[C]Proc of the 9th Int Conf on ILP.Berlin:Springer,2010:49-64
[50]Muggleton S H,Lin D,Pahlavi N,et al.Meta-interpretive learning:Application to grammatical inference[J].Machine Learning,2014,94(1):25-49
[51]Gutmann B,Thon I,De Raedt L.Learning the parameters of probabilistic logic programs from interpretations[C]Proc of 2011ECML PKDD.Berlin:Springer,2011:581-596
[52]De Raedt L,Thon I.Probabilistic rule learning[C]Proc of the 21st Int Conf on ILP.Berlin:Springer,2011:47-58
[53]Bellodi E,Riguzzi F.Experimentation of an expectation maximization algorithm for probabilistic logic programs[J].Intelligenza Artificiale,2012,6(1):3-18
[54]Bellodi E,Riguzzi F.Learning the structure of probabilistic logic programs[C]Proc of the 21st Int Conf on ILP.Berlin:Springer,2011:61-75
[55]Wang W Y,Mazaitis K,Cohen W.Programming with personalized pagerank:A locally groundable first-order probabilistic logic[C]Proc of the 22nd Int Conf on Information&Knowledge Management.New York:ACM,2013:2129-2138
[56]Dai Wangzhou,Zhou Zhihua.Statistical unfolded logic learning[C/OL]Proc of the 7th Asian Conf on Machine Learning.JMLR,2015:349-361.[2018-11-01].http:proceedings.mlr.press/
[57]Fierens D,Van den Broeck G,Rekens J,et al.Inference and learning in probabilistic logic programs using weighted Boolean formulas[J].Theory and Practice of Logic Programming,2015,15(3):358-401
[58]Bellodi E,Riguzzi F.Structure learning of probabilistic logic programs by searching the clause space[J].Theory and Practice of Logic Programming,2015,15(2):169-212
[59]De Maeyer D,Renkens J,Cloots L,et al.PheNetic:Network-based interpretation of unstructured gene lists in E.coli.[J].Molicular BioSystems,2013,9(7):1594-1603
[60]Wang W Y,Kong L,Mazaitis K,et al.Dependency parsing for weibo:An efficient probabilistic logic programming approach[C]Proc of 2014 EMNLP.Stroudsburg PA:ACL,2014:25-29
[61]Skarlatidis A,Artikis A,Filippou J,et al.A probabilistic logic programming event calculus[J].Theory and Practice of Logic Programming,2015,15(2):213-245
[62]Catherine R,Cohen W.Personalized recommendations using knowledge graphs:A probabilistic logic programming approach[C]Proc of the 10th ACM Conf on Recommender Systems.New York:ACM,2016:325-332
[63]Antanas L,Dries A,Moreno P,et al.Relational affordance learning for task-dependent robot grasping[C]Proc of the27th Int Conf on ILP.Berlin:Springer,2017:1-15
[64]C8rte-Real J,Dutra I,Rocha R.On applying probabilistic logic programming to breast cancer data[C]Proc of the27th Int Conf on ILP.Berlin:Springer,2017:31-45
[65]Rocktschel T,Riedel S.End-to-end differentiable proving[C]Advances in Neural Information Processing Systems30.Red Hook,NY:Curran Associates,Inc.,2017:3791-3803
[66]Evans R,Grefenstette E.Learning explanatory rules from noisy data[J].Journal of Artificial Intelligence Research,2018,61:1-64
[67]Idestam-Almquist P.Learning missing clauses by inverse resolution[C]Proc of the 5th Int Conf on Generation Computer Systems.Ohmsha:IOS Press,1992:610-617
[68]Kramer S,LavracˇN,Flach P.Propositionalisation approaches to relational data mining[G]Relational Data Mining.Berlin:Springer,2001:262-291
[69]Kramer S,Pfahringer B,Helma C.Stochastic propositionalisation of non-determinate background knowledge[C]Proc of the 8th Int Conf on ILP.Berlin:Springer,1998:80-94
[70]Flach P,Lachiche N.1BC:A first-order Bayesian classifier[C]Proc of the 9th Workshop on ILP.Berlin,Heidelberg:Slovenia,1999:92-103
[71]Robinson J A.A machine-oriented logic based on the resolution principle[J].Journal of the ACM,1965,12(1):23-41
[72]Popplestone R J.An experiment in automatic induction[C]Proc of the 5th Annual Machine Intelligence Workshop.Edinburgh,UK:Edinburgh University Press,1969:203-215
[73]Kearns M,Li Ming,Pitt L,et al.On the learnability of Boolean formulae[C]Proc of the 9th Annual ACM Symp on Theory of Computing.New York:ACM,1987:285-295
[74]Page C D,Frisch A.Generalization and learnability:A study of constrained atoms[C]Proc of the 2nd Int Workshop on ILP.Amsterdam:Academic Press,1992:29-61
[75]Cohen W,Page C D.Polynomial learnability and inductive logic programming:Methods and results[J].New Generation Computing,1995,13(3/4):369-409
[76]Kakas A C,Flach P A.Abduction and induction in artificial intelligence[J].Journal of Applied Logic,2009,7(3):251-251
[77]Lloyd J W.Logic for Learning[M].Berlin:Springer,2003
[78]Cropper A,Muggleton S H.Logical minimization of metarules within meta-interpretive learning[C]Proc of the 24th Int Conf on ILP.Berlin:Springer,2015:65-78
[79]Cropper A,Muggleton S H.Learning efficient logic programs[J/OL].Machine Learning,2018[2018-11-09].https:doi.org/10.1007/s10994-018-5712-6
[80]Nilsson N J.Probabilistic logic[J].Artificial Intelligence,1986,28(1):71-87
[81]Becker B,Drechsler R.Binary Decision Diagrams:Theory and Implementation[M].Berlin:Springer,1998
[82]Dries A,Kimmig A,Meert W,et al.ProbLog2:Probabilistic logic programming[C]Proc of 2015 ECMLPKDD.Berlin:Springer,2015:312-315
[83]Darwiche A.A compiler for deterministic,decomposable negation normal form[C]Proc of AAAI-02.Menlo Park,CA:AAAI,2002:627-634
[84]De Raedt L,Kimmig A.Probabilistic(logic)programming concepts[J].Machine Learning,2015,100(1):5-47
[85]Richards B L,Mooney R J.Learning relations by pathfinding[C]Proc of AAAI-92.Menlo Park,CA:AAAI,1992:50-55
[86]Zhou Zhihua,Chen Zhaoqian.Hybrid decision tree[J].Knowledge-Based Systems,2002,15(8):515-528
[87]Towell G,Shavlik J W.Knowledge based artificial neural networks[J].Artificial Intelligence,1994,70(1):119-165
[88]Tamaddoni-Nezhad A,Chaleil R,Kakas A,et al.Application of abductive ILP to learning metabolic network inhibition from temporal data[J].Machine Learning,2006,64(1/2/3):209-230
[89]Getoor L,Taskar B,(editors).Introduction to Statistical Relational Learning[M].Cambridge,MA:MIT Press,2007
[90]Richardson M,Domingos P.Markov logic networks[J].Machine Learning,2006,62(1/2):107-136
[91]Bohan D A,Caron-Lormier G,Muggleton S H,et al.Automated discovery of food webs from ecological data using logic-based machine learning[J].PloS ONE,2011,6(12):e29028
[92]Muggleton S H,Dai Wangzhou,Sammut C,et al.Metainterpretive learning from noisy images[J].Machine Learning,2018,107(7):1097-1118
[93]Dai Wangzhou,Muggleton S H,Zhou Zhihua.Logical vision:Meta-interpretive learning for simple geometrical concepts[C/OL]Late Breaking Papers of the 25th Int Conf on ILP.CEUR-W S.org,2015:1-16.[2018-11-09].http:ceur-ws.org/Vol-1636/
[94]Lin D,Dechter E,Ellis K,et al.Bias reformulation for one-shot function induction[C]Proc of the 23rd ECAI.Ohmsha:IOS Press,2014:525-530
[95]Zhou Zhihua.Learnware:On the future of machine learning[J].Frontiers of Computer Science,2016,10(4):589-590
[96]Princeton University.About WordNet[OL].2010[2018-11-09].https:wordnet.princeton.edu/
[97]Russell S J.Unifying logic and probability[J].Communications of the ACM,2015,58(7):88-97
[98]Nishiyama H,Ohwada H.Parallel inductive logic programming system for superlinear speedup[C]Proc of the 27th Int Conf on ILP.Berlin:Springer,2017:112-123
[99]Alchourròn C E,Grdenfors P,Makinson D.On the logic of theory change:Partial meet contraction and revision functions[J].The Journal of Symbolic Logic,1985,50(2):510-530
[100]Dai Wangzhou,Xu Qiuling,Yu Yang,et al.Tunneling neural perception and logic reasoning through abductive learning[J].arXiv preprint,2018,abs/1802.01173
[101]Dai Wangzhou,Zhou Zhihua.Combining logical abduction and statistical induction:Discovering written primitives with human knowledge[C]Proc of AAAI-17.Menlo Park,CA:AAAI,2017:4392-4398
[102]Socher R,Chen Danqi,Manning C D,et al.Reasoning with neural tensor networks for knowledge base completion[C]Advances in Neural Information Processing Systems 26.Red Hook,NY:Curran Associates,Inc,2013:926-934
[103]Cohen W.Tensorlog:A differentiable deductive database[J].arXiv preprint,2016,abs/1605.06523,2016
[2]Muggleton S H.Inductive logic programming[J].New Generation Computing,1991,8(4):295-318
[3]Enderton H.A Mathematical Introduction to Logic[M].2nd ed.Amsterdam:Academic Press,2001
[4]Jackson P.Introduction to Expert Systems[M].3rd ed.Reading,MA:Addison-Wesley,1999
[5]Baral C,Gelfond M.Logic programming and knowledge representation[J].Journal of Logic Programming,1994,19(20):73-148
[6]Plotkin G D.A note on inductive generalization[C]Proc of the 5th Annual Machine Intelligence Workshop.Edinburgh,UK:Edinburgh University Press,1969:153-163
[7]Plotkin G D.A further note on inductive generalizatio[C]Proc of the 6th Annual Machine Intelligence Workshop.Edinburgh,UK:Edinburgh University Press,1970:101-124
[8]Plotkin G D.Automatic Methods of Inductive Inference[M].Edinburgh,Scotland:Edinburgh University,1971
[9]Vere S A.Induction of concepts in the predicate calculus[C]Proc of the 4th IJCAI.San Francisco,CA:Morgan Kaufmann,1975:282-287
[10]Sammut C,Banerji R B,Plotkin G D.Learning concepts by asking questions[J].Machine Learning:An Artificial Intelligence Approach,1969,2:167-192
[11]Muggleton S H.Duce,an oracle based approach to constructive induction[C]Proc of the 10th IJCAI.San Francisco,CA:Morgan Kaufmann,1987:287-292
[12]Muggleton S H,Buntine W.Machine invention of first-order predicates by inverting resolution[C]Proc of the 5th ICML.San Francisco,CA:Morgan Kaufmann,1988:339-352
[13]Muggleton S H.Inverting the resolution principle[J].Machine Intelligence,1991,12:93-104
[14]Rouveirol C,Puget J F.A simple and general solution for inverting resolution[C]Proc of EWSL-89.London:Pitman,1989:201-210
[15]Muggleton S H.Inverting implication[C]Proc of the 1st European Workshop on ILP.Berlin:Springer,1992:19-39
[16]Muggleton S H.Inverse entailment and Progol[J].New Generation Computing,1995,13(3/4):245-286
[17]Muggleton S H.Completing inverse entailment[C]Proc of the 8th Int Workshop on ILP.Berlin:Springer,1998:245-249
[18]Nienhuys-Cheng S H,De Wolf R.Foundations of Inductive Logic Programming[M].Berlin:Springer,1997
[19]Valiant L G.A theory of the learnable[J].Communications of the ACM,1984,27(11):1134-1142
[20]D6eroski S,Muggleton S H,Russell S.PAC-learnability of determinate logic programs[C]Proc of the 5th ACMWorkshop on CLT.New York:ACM,1992:128-135
[21]D6eroski S,Muggleton S H,Russell S.Learnability of constrained logic programs[C]Proc of the 6th ECML.Berlin:Springer,1993:342-347
[22]Cohen W.PAC-learning a restricted class of logic programs[C]Proc of the 3rd Int Workshop on ILP.Berlin:Springer,1993:41-72
[23]Kietz J U.Some lower bounds on the computational complexity of inductive logic programming[C]Proc of the6th ECML.Berlin:Springer,1993:115-123
[24]Muggleton S H,Feng,C.Efficient induction of logic programs[C]Proc of the 2nd Int Workshop on ILP.Amsterdam:Academic Press,1992:281-298
[25]LavracˇN,Dcˇeroski S,Grobelnik M.Learning non-recursive definitions of relations with LINUS[C]Proc of the 5th European Working Session on Learning.Berlin:Springer,1991:265-281
[26]De Raedt L,Bruynooghe M.CLINT:A multistrategy interactive concept-learner and theory revision system[C]Proc of the 1st Int Workshop on Multistrategy Learning.San Francisco,CA:Morgan Kaufmann,1991:175-191
[27]Muggleton,S H,King R D,Sternberg M J E.Protein secondary structure prediction using logic-based machine learning[J].Protein Engineering,1992,5(7):647-657
[28]Feng C.Inducing temporal fault diagnostic rules from a qualitative model[C]Proc of the 1st Int Workshop on ILP.Amsterdam:Academic Press,1991:403-406
[29]King R D,Muggleton S H,Srinivasan A,et al.Structureactivity relationships derived by machine learning:The use of atoms and their bond connectives to predict mutagenicity by inductive logic programming[J].Proceedings of the National Academy of Sciences,1996,93(1):438-442
[30]King R D,Whelan K E,Jones F M,et al.Functional genomic hypothesis generation and experimentation by a robot scientist[J].Nature,2004,427:47-252
[31]King R D,Rowland J,Oliver S G,et al.The automation of science[J].Science,2009,324(5923):85-89
[32]Dantsin E.Probabilistic logic programs and their semantics[C]Proc of the 1st Russian Conf on Logic Programming.Berlin:Springer,1992:152-164
[33]Poole D.Logic programming,abduction and probability[J].New Generation Computing,1993,11(3):377-400
[34]Sato T.A statistical learning method for logic programs with distribution semantics[C]Proc of the 12th Int Conf on Logic Programming.Cambridge,MA:MIT Press,1995:715-729
[35]De Raedt L,Kersting K.Probabilistic inductive logic programming[C]Proc of the 15th Int Conf on ALT.Berlin:Springer,2004:19-36
[36]Sato T,Kameya T.PRISM:A language for symbolicstatistical modeling[C]Proc of the 15th IJCAI.San Francisco,CA:Morgan Kaufmann,1997:1330-1335
[37]Muggleton S H.Stochastic logic programs[J].Advances in Inductive Logic Programming,1996,32:254-264
[38]Poole D.The independent choice logic for modelling multiple agents under uncertainty[J].Artificial Intelligence,1997,94(1):7-56
[39]Costa V S,Page D,Qazi M,et al.CLP(BN):Constraint logic programming for probabilistic knowledge[C]Proc of the 19th Conf on UAI.San Francisco,CA:Morgan Kaufmann,2002:517-524
[40]Vennekens J,Verbaeten S,Bruynooghe M.Logic programs with annotated disjunctions[C]Proc of the 27th ICLP.Berlin:Springer,2004:431-445
[41]De Raedt L,Kimmig A,Toivonen H.ProbLog:Aprobabilistic prolog and its application in link discovery[C]Proc of the 20th IJCAI.San Francisco,CA:Morgan Kaufmann,2007:2462-2467
[42]Baral C,Gelfond M,Rushton N.Probabilistic reasoning with answer sets[J].Theory and Practice of Logic Programming,2009,9(1):57-144
[43]Vennekens J,Denecker M,Bruynooghe M.CP-logic:Alanguage of causal probabilistic events and its relation to logic programming[J].Theory and Practice of Logic Programming,2009,9(3):245-308
[44]Muggleton S H.Learning stochastic logic programs[J].Electronic Transactions on Artificial Intelligence,2000,4(B):141-153
[45]Cussens J.Parameter estimation in stochastic logic programs[J].Machine Learning,2001,44(3):245-271
[46]De Raedt L,Kersting K,Kimming A,et al.Compressing probabilistic prolog programs[J].Machine Learning,2008,70(2):151-168
[47]Gutmann B,Kimmig A,Kersting K,et al.Parameter learning in probabilistic databases:A least squares approach[C]Proc of 2008ECML PKDD.Berlin:Springer,2008:473-488
[48]Meert W,Struyf J,Blockeel H.Learning ground CP-logic theories by leveraging Bayesian network learning techniques[J].Fundamenta Informaticae,2008,89(1):131-160
[49]Inoue K,Furukawa K,Kobayashi I,et al.Discovering rules by meta-level abduction[C]Proc of the 9th Int Conf on ILP.Berlin:Springer,2010:49-64
[50]Muggleton S H,Lin D,Pahlavi N,et al.Meta-interpretive learning:Application to grammatical inference[J].Machine Learning,2014,94(1):25-49
[51]Gutmann B,Thon I,De Raedt L.Learning the parameters of probabilistic logic programs from interpretations[C]Proc of 2011ECML PKDD.Berlin:Springer,2011:581-596
[52]De Raedt L,Thon I.Probabilistic rule learning[C]Proc of the 21st Int Conf on ILP.Berlin:Springer,2011:47-58
[53]Bellodi E,Riguzzi F.Experimentation of an expectation maximization algorithm for probabilistic logic programs[J].Intelligenza Artificiale,2012,6(1):3-18
[54]Bellodi E,Riguzzi F.Learning the structure of probabilistic logic programs[C]Proc of the 21st Int Conf on ILP.Berlin:Springer,2011:61-75
[55]Wang W Y,Mazaitis K,Cohen W.Programming with personalized pagerank:A locally groundable first-order probabilistic logic[C]Proc of the 22nd Int Conf on Information&Knowledge Management.New York:ACM,2013:2129-2138
[56]Dai Wangzhou,Zhou Zhihua.Statistical unfolded logic learning[C/OL]Proc of the 7th Asian Conf on Machine Learning.JMLR,2015:349-361.[2018-11-01].http:proceedings.mlr.press/
[57]Fierens D,Van den Broeck G,Rekens J,et al.Inference and learning in probabilistic logic programs using weighted Boolean formulas[J].Theory and Practice of Logic Programming,2015,15(3):358-401
[58]Bellodi E,Riguzzi F.Structure learning of probabilistic logic programs by searching the clause space[J].Theory and Practice of Logic Programming,2015,15(2):169-212
[59]De Maeyer D,Renkens J,Cloots L,et al.PheNetic:Network-based interpretation of unstructured gene lists in E.coli.[J].Molicular BioSystems,2013,9(7):1594-1603
[60]Wang W Y,Kong L,Mazaitis K,et al.Dependency parsing for weibo:An efficient probabilistic logic programming approach[C]Proc of 2014 EMNLP.Stroudsburg PA:ACL,2014:25-29
[61]Skarlatidis A,Artikis A,Filippou J,et al.A probabilistic logic programming event calculus[J].Theory and Practice of Logic Programming,2015,15(2):213-245
[62]Catherine R,Cohen W.Personalized recommendations using knowledge graphs:A probabilistic logic programming approach[C]Proc of the 10th ACM Conf on Recommender Systems.New York:ACM,2016:325-332
[63]Antanas L,Dries A,Moreno P,et al.Relational affordance learning for task-dependent robot grasping[C]Proc of the27th Int Conf on ILP.Berlin:Springer,2017:1-15
[64]C8rte-Real J,Dutra I,Rocha R.On applying probabilistic logic programming to breast cancer data[C]Proc of the27th Int Conf on ILP.Berlin:Springer,2017:31-45
[65]Rocktschel T,Riedel S.End-to-end differentiable proving[C]Advances in Neural Information Processing Systems30.Red Hook,NY:Curran Associates,Inc.,2017:3791-3803
[66]Evans R,Grefenstette E.Learning explanatory rules from noisy data[J].Journal of Artificial Intelligence Research,2018,61:1-64
[67]Idestam-Almquist P.Learning missing clauses by inverse resolution[C]Proc of the 5th Int Conf on Generation Computer Systems.Ohmsha:IOS Press,1992:610-617
[68]Kramer S,LavracˇN,Flach P.Propositionalisation approaches to relational data mining[G]Relational Data Mining.Berlin:Springer,2001:262-291
[69]Kramer S,Pfahringer B,Helma C.Stochastic propositionalisation of non-determinate background knowledge[C]Proc of the 8th Int Conf on ILP.Berlin:Springer,1998:80-94
[70]Flach P,Lachiche N.1BC:A first-order Bayesian classifier[C]Proc of the 9th Workshop on ILP.Berlin,Heidelberg:Slovenia,1999:92-103
[71]Robinson J A.A machine-oriented logic based on the resolution principle[J].Journal of the ACM,1965,12(1):23-41
[72]Popplestone R J.An experiment in automatic induction[C]Proc of the 5th Annual Machine Intelligence Workshop.Edinburgh,UK:Edinburgh University Press,1969:203-215
[73]Kearns M,Li Ming,Pitt L,et al.On the learnability of Boolean formulae[C]Proc of the 9th Annual ACM Symp on Theory of Computing.New York:ACM,1987:285-295
[74]Page C D,Frisch A.Generalization and learnability:A study of constrained atoms[C]Proc of the 2nd Int Workshop on ILP.Amsterdam:Academic Press,1992:29-61
[75]Cohen W,Page C D.Polynomial learnability and inductive logic programming:Methods and results[J].New Generation Computing,1995,13(3/4):369-409
[76]Kakas A C,Flach P A.Abduction and induction in artificial intelligence[J].Journal of Applied Logic,2009,7(3):251-251
[77]Lloyd J W.Logic for Learning[M].Berlin:Springer,2003
[78]Cropper A,Muggleton S H.Logical minimization of metarules within meta-interpretive learning[C]Proc of the 24th Int Conf on ILP.Berlin:Springer,2015:65-78
[79]Cropper A,Muggleton S H.Learning efficient logic programs[J/OL].Machine Learning,2018[2018-11-09].https:doi.org/10.1007/s10994-018-5712-6
[80]Nilsson N J.Probabilistic logic[J].Artificial Intelligence,1986,28(1):71-87
[81]Becker B,Drechsler R.Binary Decision Diagrams:Theory and Implementation[M].Berlin:Springer,1998
[82]Dries A,Kimmig A,Meert W,et al.ProbLog2:Probabilistic logic programming[C]Proc of 2015 ECMLPKDD.Berlin:Springer,2015:312-315
[83]Darwiche A.A compiler for deterministic,decomposable negation normal form[C]Proc of AAAI-02.Menlo Park,CA:AAAI,2002:627-634
[84]De Raedt L,Kimmig A.Probabilistic(logic)programming concepts[J].Machine Learning,2015,100(1):5-47
[85]Richards B L,Mooney R J.Learning relations by pathfinding[C]Proc of AAAI-92.Menlo Park,CA:AAAI,1992:50-55
[86]Zhou Zhihua,Chen Zhaoqian.Hybrid decision tree[J].Knowledge-Based Systems,2002,15(8):515-528
[87]Towell G,Shavlik J W.Knowledge based artificial neural networks[J].Artificial Intelligence,1994,70(1):119-165
[88]Tamaddoni-Nezhad A,Chaleil R,Kakas A,et al.Application of abductive ILP to learning metabolic network inhibition from temporal data[J].Machine Learning,2006,64(1/2/3):209-230
[89]Getoor L,Taskar B,(editors).Introduction to Statistical Relational Learning[M].Cambridge,MA:MIT Press,2007
[90]Richardson M,Domingos P.Markov logic networks[J].Machine Learning,2006,62(1/2):107-136
[91]Bohan D A,Caron-Lormier G,Muggleton S H,et al.Automated discovery of food webs from ecological data using logic-based machine learning[J].PloS ONE,2011,6(12):e29028
[92]Muggleton S H,Dai Wangzhou,Sammut C,et al.Metainterpretive learning from noisy images[J].Machine Learning,2018,107(7):1097-1118
[93]Dai Wangzhou,Muggleton S H,Zhou Zhihua.Logical vision:Meta-interpretive learning for simple geometrical concepts[C/OL]Late Breaking Papers of the 25th Int Conf on ILP.CEUR-W S.org,2015:1-16.[2018-11-09].http:ceur-ws.org/Vol-1636/
[94]Lin D,Dechter E,Ellis K,et al.Bias reformulation for one-shot function induction[C]Proc of the 23rd ECAI.Ohmsha:IOS Press,2014:525-530
[95]Zhou Zhihua.Learnware:On the future of machine learning[J].Frontiers of Computer Science,2016,10(4):589-590
[96]Princeton University.About WordNet[OL].2010[2018-11-09].https:wordnet.princeton.edu/
[97]Russell S J.Unifying logic and probability[J].Communications of the ACM,2015,58(7):88-97
[98]Nishiyama H,Ohwada H.Parallel inductive logic programming system for superlinear speedup[C]Proc of the 27th Int Conf on ILP.Berlin:Springer,2017:112-123
[99]Alchourròn C E,Grdenfors P,Makinson D.On the logic of theory change:Partial meet contraction and revision functions[J].The Journal of Symbolic Logic,1985,50(2):510-530
[100]Dai Wangzhou,Xu Qiuling,Yu Yang,et al.Tunneling neural perception and logic reasoning through abductive learning[J].arXiv preprint,2018,abs/1802.01173
[101]Dai Wangzhou,Zhou Zhihua.Combining logical abduction and statistical induction:Discovering written primitives with human knowledge[C]Proc of AAAI-17.Menlo Park,CA:AAAI,2017:4392-4398
[102]Socher R,Chen Danqi,Manning C D,et al.Reasoning with neural tensor networks for knowledge base completion[C]Advances in Neural Information Processing Systems 26.Red Hook,NY:Curran Associates,Inc,2013:926-934
[103]Cohen W.Tensorlog:A differentiable deductive database[J].arXiv preprint,2016,abs/1605.06523,2016