Modular redundancy for theorem proving

DOI10.1007/10720084_13MaRDI QIDQ4518870zbMATH OpenFDO

Authors Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio

Publication date 3 December 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10720084_13

zbMATH Keywords

redundancy elimination techniques

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 1765692
• Theorem Proving Modulo Based on Boolean Equational Procedures
• On the completeness of modular proof systems
• Paramodulation-based theorem proving
• Reductions for non-clausal theorem proving
• Embedding Deduction Modulo into a Prover
• scientific article; zbMATH DE number 4018413
• Equational theorem proving modulo
• On the Modularization Theorem for logical specifications
• Termination of theorem proving by reuse

Cited in

(8)

• Embedding Deduction Modulo into a Prover
• scientific article; zbMATH DE number 4047193 (Why is no real title available?)
• scientific article; zbMATH DE number 1765692 (Why is no real title available?)
• scientific article; zbMATH DE number 1765706 (Why is no real title available?)
• From search to computation: redundancy criteria and simplification at work
• Automated Reasoning with Analytic Tableaux and Related Methods
• A comprehensive framework for saturation theorem proving
• Proof optimization for partial redundancy elimination

This page was built for publication: Modular redundancy for theorem proving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518870)