Simplified handling of iterated term schemata
We propose an extension of primal grammars (Hermann and GalbavA1/2, Theor Comp Sci 176(1-2):111-158, 1997), called P-grammars. Primal grammars are term grammars with a high expressive power and good computational properties. P-grammars have exactly the same properties but are more modular, more concise, and easier to use, as shown by some examples. We prove that P-grammars are exponentially more concise than primal grammars. An algorithm, called p2primal, transforming any P-grammar into an equivalent primal grammar is provided, thus making the original formalism much easier to handle from a practical point of view.
grammars term schematisation automated deduction