Skip to main content
SpringerLink
Log in

Open problems in rewriting

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

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

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Ait-Kaci and M. Nivat, eds. Resolution of Equations in Algebraic Structures. Vol. 2: Rewriting Techniques, Academic Press, New York, 1989.

    Google Scholar 

  2. J. Avenhaus and K. Madlener. Term rewriting and equational reasoning. In R. B. Banerji, editor, Formal Techniques in Artificial Intelligence: A Sourcebook, pp. 1–41, Elsevier, Amsterdam, 1990.

    Google Scholar 

  3. L. Bachmair. Canonical Equational Proofs. Birkhäuser, Boston, 1991. To appear.

    Google Scholar 

  4. L. Bachmair and N. Dershowitz. Inference rules for rewrite-based first-order theorem proving. In Proceedings of the Second IEEE Symposium on Logic in Computer Science, pp. 331–337, Ithaca, NY, June 1987.

    Google Scholar 

  5. L. Bachmair and J. Hsiang, eds. Rewrite Techniques in Theorem Proving (Special Issue). Vol. 11 (1) of J. Symbolic Computation, Academic Press, 1991. To appear.

    Google Scholar 

  6. T. Baird, G. Peterson, and R. Wilkerson. Complete sets of reductions modulo Associativity, Commutativity and Identity. In N. Dershowitz, editor, Proceedings of the Third International Conference on Rewriting Techniques and Applications, pp. 29–44, Chapel Hill, NC, Apr. 1989. Vol. 355 of Lecture Notes in Computer Science, Springer, Berlin.

    Google Scholar 

  7. H. P. Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, eds., Handbook of Logic in Computer Science, Oxford University Press, Oxford, 1991. To appear.

    Google Scholar 

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

    Google Scholar 

  9. H. P. Barendregt. The Typed Lambda Calculus, its Syntax and Semantics. North-Holland, Amsterdam, 1991.

    Google Scholar 

  10. G. Bauer. n-level rewriting systems. Theoretical Computer Science, 40:85–99, 1985.

    Google Scholar 

  11. A. Ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9(2):137–159, Oct. 1987.

    Google Scholar 

  12. B. Benninghofen, S. Kemmerich, and M. M. Richter. Systems of Reductions. Vol. 277 of Lecture Notes in Computer Science, Springer, Berlin, 1987.

    Google Scholar 

  13. J. A. Bergstra and J. W. Klop. Conditional rewrite rules: Confluency and termination. J. of Computer and System Sciences, 32:323–362, 1986.

    Google Scholar 

  14. G. Berry and J. Lévy. Mimimal and optimal computations of recursive programs. J. of the Association for Computing Machinery, 26:148–175, 1979.

    Google Scholar 

  15. R. Book, ed. Proceedings of the Fourth International Conference on Rewriting Techniques and Applications (Como, Italy), Springer, Berlin, Apr. 1991.

    Google Scholar 

  16. A. Boudet, E. Contejean, and H. Devie. A new ac unification algorithm with an algorithm for solving diophantine equations. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pp. 289–299, Philadelphia, PA, June 1990.

    Google Scholar 

  17. F. Bronsard and U. S. Reddy. Conditional rewriting in Focus. In M. Okada, editor, Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems, Springer, Montreal, Canada, 1991. To appear.

    Google Scholar 

  18. E. A. Cichon. Bounds on Derivation Lengths from Termination Proofs. Technical Report CSD-TR-622, Department of Computer Science, University of London, Surrey, England, June 1990.

    Google Scholar 

  19. H. Comon. Solving inequations in term algebras (Preliminary version). In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pp. 62–69, Philadelphia, PA, June 1990.

    Google Scholar 

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

    Google Scholar 

  21. 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, pp. 109–120, Chapel Hill, NC, Apr. 1989. Vol. 355 of Lecture Notes in Computer Science, Springer, Berlin.

    Google Scholar 

  22. M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison. Decidability of the confluence of finite ground term rewriting systems and of other related term rewriting systems. Information and Computation, 88(2):187–201, October 1990.

    Google Scholar 

  23. M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pp. 242–248, Philadelphia, PA, June 1990.

    Google Scholar 

  24. N. Dershowitz, ed. Rewriting Techniques and Applications III (Special Issue). J. of Symbolic Computation, Academic Press, 1992. To appear.

    Google Scholar 

  25. N. Dershowitz. Termination of rewriting. J. of Symbolic Computation, 3(1&2):69–115, February/April 1987. Corrigendum: 4, 3 (December 1987), 409–410.

    Google Scholar 

  26. N. Dershowitz, ed. Third International Conference on Rewriting Techniques and Applications, Chapel Hill, NC, April 1989. Vol. 355 of Lecture Notes in Computer Science, Springer, Berlin.

    Google Scholar 

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

    Google Scholar 

  28. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In S. Shapiro, editor, Encyclopedia of Artificial Intelligence, Wiley, 1991. In preparation.

    Google Scholar 

  29. N. Dershowitz, S. Kaplan, and D. A. Plaisted. Rewrite, Rewrite, Rewrite, Rewrite, Rewrite,.... Theoretical Computer Science, 1991. In press.

    Google Scholar 

  30. N. Dershowitz, L. Marcus, and A. Tarlecki. Existence, Uniqueness, and Construction of Rewrite Systems. Technical Report ATR-85(8354)-7, Computer Science Laboratory, The Aerospace Corporation, El Segundo, CA, December 1985.

    Google Scholar 

  31. N. Dershowitz and M. Okada. A rationale for conditional equational programming. Theoretical Computer Science, 75:111–138, 1990.

    Google Scholar 

  32. F. Fages. Associative-commutative unification. J. Symbolic Computation, 3(3):257–275, June 1987.

    Google Scholar 

  33. Proceedings of an NSF Workshop on the Rewrite Rule Laboratory, Schenectady, NY, Sep. 1983. Report 84GEN008, General Electric Research and Development (April 1984).

    Google Scholar 

  34. R. Gilleron. Decision problems for term rewriting systems and recognizable tree languages. In Proceddings of STACS, 1991. To appear.

    Google Scholar 

  35. J. R. Hindley and J. P. Seldin. Introduction to Combinators and λ-Calculus. Cambridge University Press, 1986.

    Google Scholar 

  36. J. Hsiang. Refutational theorem proving using term-rewriting systems. Artificial Intelligence, 25:255–300, March 1985.

    Google Scholar 

  37. G. Huet. A complete proof of correctness of the Knuth-Bendix completion algorithm. J. Computer and System Sciences, 23(1):11–21, 1981.

    Google Scholar 

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

    Google Scholar 

  39. G. Huet and J.-J. Lévy. Computations in orthogonal term rewriting systems. In J.-L. Lassez and G. Plotkin, eds., Computational Logic: Essays in Honour of Alan Robinson, MIT Press, Cambridge, MA, to appear.

    Google Scholar 

  40. J.-P. Jouannaud, ed. Rewriting Techniques and Applications. Academic Press, London, 1987.

    Google Scholar 

  41. J.-P. Jouannaud, ed. Rewriting Techniques and Applications (Proceedings, Dijon, France), Springer, Berlin, May 1985. Vol. 202 of Lecture Notes in Computer Science.

    Google Scholar 

  42. J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In J.-L. Lassez and G. Plotkin, eds., Computational Logic: Essays in Honor of Alan Robinson, MIT Press, Cambridge, MA, 1991. To appear.

    Google Scholar 

  43. J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM J. on Computing, 15:1155–1194, Nov. 1986.

    Google Scholar 

  44. J.-P. Jouannaud and P. Lescanne. Rewriting systems. Technology and Science of Informatics, 6(3):181–199, 1987. French version: “La réécriture”, Technique et Science de l'Informatique (1986), vol. 5, no. 6, pp. 433–452.

    Google Scholar 

  45. J.-P. Jouannaud and C. Marché. Completion modulo associativity, commutativity and identity. In A. Miola, editor, Proceedings of DISCO, Capri, Italy, Apr. 1990. Vol. 429 in Lecture Notes in Computer Science, Springer, Berlin.

    Google Scholar 

  46. J.-P. Jouannaud and M. Okada. Satisfiability of systems of ordinal notations enjoying the subterm property is decidable. 1991. Submitted.

    Google Scholar 

  47. S. Kaplan and J.-P. Jouannaud, eds. Conditional Term Rewriting Systems (Proceedings, Orsay, France, July 1987), Springer, Berlin, 1988. Vol. 308 of Lecture Notes in Computer Science.

    Google Scholar 

  48. D. Kapur and P. Narendran. An equational approach to theorem proving in first-order predicate calculus. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pp. 1146–1153, Los Angeles, CA, Aug. 1985.

    Google Scholar 

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

    Google Scholar 

  50. J. R. Kennaway. Sequential evaluation strategies for parallel-or and related reduction systems. Annals of Pure and Applied Logic, 43:31–56, 1989.

    Google Scholar 

  51. J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries. Transfinite reductions in orthogonal term rewriting systems (Extended abstract). In R. Book, editor, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications, Como, Italy, Apr. 1991. In Lecture Notes in Computer Science, Springer, Berlin.

    Google Scholar 

  52. L. Kirby and J. Paris. Accessible independence results for Peano arithmetic. Bulletin London Mathematical Society, 14:285–293, 1982.

    Google Scholar 

  53. C. Kirchner. Computing unification algorithms. In Proceedings of the First IEEE Symposium on Logic in Computer Science, pp. 206–216, Cambridge, Massachussets, June 1986.

    Google Scholar 

  54. C. Kirchner and H. Kirchner. Rewriting: Theory and Applications. North-Holland, 1991. In preparation.

    Google Scholar 

  55. J. W. Klop. Combinatory reduction systems. Vol. 127 of Mathematical Centre Tracts, Mathematisch Centrum, 1980.

    Google Scholar 

  56. J. W. Klop. Term rewriting systems: A tutorial. Bulletin of the European Association for Theoretical Computer Science, 32:143–183, June 1987.

    Google Scholar 

  57. J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, eds., Handbook of Logic in Computer Science, Oxford University Press, Oxford, 1991. To appear.

    Google Scholar 

  58. J. W. Klop and A. Middeldorp. Sequentiality in Orthogonal Term Rewriting Systems. Report CS-R8932, Centre for Mathematics and Computer Science, Amsterdam, 1989.

    Google Scholar 

  59. J. W. Klop and R. C. de Vrijer. Unique normal forms for lambda calculus with surjective pairing. Information and Computation, 80:97–113, 1989.

    Google Scholar 

  60. J. W. Klop and R. C. de Vrijer. Term Rewriting Systems. Cambridge University Press, Cambridge, 1991. In preparation.

    Google Scholar 

  61. M. S. Krishnamoorthy and P. Narendran. On recursive path ordering. Theoretical Computer Science, 40:323–328, 1985.

    Google Scholar 

  62. G. Kucherov. On relationship between term rewriting systems and regular tree languages. In R. Book, editor, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications, Como, Italy, Apr. 1991. In Lecture Notes in Computer Science, Springer, Berlin.

    Google Scholar 

  63. D. S. Lankford. On Proving Term Rewriting Systems are Noetherian. Memo MTP-3, Mathematics Department, Louisiana Tech. University, Ruston, LA, May 1979. Revised October 1979.

    Google Scholar 

  64. J. Lassez and K. G. Marriott. Explicit representation of terms defined by counter examples. J. Automated Reasoning, 3(3):1–17, Sep. 1987.

    Google Scholar 

  65. P. Le Chenadec. Canonical Forms in Finitely Presented Algebras. Pitman-Wiley, London, 1985.

    Google Scholar 

  66. P. Lescanne, ed. Rewriting Techniques and Applications (Proceedings, Bordeaux, France), Springer, Berlin, May 1987. Vol. 256 of Lecture Notes in Computer Science.

    Google Scholar 

  67. P. Lescanne, ed. Rewriting Techniques and Applications II (Special Issue). Vol. 67 (2&3) of Theoretical Computer Science, North-Holland, 1989.

    Google Scholar 

  68. P. Lescanne. Well rewrite orderings. In J. Mitchell, editor, Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pp. 239–256, Philadelphia, PA, 1990.

    Google Scholar 

  69. 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, pp. 348–357, Computer Society Press, Edinburgh, UK, July 1988.

    Google Scholar 

  70. Y. Métivier. Calcul de longueurs de chaînes de réécriture dans le monoïde libre. Theoretical Computer Science, 35(1):71–87, Jan. 1985.

    Google Scholar 

  71. A. Middeldorp. Modular aspects of properties of term rewriting systems related to normal forms. In N. Dershowitz, editor, Proceedings of the Third International Conference on Rewriting Techniques and Applications, pp. 263–277, Chapel Hill, NC, Apr. 1989. Vol. 355 of Lecture Notes in Computer Science, Springer, Berlin.

    Google Scholar 

  72. A. Middeldorp. Modular Properties of Term Rewriting Systems. PhD thesis, Vrije University, Amsterdam, 1990.

    Google Scholar 

  73. J. Müller and R. Socher-Ambrosius. Topics in completion theorem proving. SEKI-Report SR-88-13, Fachbereich Informatik, Universität Kaiserslautern, Kaiserslautern, West Germany, 1988. To appear in J. of Symbolic Computation.

    Google Scholar 

  74. R. Nieuwenhuis and F. Orejas. Clausal rewriting. In S. Kaplan and M. Okada, eds., Extended Abstracts of the Second International Workshop on Conditional and Typed Rewriting Systems, pp. 81–88, Concordia University, Montreal, Canada, June 1990. Revised version to appear in Lecture Notes in Computer Science, Springer, Berlin.

    Google Scholar 

  75. M. J. O'Donnell. Equational Logic as a Programming Language. MIT Press, Cambridge, MA, 1985.

    Google Scholar 

  76. M. J. O'Donnell. Programming with equations. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, eds., Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford, 1991. To appear.

    Google Scholar 

  77. M. Okada, ed. Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems (Montreal, Canada), 1991. Lecture Notes in Computer Science, Springer, Berlin.

    Google Scholar 

  78. M. Oyamaguchi. The Church-Rosser property for ground term rewriting systems is decidable. Theoretical Computer Science, 49(1), 1987.

    Google Scholar 

  79. G. E. Peterson and M. E. Stickel. Complete sets of reductions for some equational theories. J. of the Association for Computing Machinery, 28(2):233–264, Apr. 1981.

    Google Scholar 

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

    Google Scholar 

  81. D. A. Plaisted. Term rewriting systems. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, eds., Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford, 1991. To appear.

    Google Scholar 

  82. D. A. Plaisted. Equational reasoning and term rewriting systems. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, eds., Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford, 1991. To appear.

    Google Scholar 

  83. J. Siekmann. Universal unification. In R. E. Shostak, editor, Proceedings of the Seventh International Conference on Automated Deduction, pp. 1–42, Napa, CA, May 1984. Vol. 170 of Lecture Notes in Computer Science, Springer, Berlin.

    Google Scholar 

  84. M. R. Sleep. An Introduction to Rewriting. John Wiley, Chichester, England, 1992. In preparation.

    Google Scholar 

  85. W. Snyder. (Computing the Lexicographic Path Ordering). Technical Report, Boston University, Boston, MA, 1990.

    Google Scholar 

  86. C. Squier. Word problems and a homological finiteness condition for monoids. J. of Pure and Applied Algebra, 1991. To appear.

    Google Scholar 

  87. S. Thatte. A refinement of strong sequentiality for term rewriting with constructors. Information and Computation, 72:46–65, 1987.

    Google Scholar 

  88. M. Thomas, ed. Term Rewriting (Special Issue). Vol. 34 (1) of Computer J., Feb. 1991.

    Google Scholar 

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

    Google Scholar 

  90. R. Treinen. A new method for undecidability proofs of first order theories. LNCS 472, 48–62.

    Google Scholar 

  91. M. Venturini-Zilli. Reduction graphs in the Lambda Calculus. Theoretical Computer Science, 29:251–275, 1984.

    Google Scholar 

  92. R. C. de Vrijer. Extending the lambda calculus with surjective pairing is conservative. In Proceedings of the Fourth IEEE Symposium on Logic in Computer Science, pp. 204–215, 1989.

    Google Scholar 

  93. R. C. de Vrijer. Unique normal forms for Combinatory Logic with Parallel Conditional, a case study in conditional rewriting. Technical Report, Free University, Amsterdam, 1990.

    Google Scholar 

  94. H. Zhang. A New Strategy for the Boolean Ring Based Approach to First Order Theorem Proving. Technical Report, Department of Computer Science, The University of Iowa, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois, 1304 West Springfield Avenue, 61801, Urbana, IL, U.S.A.

    Nachum Dershowitz

  2. Laboratoire de Recherche en Informatique, Bat. 490, Université de Paris Sud, 91405, Orsay, France

    Jean-Pierre Jouannaud

  3. CWI, Kruislaan 413, 1098 SJ, Amsterdam, The Netherlands

    Jan Willem Klop

  4. Department of Mathematics and Computer Science, Free University, de Boelelaan 1081, 1081 HV, Amsterdam, The Netherlands

    Jan Willem Klop

Authors
  1. Nachum Dershowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Pierre Jouannaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan Willem Klop
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ronald V. Book

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dershowitz, N., Jouannaud, JP., Klop, J.W. (1991). Open problems in rewriting. In: Book, R.V. (eds) Rewriting Techniques and Applications. RTA 1991. Lecture Notes in Computer Science, vol 488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53904-2_120

Download citation

  • DOI: https://doi.org/10.1007/3-540-53904-2_120

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53904-9

  • Online ISBN: 978-3-540-46383-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation