Our restricted completion procedure terminates in many cases where the inductive completion procedure loops, generating infinitely many critical pairs. The ...
Our procedure extends to conditional theories and conditional conjectures and can incorporate various techniques used in classical induction (generalization, ...
A Strong restriction of the inductive completion procedure - SpringerLink
link.springer.com › chapter
May 31, 2005 · 'A Strong restriction of the inductive completion procedure' published in 'Automata, Languages and Programming'
Jul 15, 1986 · A strong restriction of the inductive completion procedure · A Proof Procedure for Separation Logic with Inductive Definitions and Data.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...
A strong restriction of the inductive completion procedure. L Fribourg. Automata, Languages and Programming: 13th International Colloquium Rennes …, 1986. 91 ...
Inductionless induction consists of using pure equational reasoning for proving the validity of an equation in the initial algebra of a set of equational ...
[23] Laurent Fribourg (1986). A Strong Restriction of the Inductive Completion Pro- cedure. 13th ICALP1986, LNCS226, pp.105–116, Springer. Also in: J ...
In spite of the fact that the inductive completion procedure works efficiently, several problems still remain to be solved. ... [3] Fribburg, L.: A Strong ...
L. Fribourg. A strong restriction of the inductive completion procedure. Journal of Symbolic Computation, 8(3):253–276, 1989.