Abstract
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only branching rule is the cut. Such sequent system is invertible, leading to the KE-tableau decision method. We study the structure of such proofs, proving the existence of a normal form for them in the form of a comb-tree proof. We then concentrate on the problem of efficiently computing non-analytic cuts. For that, we study the generalisation of techniques present in many modern theorem provers, namely the techniques of conflict-driven formula learning.
| Original language | English |
|---|---|
| Pages (from-to) | 553-575 |
| Number of pages | 23 |
| Journal | Logic Journal of the IGPL |
| Volume | 15 |
| Issue number | 5-6 SPEC. ISS. |
| State | Published - 2007 |
| Externally published | Yes |
Bibliographical note
Funding Information:Marcelo Finger is partly supported by CNPq grant PQ 301294/2004-6 and FAPESP project 04/14107-2.
Funding
Marcelo Finger is partly supported by CNPq grant PQ 301294/2004-6 and FAPESP project 04/14107-2.
| Funders | Funder number |
|---|---|
| Fundação de Amparo à Pesquisa do Estado de São Paulo | 04/14107-2 |
| Conselho Nacional de Desenvolvimento Científico e Tecnológico | PQ 301294/2004-6 |
Keywords
- Non-analytic cuts
- Proof Theory
- Sequent calculus
- Tableaux