C. Barrett, C. L. Conway, M. Deters, L. Hadarean, D. Jovanovi? et al., Proceedings of the 23 rd International Conference on Computer Aided Verification (CAV '11), vol.6806, pp.171-177, 2011.

C. Barrett, A. Stump, and C. Tinelli, The Satisfiability Modulo Theories Library (SMT-LIB). www.SMT-LIB.org, 2010.

M. Bienvenu, Prime implicates and prime implicants in modal logic, Proceedings of the National Conference on Artificial Intelligence, vol.22, p.379, 1999.

P. Blackburn, J. Van-benthem, and F. Wolter, Handbook of Modal Logic. Studies in logic and practical reasoning -ISSN 1570-2464, vol.3, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00120237

J. D. Kleer, An improved incremental algorithm for generating prime implicates, Proceedings of the National Conference on Artificial Intelligence, pp.780-780, 1992.

L. M. De-moura and N. Bjørner, Z3: An Efficient SMT Solver, LNCS, vol.4963, pp.337-340

. Springer, , 2008.

I. Dillig, T. Dillig, K. L. Mcmillan, and A. Aiken, Minimum Satisfying Assignments for SMT, Computer Aided Verification, number 7358 in Lecture Notes in Computer Science, pp.394-409, 2012.

M. Echenim and N. Peltier, A Superposition Calculus for Abductive Reasoning, Journal of Automated Reasoning, vol.57, issue.2, pp.97-134, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01363997

M. Echenim, N. Peltier, and S. Tourret, An approach to abductive reasoning in equational logic, Proceedings of IJCAI'13 (International Conference on Artificial Intelligence), pp.3-9, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00934278

M. Echenim, N. Peltier, and S. Tourret, A Rewriting Strategy to Generate Prime Implicates in Equational Logic, Proceedings of the International Joint Conference on Automated Reasoning (IJCAR'14, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01018692

M. Echenim, N. Peltier, and S. Tourret, Quantifier-free equational logic and prime implicate generation, Automated Deduction -CADE-25 -25th International Conference on Automated Deduction, vol.9195, pp.311-325, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01363987

M. Echenim, N. Peltier, and S. Tourret, Prime Implicate Generation in Equational Logic, Journal of Artificial Intelligence Research, vol.60, pp.827-880, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01946538

N. Eén and N. Sörensson, An extensible sat-solver, Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003, vol.2919, pp.502-518, 2003.

E. Fredkin, Trie memory, Commun. ACM, vol.3, issue.9, pp.490-499, 1960.

P. Jackson, Computing prime implicates incrementally, Proceedings of the 11th International Conference on Automated Deduction, pp.253-267, 1992.

A. Kean and G. Tsiknis, An incremental method for generating prime implicants/implicates, Journal of Symbolic Computation, vol.9, issue.2, pp.185-206, 1990.

E. Knill, P. T. Cox, and T. Pietrzykowski, Equality and abductive residua for Horn clauses, Theoretical Computer Science, vol.120, issue.1, pp.1-44, 1993.

P. Marquis, Extending abduction from propositional to first-order logic, Fundamentals of artificial intelligence research, pp.141-155, 1991.

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

A. Matusiewicz, N. Murray, and E. Rosenthal, Prime implicate tries. Automated Reasoning with Analytic Tableaux and Related Methods, pp.250-264, 2009.

A. Matusiewicz, N. Murray, and E. Rosenthal, Tri-based set operations and selective computation of prime implicates. Foundations of Intelligent Systems, pp.203-213, 2011.

M. C. Mayer and F. Pirri, First order abduction via tableau and sequent calculi, Logic Journal of the IGPL, vol.1, issue.1, pp.99-117, 1993.

A. Mishchenko, An introduction to zero-suppressed binary decision diagrams, Proceedings of the 12th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, 2001.

H. Nabeshima, K. Iwanuma, K. Inoue, and O. Ray, SOLAR: An automated deduction system for consequence finding, AI Commun, vol.23, issue.2, pp.183-203, 2010.

A. Previti, A. Ignatiev, A. Morgado, and J. Marques-silva, Prime compilation of non-clausal formulae, Proceedings of the 24th International Conference on Artificial Intelligence, pp.1980-1987, 2015.

W. Quine, A way to simplify truth functions, The American Mathematical Monthly, vol.62, issue.9, pp.627-631, 1955.

A. Riazanov and A. Voronkov, Vampire 1.1 (system description), Proceedings of the International Joint Conference on Automated Reasoning (IJCAR'01), pp.376-380, 2001.

S. Schulz, System Description: E 1.8, Proc. of the 19th LPAR, vol.8312, 2013.

L. Simon and A. Val, Efficient consequence finding, Proceedings of the 17th International Joint Conference on Artificial Intelligence, pp.359-370, 2001.

P. Tison, Generalization of consensus theory and application to the minimization of boolean functions. Electronic Computers, IEEE Transactions on, vol.4, pp.446-456, 1967.

C. Weidenbach, B. Afshordel, U. Brahm, C. Cohrs, T. Engel et al., System description: SPASS version 1.0.0, Proceedings of the 16th Conference on Automated Deduction (CADE-16), pp.378-382, 2001.