Reasoning on Schemata of FormulæReport as inadecuate

Reasoning on Schemata of Formulæ - Download this document for free, or read online. Document in PDF available to download.

1 CAPP LIG - Laboratoire d-Informatique de Grenoble

Abstract : A logic is presented for reasoning on iterated sequences of formulæ over some given base language. The considered sequences, or schemata, are defined inductively, on some algebraic structure for instance the natural numbers, the lists, the trees etc

A proof procedure is proposed to relate the satisfiability problem for schemata to that of finite disjunctions of base formulæ. It is shown that this procedure is sound, complete and terminating, hence the basic computational properties of the base language can be carried over to schemata.

Author: Mnacho Echenim - Nicolas Peltier -



Related documents