From cut-free calculi to automated deduction: the case of bounded contraction

Ciabattoni, AgataLellmann, BjornVega, Carlos Alberto OlartePimentel, Elaine Gouvea2020-07-302020-07-302017CIABATTONI, Agata; LELLMANN, Björn; OLARTE, Carlos; PIMENTEL, Elaine. From Cut-free Calculi to Automated Deduction: the case of bounded contraction. Electronic Notes in Theoretical Computer Science, [S.L.], v. 332, p. 75-93, jun. 2017. Disponível em: https://www.researchgate.net/publication/317825238_From_Cut-free_Calculi_to_Automated_Deduction_The_Case_of_Bounded_Contraction. Acesso em: 29 jul. 2020. http://dx.doi.org/10.1016/j.entcs.2017.04.006.1571-0661https://repositorio.ufrn.br/jspui/handle/123456789/29757Proof theorySubstructural logicsProof searchBounded contractionFrom cut-free calculi to automated deduction: the case of bounded contractionarticle10.1016/j.entcs.2017.04.006.