Towards the Compression of First-Order Resolution Proofs by Lowering Unit Clauses

DOI10.1007/978-3-319-21401-6_24zbMath1465.68283OpenAlexW1438958698MaRDI QIDQ3454106

Jan Gorzny, Bruno Woltzenlogel Paleo

Publication date: 2 December 2015

Published in: Automated Deduction - CADE-25 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21401-6_24

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (2)

Implementation and Evaluation of Contextual Natural Deduction for Minimal Logic ⋮ Contradiction separation based dynamic multi-clause synergized automated deduction

Uses Software

• TPTP
• Skeptik

Cites Work

• Algorithmic introduction of quantified cuts
• Logic for programming, artificial intelligence, and reasoning. 16th international conference, LPAR-16, Dakar, Senegal, April 25 -- May 1, 2010. Revised selected papers
• The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
• Compression of Propositional Resolution Proofs by Lowering Subproofs
• Automated Proof Compression by Invention of New Definitions
• Atomic Cut Introduction by Resolution: Proof Structuring and Compression
• Compression of Propositional Resolution Proofs via Partial Regularization
• An Efficient and Flexible Approach to Resolution Proof Reduction
• Herbrand Sequent Extraction

This page was built for publication: Towards the Compression of First-Order Resolution Proofs by Lowering Unit Clauses