Proof simplification for model generation and its applications

Authors:
Miyuki Koshimura;Ryuzo Hasegawa
Affiliations:
Graduate School of Information Science and Electrical Engineering, Kyushu University, Kasuga, Fukuoka, Japan;Graduate School of Information Science and Electrical Engineering, Kyushu University, Kasuga, Fukuoka, Japan
Venue:
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Year:
2000

Citing 16
Cited 2

HARP: a tableau-based theorem prover

Journal of Automated Reasoning
The TPTP Problem Library

Journal of Automated Reasoning
Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Proceedings of the 14th International Conference on Automated Deduction

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Hyper Tableaux

JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Portable and Efficient Implementation of KL1

PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Tableau Calculus for Minimal Model Reasoning

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
SATCHMO: A Theorem Prover Implemented in Prolog

Proceedings of the 9th International Conference on Automated Deduction
Caching and Lemmaizing in Model Elimination Theorem Provers

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Embedding Negation as Failure into a Model Generation Theorem Prover

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Lemma Matching for a PTTP-based Top-down Theorem Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
The complexity of automated reasoning

The complexity of automated reasoning

Model Generation with Boolean Constraints

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A Model Generation Based Theorem Prover MGTP for First-Order Logic

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proof simplification eliminates unnecessary parts from a proof leaving only essential parts in a simplified proof. This paper gives a proof simplification procedure for model generation theorem proving and its applications to proof condensation, folding-up and completeness proofs for non-Horn magic sets. These indicate that proof simplification plays a useful role in theorem proving.