Full First-Order Free Variable Sequents and Tableaux in Implicit Induction

Authors:
Claus-Peter Wirth
Affiliations:
-
Venue:
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Year:
1999

Citing 8
Cited 1

First-order logic and automated theorem proving (2nd ed.)

First-order logic and automated theorem proving (2nd ed.)
Inductive theorem proving for design specifications

Journal of Symbolic Computation
Computing answers with model elimination

Artificial Intelligence
Lean Induction Principles for Tableaux

TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Full First-Order Sequent and Tableau Calculi with Preservation of Solutions and the Liberalized delta-Rule but without Skolemization

Selected Papers from Automated Deduction in Classical and Non-Classical Logics
On Notions of Inductive Validity for First-Oder Equational Clauses

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Abstract Notions and Inference Systems for Proofs by Mathematical Induction

CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems

Full First-Order Sequent and Tableau Calculi with Preservation of Solutions and the Liberalized delta-Rule but without Skolemization

Selected Papers from Automated Deduction in Classical and Non-Classical Logics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to integrate implicit inductive theorem proving into free variable sequent and tableau calculi and compare the appropriateness of tableau calculi for this integration with that of sequent calculi.