Manfred Schmidt-Schauß  Home/Search
Context
Related
| ki.informatik.unifra...strat2000.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ki.informatik.unifran...articles (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Context unification is a variant of second order unification. It can also be seen as a generalization of string unification to tree unification. Currently it is not known whether context unification is decidable. A specialization of context unification is stratified context unification, which is decidable. However, the previous algorithm has a very bad worst case complexity. Recently it turned out that stratified context unification is equivalent to satisfiability of one-step rewrite... (Update)
Similar documents (at the sentence level):
10.7%: A Decision Algorithm for Stratified Context Unification - Schmidt-Schauß (1999) (Correct)
Active bibliography (related documents): More All
1.1: Context Unification and Traversal Equations - Levy, Villaret (2001) (Correct)
1.0: Linear Second-Order Unification and Context Unification with.. - Levy, Villaret (2000) (Correct)
0.8: Solvability of Context Equations with two Context.. - Schmidt-Schauß, Schulz (1999) (Correct)
Similar documents based on text: More All
0.7: On Equality Up-to Constraints over Finite Trees, Context .. - Niehren, Pinkal.. (Correct)
0.4: Decidability of Bounded Second Order Unification - Schmidt-Schauß (Correct)
0.0: Sound And Complete Translations From Sorted Higher-Order Logic.. - Kerber (1994) (Correct)
BibTeX entry: (Update)
@misc{ schmidt-schau-optimized,
author = "Manfred Schmidt-Schauß",
title = "An Optimized Decision Algorithm for Stratified Context Unification",
url = "citeseer.ist.psu.edu/431148.html" }
Citations (may not include all citations):174 A unification algorithm for typed -calculus (context) - Huet - 1975
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 - 1993
56 Higher-order unification revisited: Complete sets of transfo.. (context) - Snyder, Gallier - 1989
35 Solving Higher-order Equations: From Logic to Programming - Prehofer - 1995
24 Satisfiability of word equations with constants is in NEXPTI.. (context) - Plandowski - 1999
24 Satisfiability of word equations with constants is in PSPACE (context) - Plandowski - 1999
23 On equality up-to constraints over finite trees (context) - Niehren, Pinkal et al. - 1997
19 Simple second-order languages for which unification is undec.. (context) - Farmer - 1991
19 Unification of stratified second-order terms (context) - Schmidt-Schau - 1994
19 the exponent of periodicity of minimal solutions of context .. (context) - Schmidt-Schau, Schulz - 1998
15 Complexity of Makanin's algorithms (context) - Ko'scielski, Pacholski - 1996
12 Solvability of context equations with two context variables .. - Schmidt-Schau, Schulz - 1999
11 Linear second order unification (context) - Levy - 1996
7 the undecidability of second-order unification - Levy, Veanes - 1999
5 Decidability of bounded second order unification (context) - Schmidt-Schau - 1999
4 A complete mechanization of second-order type theory (context) - Pietrzykowski - 1973
4 A decision algorithm for distributive unification (context) - Schmidt-Schau - 1998
3 Number 21 in Cambridge tracts in theoretical computer scienc.. (context) - Wolfram, theories - 1993
3 A decision algorithm for stratified context unification (context) - Schmidt-Schau - 1999
3 equational theory of context unification is co-recursively e.. (context) - Vorobyov - 1998
2 to appear in Information Processing Letters (context) - Niehren, Treinen et al. - 1999
Documents on the same site (http://www.ki.informatik.uni-frankfurt.de/papers/articles.html): More
Tinte: developing a prototype for typesetting music in Clean - a.. - Panitz (Correct)
A Partial Rehabilitation of Side-Effecting I/O.. - Schmidt-Schauß (1996) (Correct)
The G#-machine: Efficient strictness analysis in Haskell - Schütz (1995) (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