Inductive Theorem Proving by Consistency for First-Order Clauses (1993)
| Venue: | The Third International Workshop on Conditional Term Rewriting Systems, Extended Abstracts |
| Citations: | 10 - 0 self |
BibTeX
@INPROCEEDINGS{Ganzinger93inductivetheorem,
author = {Harald Ganzinger and Jürgen Stuber},
title = {Inductive Theorem Proving by Consistency for First-Order Clauses},
booktitle = {The Third International Workshop on Conditional Term Rewriting Systems, Extended Abstracts},
year = {1993},
pages = {130--135},
publisher = {Teubner Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. We show how the method of proof by consistency can be extended to proving properties of the perfect model of a set of first-order clauses with equality. Technically proofs by consistency will be similar to proofs by case analysis over the term structure. As our method also allows to prove sufficient-completeness of function definitions in parallel with proving an inductive theorem we need not distinguish between constructors and defined functions. Our method is linear and refutationally complete with respect to the perfect model, it supports lemmas in a natural way, and it provides for powerful simplification and elimination techniques. 1 Introduction For proving inductive theorems of equational theories "proof by consistency" is a particularly powerful method. The method has been engineered during the last decade by gradually removing restrictions on the specification side, by reducing the search space for inferences, and by including methods from term rewriting for the simplificat...
