Towards Algorithmic Cut-Introduction
From MaRDI portal
Recommendations
- Algorithmic introduction of quantified cuts
- Towards an algorithmic construction of cut-elimination procedures
- Cutwidth: obstructions and algorithmic aspects
- Cutwidth: obstructions and algorithmic aspects
- Algorithms for Multiterminal Cuts
- Approximation algorithms for feasible cut and multicut problems
- SOFSEM 2006: Theory and Practice of Computer Science
- Computational approaches to MAX-cut
- scientific article; zbMATH DE number 7759280
- scientific article; zbMATH DE number 140138
Cited in
(22)- The problem of \(\Pi_{2}\)-cut-introduction
- On the compressibility of finite languages and formal proofs
- Herbrand's theorem as higher order recursion
- On the cover complexity of finite languages
- Inductive theorem proving based on tree grammars
- Proof mining with dependent types
- On the generation of quantified lemmas
- System description: GAPT 2.0
- Project presentation: algorithmic structuring and compression of proofs (ASCOP)
- Atomic cut introduction by resolution: proof structuring and compression
- Implementation and evaluation of contextual natural deduction for minimal logic
- Introducing quantified cuts in logic with equality
- scientific article; zbMATH DE number 7447752 (Why is no real title available?)
- Contextual Natural Deduction
- Algorithmic introduction of quantified cuts
- scientific article; zbMATH DE number 1066875 (Why is no real title available?)
- scientific article; zbMATH DE number 1088197 (Why is no real title available?)
- On the Herbrand content of LK
- Compressibility of Finite Languages by Grammars
- Analogy in automated deduction: a survey
- Lemmas: generation, selection, application
- A generic deskolemization strategy
This page was built for publication: Towards Algorithmic Cut-Introduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891453)
