Fetching the paper…
Reading the bibliography…
Inductive logic programming (ILP) is a form of logic-based machine learning.
Chollet F (2019) On the measure of intelligence. CoRR abs/1911.01547
1911
Earlier work this paper cites.
Plotkin G (1971) Automatic methods of inductive inference. PhD thesis, Edinburgh University
1971
Earlier work this paper cites.
Wirth N (1985) Algorithms and data structures. Prentice Hall
1985
Earlier work this paper cites.
Muggleton S (1987) Duce, an oracle-based approach to constructive induction. In: Proceedings of the 10th International Joint Conference on Artificial Intelligence., Morgan Kaufmann, pp 287–292
1987
Earlier work this paper cites.
Michie D (1988) Machine learning in the next five years. In: Sleeman DH (ed) Proceedings of the Third European Working Session on Learning, EWSL 1988, Turing Institute, Pitman Publishing, pp 107–122
1988
Earlier work this paper cites.
Muggleton S, Buntine WL (1988) Machine invention of first order predicates by inverting resolution. In: Machine Learning, Proceedings of the Fifth International Conference on Machine Learning, Morgan Kaufmann, pp 339–352
1988
Earlier work this paper cites.
Muggleton S, Feng C (1990) Efficient induction of logic programs. In: Algorithmic Learning Theory, First International Workshop, ALT ’90, pp 368–381
1990
Earlier work this paper cites.
Quinlan JR (1990) Learning logical definitions from relations. Machine Learning 5:239–266
1990
Earlier work this paper cites.
Muggleton S (1991) Inductive logic programming. New Generation Computing 8(4):295–318
1991
Earlier work this paper cites.
Bain M, Muggleton S (1992) Non-monotonic learning. In: Inductive Logic Programming, Academic Press, pp 145–161
1992
Earlier work this paper cites.
Muggleton S, De Raedt L (1994) Inductive logic programming: Theory and methods. J Log Program 19/20:629–679
1994
Earlier work this paper cites.
Kramer S (1995) Predicate invention: A comprehensive view. Rapport technique OFAI-TR-95-32, Austrian Research Institute for Artificial Intelligence, Vienna
1995
Earlier work this paper cites.
McCreath E, Sharma A (1995) Extraction of meta-knowledge to restrict the hypothesis space for ilp systems. In: Eighth Australian Joint Conference on Artificial Intelligence, pp 75–82
1995
Earlier work this paper cites.
Muggleton S (1995) Inverse entailment and progol. New Generation Comput 13(3&4):245–286
1995
Earlier work this paper cites.
Sato T (1995) A statistical learning method for logic programs with distribution semantics. In: Sterling L (ed) Logic Programming, Proceedings of the Twelfth International Conference on Logic Programming, Tokyo, Japan, June 13-16, 1995, MIT Press, pp 715–729
1995
Earlier work this paper cites.
Stahl I (1995) The appropriateness of predicate invention as bias shift operation in ILP. Machine Learning 20(1-2):95–117
1995
Earlier work this paper cites.
Nienhuys-Cheng SH, Wolf Rd (1997) Foundations of Inductive Logic Programming. Springer-Verlag New York, Inc., Secaucus, NJ, USA
1997
Earlier work this paper cites.
Blockeel H, De Raedt L (1998) Top-down induction of first-order logical decision trees. Artif Intell 101(1-2):285–297
1998
Earlier work this paper cites.
Bratko I (1999) Refining complete hypotheses in ILP. In: Inductive Logic Programming, 9th International Workshop, ILP-99, Springer, Lecture Notes in Computer Science, vol 1634, pp 44–55
1999
Earlier work this paper cites.
Sato T, Kameya Y (2001) Parameter learning of logic programs for symbolic-statistical modeling. J Artif Intell Res 15:391–454, DOI 10.1613/jair.912, URL https://doi.org/10.1613/jair.912
2001
Earlier work this paper cites.
Srinivasan A (2001) The ALEPH manual. Machine Learning at the Computing Laboratory, Oxford University
2001
Earlier work this paper cites.
Srinivasan A, King RD, Bain M (2003) An empirical study of the use of relevance information in inductive logic programming. J Machine Learning Res 4:369–383
2003
Earlier work this paper cites.
Ferilli S, Esposito F, Basile TMA, Mauro ND (2004) Automatic induction of first-order logic descriptors type domains from observations. In: Inductive Logic Programming, 14th International Conference, ILP 2004, Springer, Lecture Notes in Computer Science, vol 3194, pp 116–131
2004
Earlier work this paper cites.
Richardson M, Domingos PM (2006) Markov logic networks. Machine Learning 62(1-2):107–136, DOI 10.1007/s10994-006-5833-1, URL https://doi.org/10.1007/s10994-006-5833-1
2006
Earlier work this paper cites.
De Raedt L, Kimmig A, Toivonen H (2007) Problog: A probabilistic prolog and its application in link discovery. In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007, pp 2462–2467
2007
Earlier work this paper cites.
Kok S, Domingos PM (2007) Statistical predicate invention. In: Machine Learning, Proceedings of the Twenty-Fourth International Conference (ICML 2007), ACM, ACM International Conference Proceeding Series, vol 227, pp 433–440
2007
Earlier work this paper cites.
2008
Earlier work this paper cites.
De Raedt L (2008) Logical and relational learning. Cognitive Technologies, Springer
2008
Earlier work this paper cites.
De Raedt L, Kersting K (2008) Probabilistic Inductive Logic Programming, Springer-Verlag, Berlin, Heidelberg, p 1–27
2008
Earlier work this paper cites.
Huynh TN, Mooney RJ (2008) Discriminative structure and parameter learning for markov logic networks. In: Proceedings of the 25th International Conference on Machine Learning, Association for Computing Machinery, New York, NY, USA, p 416?423, DOI 10.1145/1390156.1390209
2008
Earlier work this paper cites.
Leban G, Zabkar J, Bratko I (2008) An experiment in robot discovery with ILP. In: Inductive Logic Programming, 18th International Conference, ILP 2008, Springer, Lecture Notes in Computer Science, vol 5194, pp 77–90
2008
Earlier work this paper cites.
2009
Earlier work this paper cites.
Kok S, Domingos P (2009) Learning markov logic network structure via hypergraph lifting. In: Proceedings of the 26th International Conference on Machine Learning, Association for Computing Machinery, New York, NY, USA, p 505?512, DOI 10.1145/1553374.1553440
2009
Earlier work this paper cites.
Muggleton S, Paes A, Costa VS, Zaverucha G (2009) Chess revision: Acquiring the rules of chess variants through FOL theory revision from examples. In: Inductive Logic Programming, 19th International Conference, ILP 2009, Springer, Lecture Notes in Computer Science, vol 5989, pp 123–130
2009
Earlier work this paper cites.
Ray O (2009) Nonmonotonic abductive inductive learning. J Applied Logic 7(3):329–340
2009
Earlier work this paper cites.
Bohan DA, Caron-Lormier G, Muggleton S, Raybould A, Tamaddoni-Nezhad A (2011) Automated discovery of food webs from ecological data using logic-based machine learning. PLoS One 6(12):e29,028
2011
Earlier work this paper cites.
Corapi D, Russo A, Lupu E (2011) Inductive logic programming in answer set programming. In: Inductive Logic Programming - 21st International Conference, ILP 2011, Springer, Lecture Notes in Computer Science, vol 7207, pp 91–97
2011
Cited alongside, same era.
Gulwani S (2011) Automating string processing in spreadsheets using input-output examples. In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, ACM, pp 317–330
2011
Cited alongside, same era.
Järvisalo M, Le Berre D, Roussel O, Simon L (2012) The international sat solver competitions. Ai Magazine 33(1):89–92
2012
Cited alongside, same era.
Muggleton S, De Raedt L, Poole D, Bratko I, Flach PA, Inoue K, Srinivasan A (2012) ILP turns 20 - biography and future challenges. Machine Learning 86(1):3–23
2012
Cited alongside, same era.
Dumančić S, Blockeel H (2017) Clustering-based relational unsupervised representation learning with an explicit distributed representation. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, ijcai.org, pp 1631–1637
2017
Later among the works it cites.
Picado J, Termehchy A, Fern A, Pathak S (2017) Towards automatically setting language bias in relational learning. In: Proceedings of the 1st Workshop on Data Management for End-to-End Machine Learning, DEEM@SIGMOD 2017, ACM, pp 3:1–3:4
2017
Later among the works it cites.
Rocktäschel T, Riedel S (2017) End-to-end differentiable proving. In: Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 4-9 December 2017, pp 3788–3800
2017
Later among the works it cites.
Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser Ł, Polosukhin I (2017) Attention is all you need. In: Advances in neural information processing systems, pp 5998–6008
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ahlgren J, Yuen SY (2013) Efficient program synthesis using constraint satisfaction in inductive logic programming. J Machine Learning Res 14(1):3649–3682
2013
Cited alongside, same era.
Genesereth MR, Björnsson Y (2013) The international general game playing competition. AI Magazine 34(2):107–111
2013
Cited alongside, same era.
Inoue K, Doncescu A, Nabeshima H (2013) Completing causal networks by meta-level abduction. Machine Learning 91(2):239–277
2013
Cited alongside, same era.
Inoue K, Ribeiro T, Sakama C (2014) Learning from interpretation transition. Machine Learning 94(1):51–79
2014
Cited alongside, same era.
Law M, Russo A, Broda K (2014) Inductive learning of answer set programs. In: Logics in Artificial Intelligence - 14th European Conference, JELIA 2014, Springer, Lecture Notes in Computer Science, vol 8761, pp 311–325
2014
Cited alongside, same era.
Lin D, Dechter E, Ellis K, Tenenbaum JB, Muggleton S (2014) Bias reformulation for one-shot function induction. In: ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, IOS Press, Frontiers in Artificial Intelligence and Applications, vol 263, pp 525–530
2014
Cited alongside, same era.
Muggleton SH, Lin D, Pahlavi N, Tamaddoni-Nezhad A (2014) Meta-interpretive learning: application to grammatical inference. Machine Learning 94(1):25–49
2014
Cited alongside, same era.
Ribeiro T, Inoue K (2014) Learning prime implicant conditions from interpretation transition. In: Inductive Logic Programming - 24th International Conference, ILP 2014, Springer, Lecture Notes in Computer Science, vol 9046, pp 108–125
2014
Cited alongside, same era.
2017
Later among the works it cites.
Yang F, Yang Z, Cohen WW (2017) Differentiable learning of logical rules for knowledge base reasoning. In: NIPS 2017
2017
Later among the works it cites.
Bain M, Srinivasan A (2018) Identification of biological transition systems using meta-interpreted logic programs. Machine Learning 107(7):1171–1206
2018
Later among the works it cites.
Ellis K, Morales L, Sablé-Meyer M, Solar-Lezama A, Tenenbaum J (2018) Learning libraries of subroutines for neurally-guided bayesian program induction. In: NeurIPS 2018, pp 7816–7826
2018
Later among the works it cites.
Evans R, Grefenstette E (2018) Learning explanatory rules from noisy data. J Artif Intell Res 61:1–64
2018
Later among the works it cites.
Kaminski T, Eiter T, Inoue K (2018) Exploiting answer set programming with external sources for meta-interpretive learning. Theory Pract Log Program 18(3-4):571–588
2018
Later among the works it cites.
Law M (2018) Inductive learning of answer set programs. PhD thesis, Imperial College London, UK
2018
Later among the works it cites.
Law M, Russo A, Broda K (2018) The complexity and generality of learning answer set programs. Artif Intell 259:110–146
2018
Later among the works it cites.
Legras S, Rouveirol C, Ventos V (2018) The game of bridge: A challenge for ILP. In: Inductive Logic Programming - 28th International Conference, ILP 2018, Springer, Lecture Notes in Computer Science, vol 11105, pp 72–87
2018
Later among the works it cites.
Marcus G (2018) Deep learning: A critical appraisal. CoRR abs/1801.00631
2018
Later among the works it cites.
Schüller P, Benz M (2018) Best-effort inductive logic programming via fine-grained cost-based hypothesis generation - the inspire system at the inductive logic programming competition. Machine Learning 107(7):1141–1169
2018
Later among the works it cites.
Bartha S, Cheney J (2019) Towards meta-interpretive learning of programming language semantics. In: Inductive Logic Programming - 29th International Conference, ILP 2019, Springer, Lecture Notes in Computer Science, vol 11770, pp 16–25
2019
Later among the works it cites.
Cropper A (2019) Playgol: Learning programs through play. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, ijcai.org, pp 6074–6080
2019
Later among the works it cites.
Cropper A, Muggleton SH (2019) Learning efficient logic programs. Machine Learning 108(7):1063–1083
2019
Later among the works it cites.
Dong H, Mao J, Lin T, Wang C, Li L, Zhou D (2019) Neural logic machines. In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019, OpenReview.net, URL https://openreview.net/forum?id=B1xY-hRctX
2019
Later among the works it cites.
Dumančić S, Guns T, Meert W, Blockeel H (2019) Learning relational representations with auto-encoding logic programs. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, ijcai.org, pp 6081–6087
2019
Later among the works it cites.
Law M, Russo A, Bertino E, Broda K, Lobo J (2019) Representing and learning grammars in answer set programming. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, AAAI Press, pp 2919–2928
2019
Later among the works it cites.
Muggleton S, Hocquette C (2019) Machine discovery of comprehensible strategies for simple games using meta-interpretive learning. New Generation Computing 37:203–217
2019
Later among the works it cites.
Sivaraman A, Zhang T, den Broeck GV, Kim M (2019) Active inductive logic programming for code search. In: Proceedings of the 41st International Conference on Software Engineering, ICSE 2019, IEEE / ACM, pp 292–303
2019
Later among the works it cites.
Cropper A (2020) Forgetting to learn logic programs. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, AAAI Press, pp 3676–3683
2020
Later among the works it cites.
Cropper A, Tourret S (2020) Logical reduction of metarules. Machine Learning 109(7):1323–1369
2020
Later among the works it cites.
Cropper A, Dumančić S, Muggleton SH (2020a) Turning 30: New ideas in inductive logic programming. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, ijcai.org, pp 4833–4839
2020
Later among the works it cites.
Dumancic S, Guns T, Cropper A (2020) Knowledge refactoring for inductive program synthesis. AAAI
2020
Later among the works it cites.
Garcez Ad, Lamb LC (2020) Neurosymbolic ai: the 3rd wave. arXiv preprint arXiv:201205876
2020
Later among the works it cites.
Hocquette C, Muggleton SH (2020) Complete bottom-up predicate invention in meta-interpretive learning. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, ijcai.org, pp 2312–2318
2020
Later among the works it cites.
Kramer S (2020) A brief history of learning symbolic higher-level representations from data (and a curious look forward). In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, ijcai.org, pp 4868–4876
2020
Later among the works it cites.
Law M, Russo A, Bertino E, Broda K, Lobo J (2020a) Fastlas: Scalable inductive logic programming incorporating domain-specific optimisation criteria. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, AAAI Press, pp 2877–2885
2020
Later among the works it cites.
Ribeiro T, Folschette M, Magnin M, Inoue K (2020) Learning any semantics for dynamical systems represented by logic programs, working paper or preprint
2020
Later among the works it cites.
Dai WZ, Muggleton SH (2021) Abductive knowledge induction from raw data. In: Proceedings of the 35th Conference on Artificial Intelligence (IJCAI 2021), IJCAI, in Press
2021
Closest in time.
Evans R, Hernández-Orallo J, Welbl J, Kohli P, Sergot M (2021) Making sense of sensory input. Artificial Intelligence p 103438
2021
Closest in time.
Patsantzis S, Muggleton S (2021) Top program construction and reduction for polynomial time meta-interpretive learning. Machine Learning 110:755–778
2021
Closest in time.
Picado J, Termehchy A, Fern A, Pathak S, Ilango P, Davis J (2021) Scalable and usable relational learning with automatic language bias. In: Li G, Li Z, Idreos S, Srivastava D (eds) SIGMOD ’21: International Conference on Management of Data, Virtual Event, China, June 20-25, 2021, ACM, pp 1440–1451, DOI 10.1145/3448016.3457275, URL https://doi.org/10.1145/3448016.3457275
2021
Closest in time.
Cropper A, Dumančić S (2020) Learning large logic programs by going beyond entailment. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, ijcai.org, pp 2073–2079
2079
Closest in time.