Manfred Schmidt-Schau. A decision algorithm for distributive unification. Theoretical Computer Science, 208:111--148, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Context Unification and Traversal Equations - Levy, Villaret (2001) (Correct)
....problem. Obviously, the converse is not true. The context unification problem was originally formulated by H. Comon in [Com92,Com98] There it is proved that context unification is decidable when, for any context variable, all its occurrences have the same argument. Later, it was proved [SS96,SS98,SS99a] that the problem is also decidable when context variables are stratified, i.e. when, for any variable, the list of context variables we find going from the root of the term to any occurrence of this variable is always the same. It was also proved [Lev96] that a generalization of the problem ....
M. Schmidt-Schau. A decision algorithm for distributive unification. Theoretical Computer Science, 208:111--148, 1998.
Linear Second-Order Unification and Context Unification with.. - Levy, Villaret (2000) (6 citations) (Correct)
....We comment on the possibility that linear second order unification is decidable, if context unification is, and how to get rid of the tree regular constraints. This is done by reducing rank bound tree regular constraints to word regular constraints. 1 Introduction Context Unification (CU) [10, 11] is an extension of First Order Unification where, in addition to the first order variables, we also have variables that denote contexts. These context variables are applied to arguments, thus the term F (t) denotes any term containing t as a subterm, and F denotes the context surrounding such ....
M. Schmidt-Schau. A decision algorithm for distributive unification. Theoretical Computer Science, 208:111--148, 1998.
An Optimized Decision Algorithm for Stratified Context.. - Schmidt-Schauß (2000) Self-citation (Schmidt-schau) (Correct)
....order unification [SS99a] where second order variables represent terms with a number of holes that is bounded by some preselected number. Applications of context unification are for example in computational linguistics [NPR97] and of (stratified) context unification in equational unification [SS98]. Recently it was noticed that satisfiability of one step rewrite constraints and stratified context unification can be interreduced [NTT99] This paper presents an algorithm for stratified context unification that improves the run time and space usage of the decision algorithm given in [SS99b] ....
....second order unification [SS99a] is very similar to the decision algorithm for stratified context unification. The methods developed in this paper may be used in an estimation of its complexity. Perhaps the tools in this paper help in computing an upper bound for the complexity of D unification [SS98], however, this would require a careful inspection of the algorithm since context unification is not used as a module. ....
Manfred Schmidt-Schau. A decision algorithm for distributive unification. Theoretical Computer Science, 208:111--148, 1998.
A Decision Algorithm for Stratified Context Unification - Schmidt-Schauß (1999) Self-citation (Schmidt-schau) (Correct)
....order variables represent terms with zero or one hole. Satisfiability in a logical theory of context unification is undecidable [Vor98] Applications of context unification are for example in computational linguistics [NPR97] and of (stratified) context unification in equational unification [SS98]. Recently it was noticed that one step rewrite constraints and stratified context unification can be interreduced [NTT99] An important motivation for this paper is to describe a correct decision algorithm for stratified context unification and also to provide a correct and complete proof that ....
....stratified context unification and also to provide a correct and complete proof that it is indeed a decision algorithm for stratified context unification. Previous papers and proofs are [SS94, SS95] and [Lev96] where the proof contains gaps or the termination proof is incomplete. The treatment in [SS98] covers only a very restricted signature. The algorithm SCU that is described in this paper optimizes simplicity of the description and not efficiency. This improves upon [SS95, SS94] insofar as no parametric terms are necessary and that there is no call of a decision algorithm for string ....
[Article contains additional citation context not shown here]
Manfred Schmidt-Schau. A decision algorithm for distributive unification. Theoretical Computer Science, 208:111--148, 1998.
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