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

Authors:
Tatjana Lutovac
Affiliations:
University of Belgrade, Belgrade, Serbia
Venue:
Proceedings of the Fifth Balkan Conference in Informatics
Year:
2012

Citing 7
Cited 0

Linear logic

Theoretical Computer Science
Logic programming with sequent systems: a linear logic approach

Proceedings of the international workshop on Extensions of logic programming
System Description: Twelf - A Meta-Logical Framework for Deductive Systems

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Structural Cut Elimination

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Detecting Loops During Proof Search in Propositional Affine Logic

Journal of Logic and Computation
Using Abduction to Compute Efficient Proofs

Electronic Notes in Theoretical Computer Science (ENTCS)
Focusing and polarization in linear, intuitionistic, and classical logics

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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 D (in one-sided propositional linear logic) into a complete proof which retains the order of sequent rules of D and whose conclusion contains the conclusion of D. An algorithm is developed which replaces each non-axiom leaf ⊢ Δ with a proof of ⊢ Δ, F where F is formula dependent on Δ.