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 Δ.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
