A. Albarghouthi, P. Koutris, M. Naik, and C. Smith, Constraint-Based Synthesis of Datalog Programs, Lecture Notes in Computer Science, vol.10416, pp.689-706, 2017.

M. Bienvenu, Prime Implicates and Prime Implicants: From Propositional to Modal Logic, Journal of Artificial Intelligence Research, vol.36, pp.71-128, 2009.

A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Occam's Razor, Information Processing Letters, vol.24, issue.6, pp.377-380, 1987.

A. R. Bradley and Z. Manna, The calculus of computation-decision procedures with applications to verification, 2007.

A. Campero, A. Pareja, T. Klinger, J. Tenenbaum, and S. Riedel, Probabilistic Analysis Using Theorem Proving, Formalized Probability Theory and Applications Using Theorem Proving, pp.21-28

A. Church, A note on the Entscheidungsproblem, Journal of Symbolic Logic, vol.1, issue.1, pp.40-41, 1936.

W. W. Cohen, Grammatically biased learning: Learning logic programs using an explicit antecedent description language, Artificial Intelligence, vol.68, issue.2, pp.303-366, 1994.

A. Cropper, R. Evans, and M. Law, Inductive general game playing, Machine Learning, vol.109, issue.7, pp.1393-1434, 2019.

A. Cropper and S. H. Muggleton, Logical Minimisation of Meta-Rules Within Meta-Interpretive Learning, Inductive Logic Programming, vol.9046, pp.62-75, 2015.

A. Cropper and S. H. Muggleton, Learning efficient logical robot strategies involving composable objects, Proceedings of the twenty-fourth international joint conference on artificial intelligence, pp.3423-3429, 2015.

A. Cropper, R. Morel, and S. H. Muggleton, Learning Higher-Order Programs through Predicate Invention, Proceedings of the AAAI Conference on Artificial Intelligence, vol.34, issue.09, pp.13655-13658, 2020.

A. Cropper and S. H. Muggleton, Metagol system, 2016.

A. Cropper and S. H. Muggleton, Learning efficient logic programs, Machine Learning, vol.108, issue.7, pp.1063-1083, 2018.

A. Cropper, A. Tamaddoni-nezhad, and S. H. Muggleton, Meta-Interpretive Learning of Data Transformation Programs, Inductive Logic Programming, vol.9575, pp.46-59, 2016.

A. Cropper and S. Tourret, Derivation Reduction of Metarules in Meta-interpretive Learning, Inductive Logic Programming, vol.11105, pp.1-21, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02988024

E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov, Complexity and expressive power of logic programming, ACM Computing Surveys, vol.33, issue.3, pp.374-425, 2001.

L. De-raedt, Algorithmic Learning Theory, Algorithmic learning theory-23rd international conference, ALT 2012, p.12, 2012.

L. De-raedt and M. Bruynooghe, Interactive concept-learning and constructive induction by analogy, Machine Learning, vol.8, issue.2, pp.107-150, 1992.

M. Echenim, N. Peltier, and S. Tourret, Quantifier-Free Equational Logic and Prime Implicate Generation, Automated Deduction - CADE-25, vol.9195, pp.311-325, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01363987

W. Emde, C. Habel, and C. Rollinger, Contents ? Volume 20 1983, Artificial Intelligence, vol.20, issue.4, pp.457-458, 1983.

R. Evans and E. Grefenstette, Learning Explanatory Rules from Noisy Data, Journal of Artificial Intelligence Research, vol.61, pp.1-64, 2018.

P. Flener, Inductive Logic Programming, Inductive logic programming, 6th international workshop, ILP-96, vol.1314, pp.175-198, 1997.

N. A. Fonseca, V. S. Costa, F. M. Silva, and R. Camacho, On Avoiding Redundancy in Inductive Logic Programming, Inductive Logic Programming, vol.3194, pp.132-146, 2004.

J. Fürnkranz, Dimensionality reduction in ILP: A call to arms, Proceedings of the IJCAI-97 workshop on frontiers of inductive logic programming, pp.81-86, 1997.

M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, 1979.

M. R. Genesereth and Y. Björnsson, The International General Game Playing Competition, AI Magazine, vol.34, issue.2, p.107, 2013.

G. Gottlob and C. G. Fermüller, Removing redundancy from a clause, Artificial Intelligence, vol.61, issue.2, pp.263-289, 1993.

G. Gottlob, N. Leone, and F. Scarcello, Inductive Logic Programming, Inductive logic programming, 7th international workshop, ILP-97, vol.1297, pp.17-32, 1997.

E. Hemaspaandra and H. Schnoor, IJCAI-83: International joint conference on artificial intelligence, Artificial Intelligence, vol.18, issue.2, p.268, 1982.

M. Heule, M. Järvisalo, F. Lonsing, M. Seidl, and A. Biere, Clause Elimination for SAT and QSAT, Journal of Artificial Intelligence Research, vol.53, pp.127-168, 2015.

T. Hillenbrand, R. Piskac, U. Waldmann, and C. Weidenbach, From Search to Computation: Redundancy Criteria and Simplification at Work, Programming Logics, vol.7797, pp.169-193, 2013.

W. H. Joyner, Resolution Strategies as Decision Procedures, Journal of the ACM, vol.23, issue.3, pp.398-417, 1976.

T. Kaminski, T. Eiter, and K. Inoue, Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning, Theory and Practice of Logic Programming, vol.18, issue.3-4, pp.571-588, 2018.

J. Kietz and M. Lübbe, An Efficient Subsumption Algorithm for Inductive Logic Programming, Machine Learning Proceedings 1994, pp.130-138, 1994.

R. A. Kowalski, Logic Programming, Computational Logic, pp.523-569, 2014.

J. Larson and R. S. Michalski, Inductive inference of VL decision rules, ACM SIGART Bulletin, vol.63, issue.63, pp.38-44, 1977.

P. Liberatore, Redundancy in logic I: CNF propositional formulae, Artificial Intelligence, vol.163, issue.2, pp.203-232, 2005.

P. Liberatore, Redundancy in logic II: 2CNF and Horn propositional formulae, Artificial Intelligence, vol.172, issue.2-3, pp.265-299, 2008.

D. Lin, E. Dechter, K. Ellis, J. B. Tenenbaum, and S. Muggleton, Rules on the Web. From Theory to Applications, ECAI 2014-21st European conference on artificial intelligence, pp.525-530, 2014.

J. W. Lloyd, Programs, Foundations of Logic Programming, pp.107-140, 1987.

J. W. Lloyd, Logic for learning, 2003.

J. Marcinkowski and L. Pacholski, Undecidability of the Horn-clause implication problem, 33rd annual symposium on foundations of computer science, pp.354-362, 1992.

P. Marquis, Consequence Finding Algorithms, Handbook of Defeasible Reasoning and Uncertainty Management Systems, pp.41-145, 2000.

J. Mccarthy, Making robots conscious of their mental states, Machine intelligence 15, intelligent Agents, pp.3-17, 1995.

R. Morel, A. Cropper, C. Ong, and . Luke, Typed meta-interpretive learning of logic programs, Logics in artificial intelligence-16th European conference, vol.11468, pp.198-213, 2019.

S. Muggleton, Inverse entailment and Progol, New Generation Computing, vol.13, issue.3&4, pp.245-286, 1995.

S. Muggleton, L. De-raedt, D. Poole, I. Bratko, P. A. Flach et al., ILP turns 20, Machine Learning, vol.86, issue.1, pp.3-23, 2011.

S. Muggleton and C. Feng, Efficient induction of logic programs, Algorithmic learning theory, first international workshop, ALT '90, pp.368-381, 1990.

S. H. Muggleton, D. Lin, N. Pahlavi, and A. Tamaddoni-nezhad, Meta-interpretive learning: application to grammatical inference, Machine Learning, vol.94, issue.1, pp.25-49, 2013.

S. H. Muggleton, D. Lin, and A. Tamaddoni-nezhad, Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited, Machine Learning, vol.100, issue.1, pp.49-73, 2015.

C. Nédellec, C. Rouveirol, H. Adé, F. Bergadano, and B. Tausend, Declarative bias in ILP, Advances in inductive logic programming, vol.32, pp.82-103, 1996.

S. Nienhuys-cheng and R. Wolf, Foundations of Inductive Logic Programming, 1997.

G. D. Plotkin, Automatic methods of inductive inference, 1971.

J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM, vol.12, issue.1, pp.23-41, 1965.

M. Schmidt-schauß, Implication of clauses is undecidable, Theoretical Computer Science, vol.59, issue.3, pp.287-296, 1988.

E. Y. Shapiro, Algorithmic Program Debugging, 2004.

X. Si, W. Lee, R. Zhang, A. Albarghouthi, P. Koutris et al., Syntax-guided synthesis of Datalog programs, Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering - ESEC/FSE 2018, pp.515-527, 2018.

D. Skillicorn, Matrix decompositions, Understanding Complex Datasets, pp.23-47, 2007.

S. Å. Tärnlund, Horn clause computability, BIT, vol.17, issue.2, pp.215-226, 1977.

S. Tourret and A. Cropper, SLD-Resolution Reduction of Second-Order Horn Fragments, Logics in Artificial Intelligence, vol.11468, pp.259-276, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02988015

W. Y. Wang, K. Mazaitis, and W. W. Cohen, Structure Learning via Parameter Learning, Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management - CIKM '14, pp.1199-1208, 2014.

C. Weidenbach and P. Wischnewski, Subterm contextual rewriting, AI Communications, vol.23, issue.2-3, pp.97-109, 2010.

, Jurisdictional immunity of foreign States with regard to claims relating to infringements of obligations under peremptory norms