L. Amgoud and P. Besnard, Logical limits of abstract argumentation frameworks, Journal of Applied Non-Classical Logics, vol.28, issue.3, pp.229-267, 2013.
DOI : 10.1080/11663081.1997.10510900
URL : https://hal.archives-ouvertes.fr/hal-01124391

M. J. Beeson, Persuasion in practical argument using value-based argumentation frameworks, Foundations of Constructive Mathematics . Modern Surveys in Mathematics Journal of Logic and Computation, vol.13, issue.3, pp.429-448, 1984.

P. Besnard and A. Hunter, Elements of Argumentation, 2008.
DOI : 10.7551/mitpress/9780262026437.001.0001

P. Blackburn, M. De-rijke, and Y. Venema, Modal Logic, 2001.
DOI : 10.1017/CBO9781107050884
URL : https://hal.archives-ouvertes.fr/inria-00100502

M. Caminada and L. Amgoud, On the evaluation of argumentation formalisms, Artificial Intelligence, vol.171, issue.5-6, pp.5-6286, 2007.
DOI : 10.1016/j.artint.2007.02.003

P. M. Dung, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games, Artificial Intelligence, vol.77, issue.2, pp.321-357, 1995.
DOI : 10.1016/0004-3702(94)00041-X

E. Grégoire, B. Mazure, and C. Piette, Using local search to find MSSes and MUSes, European Journal of Operational Research, vol.199, issue.3, pp.640-646, 2009.
DOI : 10.1016/j.ejor.2007.06.066

W. A. Howard, The formulae-as-types notion of Construction, pp.479-490, 1980.

B. Nordström, K. Petersson, and J. M. Smith, Programming in Martin-Löf's Type Theory, an introduction, volume 7 of Monographs on Computer Science, 1990.

C. Paulin-mohring, W. , and B. , Synthesis of ML programs in the system Coq, Journal of Symbolic Computation, vol.15, issue.5-6, pp.607-640, 1993.
DOI : 10.1016/S0747-7171(06)80007-6

G. Simari and R. Loui, A mathematical treatment of defeasible reasoning and its implementation, Artificial Intelligence, vol.53, issue.2-3, pp.125-157, 1992.
DOI : 10.1016/0004-3702(92)90069-A

R. Statman, Intuitionistic propositional logic is polynomial-space complete, Theoretical Computer Science, vol.9, issue.1, pp.67-72, 1979.
DOI : 10.1016/0304-3975(79)90006-9

A. S. Troelstra and H. Schwichtenberg, Basic Proof Theory, volume 43 of Cambridge tracks in Theoretical Computer Science, 1996.