See this document in CiteSeerX!

On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting  (Make Corrections)  (1 citation)
Joachim Niehren, Manfred Pinkal, Peter Ruhrberg



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
ps.unisb.de/Papers/ab...fullContext.ps
Cached:  PS.gz  PS   PDF  Image  Update  Help

From:  ps.unisb.de/Papers/abstracts/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We introduce equality up-to constraints over finite trees and investigate their expressiveness. Equality up-to constraints subsume equality constraints, subtree constraints, and one-step rewriting constraints. (Update)

Context of citations to this paper:   More

...structures for the source and target sentence (i.e. 0.tex; 4 02 2000; 14:18; p. 5 6 Markus Egg, Alexander Koller, Joachim Niehren below X 0 and Y 0 ) are equal, with the exception of the sub lambda structures representing the parallel elements (below X 2 and Y 2 ) 10) X 1...

Cited by:   More
The Constraint Language for Lambda Structures - Egg, Koller, Niehren (2000)   (Correct)

Active bibliography (related documents):   More   All
0.6:   A Decision Algorithm for Stratified Context Unification - Schmidt-Schauß (2001)   (Correct)
0.5:   Solvability of Context Equations with two Context.. - Schmidt-Schauß, Schulz (1999)   (Correct)
0.5:   Symbolic Pattern Solving for Equational Reasoning - Caprotti   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:   More   All
1.5:   A Uniform Approach to Underspecification and Parallelism - Niehren, Pinkal, Ruhrberg (1997)   (Correct)
1.1:   Dominance Constraints in Context Unification - Niehren, Koller (1998)   (Correct)
0.7:   Context Unification and Traversal Equations - Levy, Villaret (2001)   (Correct)

BibTeX entry:   (Update)

Niehren, J., M. Pinkal, and P. Ruhrberg: 1997a, `On Equality Up-to Constraints over Finite Trees, Context Unication, and One-Step Rewriting'. In: Proceedings 14th CADE. Townsville: Springer-Verlag. http://citeseer.ist.psu.edu/585431.html   More

@misc{ niehren-equality,
  author = "J. Niehren and M. Pinkal and P. Ruhrberg",
  title = "On Equality Up-to Constraints over Finite Trees, Context Unication, and
    One-Step Rewriting",
  text = "Niehren, J., M. Pinkal, and P. Ruhrberg: 1997a, `On Equality Up-to Constraints
    over Finite Trees, Context Unication, and One-Step Rewriting'. In: Proceedings
    14th CADE. Townsville: Springer-Verlag.",
  url = "citeseer.ist.psu.edu/585431.html" }
Citations (may not include all citations):
174   A unification algorithm for typed -calculus (context) - Huet - 1975
114   Building in equational theories (context) - Plotkin - 1972
105   The problem of solvability of equations in a free semigroup (context) - Makanin - 1977
97   The undecidability of the second-order unification problem (context) - Goldfarb - 1981
75   Completion of rewrite systems with membership constraints - Comon - 1992  ACM   DBLP
71   Unification in the union of disjoint equational theories - Baader, Schulz - 1992  ACM
41   Encompassment properties and automata with constraints (context) - Caron, Coquide et al. - 1993  ACM   DBLP
31   Decidability of the purely existential fragment of the theor.. (context) - Venkataraman - 1987
30   A new method for undecidability proofs of first order theori.. - Treinen - 1992  ACM   DBLP
25   Minimal and complete word unification (context) - Jaffar - 1990
23   On equality up-to constraints over finite trees (context) - Niehren, Pinkal et al. - 1997
19   Linear second order unification - L'evy - 1996
18   A uniform approach to underspecification and parallelism - Niehren, Pinkal et al. - 1997  ACM   DBLP
16   Higher-order coloured unification and natural language seman.. - Gardent, Kohlhaase - 1996  ACM   DBLP
15   Complexity of makanin's algorithm (context) - Ko'scielski, Pacholski - 1996
15   Word unification and transformation of generalized equations - Schulz - 1993  ACM
12   The first-order theory of one-step rewriting is undecidable (context) - Treinen - 1996  ACM   DBLP
10   A combinatorial problem in the theory of free monoids (context) - Lentin, Schutzenberger - 1969
9   A complete mechanization of second-order logic (context) - Pietrzykowski - 1973
9   Undecidability of the first order theory of one-step right g.. (context) - Marcinkowski - 1997  ACM   DBLP
6   Decidability of the existential theory of infinite terms wit.. (context) - Tulipani - 1993  ACM   DBLP
6   Unification of stratified second-order terms (context) - Schmidt-Schau - 1994
5   Universitat des Saarlandes (context) - Pinkal, CLAUS - 1996
2   Handbook of Logic in Artificial Intelligence and Logic Progr.. (context) - Baader, Siekmann - 1993  ACM
1   Technical Report Internal Report CSM (context) - Siekmann, Part - 1975
1   English Translation in Israel Program for Scientific Transla.. (context) - Markov, of et al. - 1968
1   Linhuistics and Philosophy (context) - Dalrymple, Shieber et al. - 1991
1   Solution principale et rang d'un system d'`equations avec co.. (context) - P'ecuchet - 1984

Documents on the same site (http://www.ps.uni-sb.de/Papers/abstracts/):   More
Set-Based Failure Analysis for Logic Programs and.. - Podelski, Charatonik, .. (1999)   (Correct)
Type Inference for First-Class Messages with Feature Constraints - Müller, Nishimura   (Correct)
Entailment of Non-Structural Subtype Constraints - Niehren, Priesnitz (1999)   (Correct)

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