A Language for Encoding and Reconstruction of Rewriting Proofs

We present a language for encoding semiautomatic proofs of theorems in the inductive theory generated by a system of equations oriented as rewriting rules. These proofs can be made using a rewriting induction principle with a special notion of cover set. The proofs can include simple or conditional...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Salas, Jorge F.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	AC generators Computer science DC generators Encoding encoding languages for proofs Equations FCC Induction generators Laboratories rewriting induction rewriting systems Semiautomated theorem proving Shape US Department of Defense
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!