Klaus U. Schulz. Word uni cation and transformation of generalized equations. J. Automated Reasoning, pages 149-184, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dominance Constraints in Context Unification - Niehren, Koller (1998) (Correct)
....onestep rewriting constraints [NPR97a,NTT99] It is shown in [SSS99] that context uni cation with two context variables each of which may occur an arbitrary number of times is decidable. The proof is by reduction to string uni cation, which is decidable according to Makanin s famous result [Mak77,Sch93]. Tree Descriptions in Semantic Underspeci cation. Recently, tree descriptions based on dominance constraints and context uni cation have been proposed for the same application to natural language semantics [ENRX98,NPR97a,Kol99] There, the goal was to nd a uniform language providing ....
Klaus U. Schulz. Word uni cation and transformation of generalized equations. Information and Computation, 11:149-184, 1993.
On Quadratic Word Equations - Robson, Diekert (1999) (4 citations) (Correct)
....It is a well known classical fact that linear integer programming is NP complete, see e.g. 8] Thus, the satis ability problem for a single equation over a binary alphabet of constants is NP hard. For the upper bound, a rst analysis in the works of Ja ar and Schulz showed a 4 NEXPTIME result [5, 9, 24]. By Ko scielski and Pacholski [10, Cor. 4.6] this went down to 3 NEXPTIME. The present state of the art is due to [7] Guti errez showed that the problem is in EXPSPACE, in particular, it is in 2 DEXPTIME. Another recent and very interesting result is due to Rytter and Plandowski [21] It shows ....
Klaus U. Schulz. Word unication and transformation of generalized equations. Journal of Automated Reasoning, 11(2):149-184, 1993. 10
Dominance Constraints in Context Unification - Niehren, Koller (1998) (Correct)
....one step rewriting constraints [NPR97a] It is shown in [SSS99] that context uni cation with only two context variables each of which may occur an arbitrary number of times is decidable. The proof is by reduction to string uni cation, which is decidable according to Makanin s famous result [Mak77,Sch93]. Tree Descriptions in Semantic Underspeci cation. Recently, tree descriptions based on dominance constraints and context uni cation have been proposed for the same application to natural language semantics [ENRX98,NPR97b,Kol99] There, the goal was to nd a uniform language providing underspeci ....
Klaus U. Schulz. Word unication and transformation of generalized equations. Information and Computation, 11:149-184, 1993.
Decidability of Bounded Higher-Order Unification - Schmidt-Schauß, Schulz (2002) (1 citation) Self-citation (Schulz) (Correct)
.... for the exponent of periodicity for a minimal uni er for context uni cation from [SSS98] which is a generalization of a lemma that appeared in the decidability proof of word uni cation by Makanin [Mak77] An improvement of the latter result was given in [KP96] This link to word uni cation ([Mak77,Sch90,Sch93,Gut98,Pla99]) is not accidental. The relationship between word uni cation and bounded higherorder uni cation is indicated in Figure 1 where we also mention some other problems in order to position the results of this paper. Higher order unification Monadic 2nd order unification word unification ....
Klaus U. Schulz. Word uni cation and transformation of generalized equations. J. Automated Reasoning, pages 149-184, 1993.
Decidability of Bounded Higher-Order Unification - Schmidt-Schauß, Schulz (2002) (1 citation) Self-citation (Schulz) (Correct)
.... bound for the exponent of periodicity for a minimal uni er for context uni cation from [SSS98] which is a generalization of a lemma that appeared in the decidability proof of word uni cation by Makanin [Mak77] An improvement of the latter result was given in [KP96] This link to word uni cation ([Mak77,Sch90,Sch93,Gut98,Pla99]) is not accidental. The relationship between word uni cation and bounded higherorder uni cation is indicated in Figure 1 where we also mention some other problems in order to position the results of this paper. Higher order unification eliminate types restrict signature exclude function ....
Klaus U. Schulz. Word unication and transformation of generalized equations. J. Automated Reasoning, pages 149-184, 1993.
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