In Section 6 we present an inductive separation algorithm which we use in our theorem prover as a preprocessing step to obtain the constructors and defined ...

May 31, 2005 · The core of our method is a new parallel cover algorithm based on recursive decomposition. From this we obtain a separation algorithm which ...

LICS '97: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science. We prove that ground reducibility is EXPTIME-complete in the general ...

Computing ground reducibility and inductively complete positions · Proofs by induction in equational theories with constructors · On sufficient-completeness and ...

Ground (co-)reducibility has been proved to be the fundamental tool for mechanizing inductive proofs, together with the Knuth-Bendix completion procedure ...

We formulate a notion of relative completeness and show that term rewriting induction and completion-based methods are not relatively complete in this sense. 2.

We formulate a notion of relative completeness and show that term rewriting induction and completion-based methods are not relatively complete in this sense. 2 ...

When we stick to the decision problem, it is EXPTIME-complete [Comon and Jacquemard 1997]. Finally, ground reducibility tests can also be used directly in the ...

Computing ground reducibility and inductively complete positions. In Dershowitz, N., ed., Rewriting Techniques and Applications, volume 355 of Leer. Notes ...

Computing Ground Reducibility and Inductively Complete Positions. Reinhard ... of Ground Rewrite Rules Equivalent to a Set of Ground Equations E. Wayne ...