An approach to automated reparation of failed proof attempts in propositional linear logic sequent calculus

Abstract

In many application areas of automated reasoning it is not sufficient to show that a given assertion is true. A good reasoning system should include tools not only for the generation of proofs, but also for the analysis of and manipulations with unsuccessful proof attempts. This paper focuses on the development of automated techniques for the transformation of a finite, failed sequent proof attempt <i>D</i> (in one-sided propositional linear logic) into a complete proof which retains the order of sequent rules of <i>D</i> and whose conclusion contains the conclusion of <i>D</i>. An algorithm is developed which replaces each non-axiom leaf &#8866; &#916; with a proof of &#8866; &#916;, <i>F</i> where <i>F</i> is formula dependent on &#916;.

DOI: 10.1145/2371316.2371329

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@inproceedings{Lutovac2012AnAT, title={An approach to automated reparation of failed proof attempts in propositional linear logic sequent calculus}, author={Tatjana Lutovac}, booktitle={BCI}, year={2012} }