| G. Aguzzi, U. Modigliani, and M.C. Verri. A Universal Unification Condition for Solving Goals in Equational Languages. In Proc. of CTRS'90, volume 516 of Lecture Notes in Computer Science, pages 416--423. Springer-Verlag, Berlin, 1990. |
....algorithm has been proven in [5] as stated by the following proposition. 5] In general, the use of narrowing results in a semidecision procedure for testing the solvability of equation sets. A few approaches to improve the termination of narrowing have been reported [1,8,9,17,26]. For example, 8,26] consider a graph of terms which allows the detection of some loops in the search tree which do not lead to any solution. The improved algorithms described in [8,26] are still complete but termination is only guaranteed for theories which satisfy some rather strong conditions. ....
G. Aguzzi, U. Modigliani, and M.C. Verri. A Universal Unification Condition for Solving Goals in Equational Languages. In , volume 516 of , pages 416--423. Springer-Verlag, Berlin, 1990.
No context found.
G. Aguzzi, U. Modigliani, and M.C. Verri. A Universal Unification Condition for Solving Goals in Equational Languages. In Proc. of CTRS'90, volume 516 of Lecture Notes in Computer Science, pages 416--423. Springer-Verlag, Berlin, 1990.
No context found.
G. Aguzzi, U. Modigliani, and M.C. Verri. A Universal Unification Condition for Solving Goals in Equational Languages. In Proc. of CTRS'90, volume 516 of Lecture Notes in Computer Science, pages 416--423. Springer-Verlag, Berlin, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC