A. Albarghouthi, P. Koutris, M. Naik, and C. Smith, Constraint-based synthesis of datalog programs, Principles and Practice of Constraint Programming -23rd International Conference, vol.10416, pp.689-706, 2017.

F. Baader, I. Horrocks, C. Lutz, and U. Sattler, An Introduction to Description Logic, 2017.

J. L. Balcázar, Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules, Logical Methods in Computer Science, vol.6, issue.2, 2010.

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

W. Buntine, Generalized subsumption and its applications to induction and redundancy, Artificial Intelligence, vol.36, issue.2, pp.149-176, 1988.

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. Charalambidis, K. Handjopoulos, P. Rondogiannis, and W. W. Wadge, Extensional Higher-Order Logic Programming, ACM Transactions on Computational Logic, vol.14, issue.3, pp.1-40, 2013.

A. Cropper, Efficiently learning efficient programs, 2017.

A. Cropper and S. H. Muggleton, Inductive Logic Programming -24th International Conference, ILP 2014, Revised Selected Papers, Lecture Notes in Computer Science, vol.9046, pp.62-75, 2014.

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. Tourret, Derivation reduction of metarules in meta-interpretive learning, Inductive Logic Programming -28th International Conference, 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.

G. A. Dirac, Some Theorems on Abstract Graphs, Proceedings of the London Mathematical Society, vol.s3-2, issue.1, pp.69-81, 1952.

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

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

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

E. Grädel, The expressive power of second order Horn logic, STACS 91, pp.466-477

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, Lecture Notes in Computer Science, vol.7797, pp.169-193, 2013.

P. Hohenecker and T. Lukasiewicz, Ontology Reasoning with Deep Neural Networks, Journal of Artificial Intelligence Research, vol.68, 2020.

G. P. Huet, IJCAI-83: International joint conference on artificial intelligence, Artificial Intelligence, vol.18, issue.2, p.268, 1982.

N. Immerman, Descriptive Complexity, 1999.

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.

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

M. Langlois, D. Mubayi, R. H. Sloan, and G. Turán, Combinatorial Problems for Horn Clauses, Graph Theory, Computational Intelligence and Thought, pp.54-65, 2009.

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.

J. Lloyd, Logic for Learning, 2003.

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.

S. Muggleton, Inductive logic programming, New Generation Computing, vol.8, issue.4, pp.295-318, 1991.

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

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.

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. H. Nienhuys-cheng and R. D. Wolf, Foundations of Inductive Logic Programming, Foundations of Inductive Logic Programming, 1997.

G. Plotkin, Automatic Methods of Inductive Inference, 1971.

L. D. Raedt, Declarative modeling for machine learning and data mining, Algorithmic Learning Theory -23rd International Conference, ALT, Proceedings, p.12, 2012.

L. D. Raedt and M. Bruynooghe, Interactive concept-learning and constructive induction by analogy, Machine Learning, vol.8, pp.107-150, 1992.

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

T. Rocktäschel, S. Riedel, I. Guyon, U. Von-luxburg, S. Bengio et al., End-to-end differentiable proving, Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems, pp.3791-3803, 2017.

T. Sato, Equivalence-preserving first-order unfold/fold transformation systems, Theoretical Computer Science, vol.105, issue.1, pp.57-84, 1992.

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.

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, 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.