Skip to main content
SpringerLink
Log in

An on-line problem database

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1379))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baader and K. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In D. Kapur, editor, Proceedings of the Eleventh International Conference on Automated Deduction (Saratoga Springs, NY), volume 607 of Lecture Notes in Artificial Intelligence, Berlin, June 1992. Springer-Verlag.

    Google Scholar 

  2. F. Baader and K. Schulz. Combination of constraint solving techniques: An algebraic point of view. In Proceedings of the 6th International Conference on Rewriting Techniques and Applications, volume 914 of Lecture Notes in Artificial Intelligence, pages 352–366, Kaiserslautern, Germany, 1995. Springer Verlag.

    Google Scholar 

  3. F. Baader and K. Schulz. On the combination of symbolic constraints, solution domains, and constraint solvers. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP95, volume 976 of Lecture Notes in Artificial Intelligence, Cassis, France, 1995. Springer Verlag.

    Google Scholar 

  4. F. Baader and K. Schulz. Combination of constraint solvers for free and quasi-free structures. Theoretical Computer Science, 1998. To appear.

    Google Scholar 

  5. H. P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North-Holland, Amsterdam, second edition, 1984.

    MATH  Google Scholar 

  6. M. Bidoit and M. Dauchet, editors. Theory and Practice of Software Development, Lecture Notes in Computer Science, vol. 1214, Lille, France, April 1997. Springer-Verlag.

    Google Scholar 

  7. H. Bunke, T. Glauser, and T.-H. Tran. An efficient implementation of graph grammars based on the RETE-matching algorithm. In H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors, Graph Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, pages 174–189, 1991.

    Google Scholar 

  8. A.-C. Caron. Linear bounded automata and rewrite systems: Influence of initial configurations on decision properties. In Proceedings of the International Joint Conference on Theory and Practice of Software Development, volume 1: Colloquium on Trees in Algebra and Programming (Brighton, U.K.), volume 493 of Lecture Notes in Computer Science, pages 74–89, Berlin, April 1991. Springer-Verlag.

    Google Scholar 

  9. A.-C. Caron, J.-L. Coquidé, and M. Dauchet. Encompassment properties and automata with constraints. In C. Kirchner, editor, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, Montreal, Canada, 1993. Springer-Verlag.

    Google Scholar 

  10. P. Chew. Unique normal forms in term rewriting systems with repeated variables. In Proceedings of the Thirteenth Annual Symposium on Theory of Computing, pages 7–18. ACM, 1981.

    Google Scholar 

  11. H. Comon. Unification et Disunification: Théorie et Applications. PhD thesis, l'Institut National Polytechnique de Grenoble, 1988.

    Google Scholar 

  12. H. Comon, editor. 8th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 1232, Sitges, Spain, June 1997. Springer-Verlag.

    Google Scholar 

  13. H. Comon and F. Jacquemard. Ground reducibility is EXPTIME-complete. In Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 26–34, Warsaw,Poland, June 1997. IEEE.

    Chapter  Google Scholar 

  14. B. Courcelle. Monadic-second order graph transductions: A survey. Theoretical Computer Science, 126:53–75, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  15. B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In G. Rozenberg, editor, Handbook of graph grammars and computing by graph transformations, vol. 1: Foundations, chapter 5, pages 313–400. World Scientific, New-Jersey, London, 1997.

    Chapter  Google Scholar 

  16. P.-L. Curien, T. Hardin, and J.-J. Levy. Confluence properties of weak and strong calculi of explicit substitutions. RR 1617, Institut National de Rechereche en Informatique et en Automatique, Rocquencourt, February 1992.

    Google Scholar 

  17. M. Dauchet. Simulation of Turing machines by a left-linear rewrite rule. In N. Dershowitz, editor, Proceedings of the Third International Conference on Rewriting Techniques and Applications (Chapel Hill, NC), volume 355 of Lecture Notes in Computer Science, pages 109–120, Berlin, April 1989. Springer-Verlag.

    Google Scholar 

  18. M. Dauchet. Simulation of Turing machines by a regular rewrite rule. Theoretical Computer Science, 103(2):409–420, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  19. N. Dershowitz. Innocuous constructor-sharing combinations. In Comon [12], pages 202–216.

    Google Scholar 

  20. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter 6, pages 243–320. North-Holland, Amsterdam, 1990.

    Google Scholar 

  21. N. Dershowitz, J.-P. Jouannaud, and J. W. Klop. Open problems in rewriting. In R. Book, editor, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications (Como, Italy), volume 488 of Lecture Notes in Computer Science, pages 445–456, Berlin, April 1991. Springer-Verlag.

    Google Scholar 

  22. N. Dershowitz, J.-P. Jouannaud, and J. W. Klop. More problems in rewriting. In C. Kirchner, editor, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), volume 690 of Lecture Notes in Computer Science, pages 468–487, Berlin, June 1993. Springer-Verlag.

    Google Scholar 

  23. N. Dershowitz, J.-P. Jouannaud, and J. W. Klop. Problems in rewriting III. In Proceedings of the Sixth International Conference on Rewriting Techniques and Applications (Kaiserslautern, Germany), Lecture Notes in Computer Science, Berlin, April 1995. Springer-Verlag.

    Google Scholar 

  24. E. Domenjoud, F. Klay, and C. Ringeissen. Combination techniques for nondisjoint equational theories. In A. Bundy, editor, CADE 94, volume 814 of Lecture Notes in Artificial Intelligence, pages 267–281, Nancy, France, 1994. Springer-Verlag.

    Google Scholar 

  25. R. Freese. personal communication, 1993.

    Google Scholar 

  26. H. Ganzinger, editor. 7th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 1103, New Brunswick, NJ, USA, July 1996. Springer-Verlag.

    Google Scholar 

  27. A. Geser. Relative Termination. PhD thesis, Universität Passau, Passau, Germany, 1990.

    Google Scholar 

  28. A. Geser, A. Middeldorp, E. Ohlebusch, and H. Zantema. Relative undecidability in the termination hierarchy of single rewrite rules. In Bidoit and Dauchet [6], pages 237–248.

    Google Scholar 

  29. G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. J. of the Association for Computing Machinery, 27(4):797–821, October 1980.

    Article  MathSciNet  MATH  Google Scholar 

  30. G. Huet and D. S. Lankford. On the uniform halting problem for term rewriting systems. Rapport laboria 283, Institut de Recherche en Informatique et en Automatique, Le Chesnay, France, March 1978.

    Google Scholar 

  31. B. Intrigila. Non-existent statman's double fixed point combinator does not exist, indeed. Information and Computation, 137(1):35–40, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  32. F. Jacquemard. fr Automates d'arbres et Réécriture de termes. PhD thesis, Université de Paris-Sud, 1996. In French.

    Google Scholar 

  33. J.-P. Jouannaud and H. Kirchner. Construction d'un plus petit ordre de simplification. RAIRO Theoretical Informatics, 18(3):191–207, 1984.

    MathSciNet  MATH  Google Scholar 

  34. D. Kapur, P. Narendran, and H. Zhang. On sufficient completeness and related properties of term rewriting systems. Acta Informatica, 24(4):395–415, August 1987.

    Article  MathSciNet  MATH  Google Scholar 

  35. J. W. Klop. Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts. Mathematisch Centrum, Amsterdam, 1980.

    Google Scholar 

  36. J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 1, pages 1–117. Oxford University Press, Oxford, 1992.

    Google Scholar 

  37. Y. Kobayashi, M. Katsura, and K. Shikishima-Tsuji. Termination and derivational complexity of confluent one-rule string-rewriting systems. Technical report, Toho university, Japan, 1997.

    Google Scholar 

  38. J. B. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture. Transactions of the American Mathematical Society, 95:210–225, May 1960.

    MathSciNet  MATH  Google Scholar 

  39. M. Kurihara and A. Ohuchi. Modularity of simple termination of term rewriting systems with shared constructors. Theoretical Computer Science, 103:273–282, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  40. W. Kurth. Termination und Konfluenz von Semi-Thue-Systems mit nur einer Regel. PhD thesis, Technische Universitat Clausthal, Clausthal, Germany, 1990. In German.

    Google Scholar 

  41. P. Lescanne. On termination of one rule rewrite systems. Theoretical Computer Science, 132:409–420, 1992.

    MathSciNet  Google Scholar 

  42. P. Lescanne and J. Rouyer-Degli. The calculus of explicit substitutions λυ. Technical Report RR-2222, INRIA-Lorraine, January 1994.

    Google Scholar 

  43. I. Litovski, Y. Métivier, and E. Sopena. Definitions and comparisons of local computations on graphs. Mathematical Systems Theory, to appear. Available as internal report 91-43 of LaBRI, University of Bordeaux 1.

    Google Scholar 

  44. M. J. Maher. Complete axiomatizations of the algebras of the finite, rational and infinite trees. In Proceedings of the Third IEEE Symposium on Logic in Computer Science, pages 348–357, Edinburgh, UK, July 1988. IEEE, Computer Society Press.

    Google Scholar 

  45. K. Mano and M. Ogawa. A new proof of Chew's theorem. Technical report, IPSJ PRG94-19-7, 1994.

    Google Scholar 

  46. J. Marcinkowski. Undecidability of the first order theory of one-step right ground rewriting. In Comon [12], pages 241–253.

    Google Scholar 

  47. A. Martelli and G. Rossi. Efficient unification with infinite terms in logic programming. In International conference on fifth generation computer systems, pages 202–209, 1984.

    Google Scholar 

  48. P.-A. Melliès. Typed λ-calculi with explicit substitutions may not terminate, 1995. To appear.

    Google Scholar 

  49. A. Middeldorp and B. Gramlich. Simple termination is difficult. Applicable Algebra in Engineering, Communication and Computing, 6(2):115–128, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  50. A. Middeldorp and Y. Toyama. Completeness of combinations of constructor systems. In R. Book, editor, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications (Como, Italy), volume 488 of Lecture Notes in Computer Science, pages 174–187, Berlin, April 1991. Springer-Verlag.

    Google Scholar 

  51. C. Muñoz. Confluence and preservation of strong normalisation in an explicit substitutions calculus (extended abstract). In Eleventh Annual IEEE Symposium on Logic in Computer Science, pages 440–447, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.

    Chapter  Google Scholar 

  52. J. Niehren, M. Pinkal, and P. Ruhrberg. On equality up-to constraints over finite trees, context unification and one-step rewriting. In 14th International Conference on Automated Deduction, Townsville, Australia, July 1997. To appear.

    Google Scholar 

  53. T. Nipkow. Higher-order critical pairs. In Proceedings of the Sixth Symposium on Logic in Computer Science, pages 342–349, Amsterdam, The Netherlands, 1991. IEEE.

    Chapter  Google Scholar 

  54. M. Ogawa and S. Ono. On the uniquely converging property of nonlinear term rewriting systems. Technical report, IEICE COMP89-7, 1989.

    Google Scholar 

  55. E. Ohlebusch. On the modularity of confluence of constructor-sharing term rewriting systems. In 19th Colloquium on Trees in Algebra and Programming, volume 787 of LNCS, pages 261–275. Springer-Verlag, 1994.

    Google Scholar 

  56. E. Ohlebusch. On the modularity of confluence of constructor-sharing term rewriting systems. In Proceedings of the Colloquium on Trees in Algebra and Programming, 1994.

    Google Scholar 

  57. V. v. Oostrom. Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, 1994.

    Google Scholar 

  58. V. v. Oostrom. Developing developments. Theoretical Computer Science, 175:159–181, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  59. M. Oyamaguchi and Y. Ohta. On the confluent property of right-ground term rewriting systems. Trans. IEICE, J76-D-I:39–45, 1993.

    Google Scholar 

  60. M. Oyamaguchi and Y. Ohta. A new parallel closed condition for Church-Rosser of left-linear term rewriting systems. In Comon [12], pages 187–201.

    Google Scholar 

  61. D. A. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65(2/3):182–215, May/June 1985.

    Article  MathSciNet  MATH  Google Scholar 

  62. F. v. Raamsdonk. Confluence and Normalization for Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, 1996.

    Google Scholar 

  63. M. K. Rao. Modular aspects of term graph rewriting. Theoretical Computer Science. To appear. Special issue on Rewriting Techniques and Applications conference RTA'96.

    Google Scholar 

  64. M. K. Rao. Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems. In Theory and Practice of Software Development, TAPSOFT'95, volume 915 of Lecture Notes in Computer Science, pages 379–393. Springer-Verlag, 1995.

    Google Scholar 

  65. J.-C. Raoult and J. Vuillemin. Operational and semantic equivalence between recursive programs. J. of the Association for Computing Machinery, 27(4):772–796, October 1980.

    Article  MathSciNet  MATH  Google Scholar 

  66. C. Ringeissen. Unification in a combination of equational theories with shared constants and its application to primal algebras. In A. Voronkov, editor, Proceedings of the Conference on Logic Programming and Automated Reasoning (St. Petersburg, Russia), volume 624 of Lecture Notes in Artificial Lntelligence, Berlin, July 1992. Springer-Verlag.

    Google Scholar 

  67. N. Robertson and P. Seymour. Graph minors 23: Nash-williams' immersion conjecture. Preprint, March 1996.

    Google Scholar 

  68. N. Robertson and P. D. Seymour. Graph minors IV. Tree-width and well-quasiordering. Submitted 1982; revised January 1986.

    Google Scholar 

  69. F. Seynhaeve, M. Tommasi, and R. Treinen. Grid structures and undecidable constraint theories. In Bidoit and Dauchet [6], pages 357–368.

    Google Scholar 

  70. G. Sénizergues. On the termination problem for one-rule semi-Thue system. In Ganzinger [26], pages 302–316.

    Google Scholar 

  71. M. Takahashi. λ-calculi with conditional rules. In M. Bezem and J. F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications (Utrecht, The Netherlands), volume 664 of Lecture Notes in Computer Science, pages 406–417, Berlin, 1993. Springer-Verlag.

    Google Scholar 

  72. W. Thomas. Automata theory on trres and partial orders. In Bidoit and Dauchet [6], pages 20–38.

    Google Scholar 

  73. S. Tison. Automates comme outil de décision dans les arbres. Dossier d'habilitation à diriger des recherches, December 1990. In French.

    Google Scholar 

  74. H. Touzet. Propriétés combinatoires pour la terminaison de systèmes de réécriture. PhD thesis, Université Henri Poincaré —Nancy 1, Nancy, France, September 1991. In French.

    Google Scholar 

  75. Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. J. of the Association for Computing Machinery, 34(1):128–143, January 1987.

    Article  MathSciNet  MATH  Google Scholar 

  76. Y. Toyama. Commutativity of term rewriting systems. In K. Fuchi and L. Kott, editors, Programming of Future Generation Computers II, pages 393–407. North-Holland, 1988.

    Google Scholar 

  77. Y. Toyama and M. Oyamaguchi. Church-Rosser property and unique normal form property of non-duplicating term rewriting systems. In N. Dershowitz and N. Lindenstrauss, editors, Workshop on Conditional Term Rewriting Systems (Jerusalem, July 1994), Lecture Notes in Computer Science. Springer-Verlag, to appear.

    Google Scholar 

  78. R. Treinen. The first-order theory of one-step rewriting is undecidable. In Ganzinger [26], pages 276–286.

    Google Scholar 

  79. V. v. Oostrom and F. v. Raamsdonk. Weak orthogonality implies confluence: the higher-order case. In A. Nerode and Y. V. Matiyasevich, editors, Third International Symposium on the Logical Foundations of Computer Science, volume 813 of Lecture Notes in Computer Science, pages 379–392, St. Petersburg, Russia, July 1994. Springer-Verlag.

    Google Scholar 

  80. R. M. Verma. Unique normal forms and confluence for rewrite systems. In Int'l Joint Conf. on Artificial Intelligence, pages 362–368, 1995.

    Google Scholar 

  81. R. M. Verma. Unicity and modularity of confluence for term rewriting systems. Technical report, University of Houston, 1996.

    Google Scholar 

  82. R. M. Verma. Unique normal forms for nonlinear term rewriting systems: Root overlaps. In Symp. on Fundamentals of Computation Theory, volume 1279 of Lecture Notes in Computer Science, pages 452–462. Springer-Verlag, September 1997.

    Google Scholar 

  83. S. Vorobyov. An improved lower bound for the elementary theories of trees. In M. A. McRobbie and J. K. Slaney, editors, 13th International Conference on Automated Deduction, Lecture Notes in Computer Science, pages 275–287, New Brunswick, NJ, july/august 1996. Springer-Verlag.

    Google Scholar 

  84. S. Vorobyov. The first-order theory of one step rewriting in linear noetheran systems is undecidable. In Comon [12], pages 254–268.

    Google Scholar 

  85. A. Weiermann. Bounding derivation lengths with functions from the slow growing hierarchy. Preprint Münster, 1993.

    Google Scholar 

  86. C. Wrathall. Confluence of one-rule Thue systems. In Proceedings of the First International Workshop on Word Equations and Related Topics (Tübingen), volume 572 of Lecture Notes in Computer Science, pages 237–246, Berlin, 1990. Springer-Verlag.

    Google Scholar 

  87. H. Zantema. Total termination of term rewriting is undecidable. Technical Report UU-CS-1994-55, Utrecht University, December 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois, 61801, Urbana, IL, USA

    Nachum Dershowitz

  2. L.R.I., Université de Paris-Sud, F91405, Orsay cedex, France

    Ralf Treinen

Authors
  1. Nachum Dershowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Treinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag

About this paper

Cite this paper

Dershowitz, N., Treinen, R. (1998). An on-line problem database. In: Nipkow, T. (eds) Rewriting Techniques and Applications. RTA 1998. Lecture Notes in Computer Science, vol 1379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052380

Download citation

  • DOI: https://doi.org/10.1007/BFb0052380

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64301-2

  • Online ISBN: 978-3-540-69721-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation