E-Generalization Using Grammars

The first Section of the present paper is devoted to prove and to comment the following

The following grammar G 1 allows generating all fi- nite trees (a tree is a connected directed graph such that every node except one is the target of at most

This means that, along a proof, some formulas are persistent (as in usual first order logic) but some formulas can only be used once... there is a proof of a sequent in a proof

In Section 1 we introduce some preliminary notions on codes and transduc- ers. In Section 2 we define latin square maps and we describe the generaliza- tion of Girod’s method to

In this article, we propose a generalization of the classical finite difference method suitable with the approximation of solutions in subspaces of the Sobolev spaces H −s , s >

2 Theorem 6.5 The tree tuple language recognized by the grammar gives exactly the ground data instances of the data terms computed by narrowing, thanks to the first component of

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

By dividing a reservoir mode! into relatively independent zones, it is possible to initialize the history matching problem by choosing the "best" realizations