Abstract: "We develop a generic representation of implicit induction proof procedures within the cover set induction framework. Our work further develops the approach of cover set induction on propositional orderings. We show that in order to represent a substantially wide range of implicit ind...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Naidich, Dimitri (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Amsterdam 1996
Schriftenreihe:	Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 96,20
Schlagworte:	Algebra, Abstract Automatic theorem proving Rewriting systems (Computer science)
Zusammenfassung:	Abstract: "We develop a generic representation of implicit induction proof procedures within the cover set induction framework. Our work further develops the approach of cover set induction on propositional orderings. We show that in order to represent a substantially wide range of implicit induction procedures it is neccessary to generalize the induction on formulas (propositions) to the induction on formula instances. We present a generic induction procedure which captures virtually all the existing implicit induction procedures developed from the inductive completion framework. We establish the formal relationship between the generic induction procedure and the cover set induction scheme. We also demonstrate that the developed generic framework allows for easy generalization/modification of the existing procedures."
Beschreibung:	31 S.