G. Salzer. The unication of innite sets of terms and its applications. In Logic Programming and Automated Reasoning (LPAR'92), pages 409-429. Springer, LNAI 624, July 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Using Term Schematizations in Automated Deduction - Peltier (Correct)
.... been proposed to the initial language, and several di erent formalisms are now available, with various complexities and expressive powers: the recurrent terms (also called hyper terms) of Chen, Hsiang and Kong [4] the terms with integer exponents of Comon [6] the R terms and R forms of Salzer [19, 18], the primal grammars of Hermann [12] the congruence grammars of McAllester [15] etc. However, only few papers have been dealing with the actual use of these formalisms in Automated Deduction. Since the uni cation problem is decidable for most of them, it is of course possible to integrate them ....
....to deduce automatically the formula F 0 , given the formula F above, instead of blindly enumerating the set of ground facts feven(0) odd(succ(0) even(succ(succ(0) g. For this purpose, some techniques have been proposed, in order to detect and avoid loops during the proof search. In [19], a rule is de ned in order to avoid repeated applications of the resolution rule. Its principle is the following. Given a binary self resolving clause of the form P P and a clause H B 1 ; B k such that P and H have a m.g.u. it is possible to deduce a clause of the form P n B ....
[Article contains additional citation context not shown here]
G. Salzer. The unication of innite sets of terms and its applications. In Logic Programming and Automated Reasoning (LPAR'92), pages 409-429. Springer, LNAI 624, July 1992.
On the Word, Subsumption, and Complement Problems for.. - Hermann, Salzer (1998) Self-citation (Salzer) (Correct)
....L. Brim, J. Gruska, and J. Zlatu ska, editors, volume 1450 of Lecture Notes in Computer Science, pages 257 266. Springer Verlag, August 1998. y This work was done while the author was visiting LORIA. His visit was funded by Univerist e Henri Poincar e, Nancy 1. I terms [Com95] R terms [Sal92], and primal grammars [HG97] all of them with a nitary uni cation algorithm. Set operations for several types of schematizations were studied in [AHL97] Applications of recurrent schematizations are quite rare and mostly theoretical, like in model building [Pel97] or cycle uni cation [Sal94] ....
G. Salzer. The unication of innite sets of terms and its applications. In A. Voronkov, editor, Proceedings 3rd International Conference on Logic Programming and Automated Reasoning (LPAR'92), St. Petersburg (Russia), volume 624 of Lecture Notes in Computer Science (in Articial Intelligence), pages 409-420. Springer-Verlag, July 1992.
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