Nachum Dershowitz


PUBLICATIONS ON REWRITING



  1. Maria Paola Bonacina and Nachum Dershowitz, March 2013, “Canonical Ground Horn Theories”, Programming Logics: Essays in Memory of Harald Ganzinger, Andreas Podelski, Andrei Voronkov, and Reinhard Wilhelm, eds., Lecture Notes in Computer Science, vol. 7797, Springer-Verlag, Berlin, pp. 35-71.
  2. Nachum Dershowitz, Dec. 2012, “Jumping and Escaping: Modular Termination and the Abstract Path Ordering”, Theoretical Computer Science, Special issue: New Directions in Rewriting (Honoring the 60th Birthday of Yoshihito Toyama), vol. 464, pp. 35-47.
  3. Nachum Dershowitz, May 2009, “On Lazy Commutation”, Languages: From Formal to Natural: Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday, Orna Grumberg, Michael Kaminski, Shmuel Katz, and Shuly Wintner, eds., Lecture Notes in Computer Science, vol. 5533, Springer-Verlag, Berlin, pp. 59-82.
  4. Nachum Dershowitz, Aug. 2008, “Canonicity!”, Proceedings of the Fourth International Joint Conference on Automated Reasoning, Sydney, Australia, Lecture Notes in Computer Science, A. Armando, P. Baumgartner, and G. Dowek, eds., Springer-Verlag, Berlin, pp. 327-331.
  5. Maria Paola Bonacina and Nachum Dershowitz, Aug. 2008, “Canonical Inference for Implicational Systems”, Proceedings of the Fourth International Joint Conference on Automated Reasoning, Sydney, Australia. Lecture Notes in Computer Science, A. Armando, P. Baumgartner, and G. Dowek, eds., Springer-Verlag, Berlin, pp. 380-395.
  6. Nachum Dershowitz, Aug. 2008, “Bit Inference”, Workshop on Practical Aspects of Automated Reasoning, Sydney, Australia, pp. 26-35.
  7. Maria Paola Bonacina and Nachum Dershowitz, Jan. 2007, “Abstract Canonical Inference”, ACM Transactions on Computational Logic, vol. 8, no. 1, article 6. 
  8. Nachum Dershowitz and E. Castedo Ellerman, Apr. 2007, “Leanest Quasi-Orderings”, Information and Computation, vol. 205, no. 4, pp. 535-556; available online 23 January 2007. 
  9. Nachum Dershowitz and Georg Moser, “The Hydra Battle Revisited”, June 2007, Rewriting, Computation and Proof -- Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday, Lecture Notes in Computer Science, vol. 4600, Springer-Verlag, Berlin, pp. 1-27. 
  10. Maria Paola Bonacina and Nachum Dershowitz, Oct. 2007, “Canonical Ground Horn Theories”, Research Report 49/2007, Dipartimento di Informatica, Università degli Studi di Verona.
  11. Nachum Dershowitz and Claude Kirchner, July 2006, “Abstract Canonical Presentations”, Theoretical Computer Science, vol. 357, nos. 1-3, pp. 53-69. 
  12. Nachum Dershowitz, Guan-Shieng Huang, and Mitchell A. Harris, Oct. 2006, “Enumeration Problems Related to Ground Horn Theories”, Informal publication, arXiv:cs/0610054v2 [cs.LO].
  13. Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, and Daher Kaiss, Nov. 2006, “Boolean Rings for Intersection-Based Satisfiability”, 13th International Conference on Logic for Programming and Artificial Intelligence and Reasoning (Phnom Penh, Cambodia), Miki Hermann and Andrei Voronkov, eds., Lecture Notes in Computer Science, vol. 4246, Springer-Verlag, Berlin, pp. 482-496. 
  14. Nachum Dershowitz and E. Castedo Ellerman, April 2005, “Leanest Quasi-Orderings (Preliminary version)”, Proceedings of the Sixteenth International Conference on Rewriting Techniques and Applications (Nara, Japan), J. Giesl, ed., Lecture Notes in Computer Science, vol. 3467, Springer-Verlag, Berlin, pp. 32-45. 
  15. Nachum Dershowitz, “Open. Closed. Open.”, April 2005, Proceedings of the Sixteenth International Conference on Rewriting Techniques and Applications (Nara, Japan), J. Giesl, ed., Lecture Notes in Computer Science, vol. 3467, Springer-Verlag, Berlin, pp. 376-393. 
  16. Nachum Dershowitz, May 2005, “Term Rewriting Systems by `Terese' (Marc Bezem, Jan Willem Klop, and Roel de Vrijer, eds.): Book review”, Theory and Practice of Logic Programming, vol. 5, no. 3, pp. 391-395. 
  17. Nachum Dershowitz, Dec. 2005, “Primitive Rewriting”, A. Middeldorp, V. van Oostrom, F. van Raamsdonk, and R. de Vrijer, eds., Processes, Terms and Cycles: Steps on the Road to Infinity. Essays Dedicated to Jan Willem Klop on the Occasion of his 60th Birthday, Lecture Notes in Computer Science, vol. 3838, Springer-Verlag, Berlin, pp. 127-147.
  18. Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, and Daher Kaiss, May 2004, “Boolean Ring Satisfiability”, Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), Vancouver, BC, Canada, pp. 281-286.
  19. Maria Paola Bonacina and Nachum Dershowitz, May 2004, “Abstract Canonical Inference”, Research Report 18/2004, Dipartimento di Informatica, Università degli Studi di Verona.
  20. Maria Paola Bonacina and Nachum Dershowitz, May 2004, “Abstract Canonical Inference”, Informal publication, arXiv.org.
  21. Nachum Dershowitz, Sept. 2004, “Termination by Abstraction”, Proceedings of the Twentieth International Conference on Logic Programming, St. Malo, France, Lecture Notes in Computer Science, vol. 3132, Springer-Verlag, Berlin, pp. 1-18.
  22. Nachum Dershowitz, April 2003, “Ground Canonicity”, Informal publication, arXiv:cs/0304017v1 [cs.LO].
  23. Nachum Dershowitz, May 2003, “Canonicity”, Proceedings of the Fourth International Workshop on First-Order Theorem Proving (FTP'03), Valencia, Spain, I. Dahn and L. Vigneron, eds., pp. 147-158; Electronic Notes in Theoretical Computer Science, vol. 86, no. 1. 
  24. Nachum Dershowitz and Claude Kirchner, June 2003, “Abstract Saturation-Based Inference”, Proceedings of the Eighteenth IEEE Symposium on Logic in Computer Science, Ottawa, pp. 65-74.
  25. Nachum Dershowitz, June 2003, “Termination Dependencies” (Extended Abstract), Proceedings of the Sixth International Workshop on Termination (WST '03), A. Rubio, ed., Valencia, Spain, pp. 27-30.
  26. Nachum Dershowitz and Iddo Tzameret, June 2003, “Quasi-Ordered Gap Embedding” (Extended Abstract), June 2003, Proceedings of the Sixth International Workshop on Termination (WST '03), A. Rubio, ed., Valencia, Spain, pp. 30-34.
  27. Nachum Dershowitz and Iddo Tzameret, Aug. 2003, “Gap Embedding for Well-Quasi Orderings”, Proceedings of the 10th Workshop on Logic, Language, Information and Computation, Ouro Preto, Minas Gerais, Brazil; Electronic Notes in Computer Science, vol. 84, pp. 80-90, Sept. 2003.
  28. Daher Kaiss, and Nachum Dershowitz, Nov. 2003, “Boosting Satisfiability Testing Using Boolean Rings” (Poster), Proceedings of the IEEE International Conference on Software – Science, Technology & Engineering, Herzelia, Israel.
  29. Claude Kirchner and Nachum Dershowitz, July 2002, “Abstract Canonical Inference Systems” (Abstract), 16th International Workshop on Unification, Copenhagen, Denmark.
  30. Nachum Dershowitz and David A. Plaisted, 2001, “Rewriting”, chap. 9 in: Handbook of Automated Reasoning, vol. 1, A. Robinson and A. Voronkov, eds., Elsevier, pp. 535-610. Reviewed in Zbl 0992.68123.
  31. Nachum Dershowitz, editor, May 2001, Extended Abstracts of the Fifth International Workshop on Termination (WST '01), Utrecht, Logic Group Preprint Series No. 209, Institute of Philosophy, Utrecht University, Utrecht, The Netherlands.
  32. Nachum Dershowitz and Claude Kirchner, Dec. 2001, “Inversion Strategies”, Workshop on Rule-Based Constraint Reasoning and Programming (RCoRP'01), Cyprus.
  33. Nachum Dershowitz, Sept. 1999, “Sharing Constructors” (Abstract), 14th International Workshop on Algebraic Development Techniques, Bonas, France.
  34. Nachum Dershowitz and Naomi Lindenstrauss, 2000, “Abstract And Parallel Machines”, Computers and Artificial Intelligence, vol. 19, pp. 475-493.
  35. Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, and Alexander Serebrenik, May 1999, “When Linear Forms are not Enough” (Abstract), Abstracts of the Fifth International Workshop on Termination, Dagstuhl, Germany.
  36. Nachum Dershowitz, May 1999, “Undecidability Results that Follow from Results in Recursion Theory” (Abstract), Abstracts of the Fifth International Workshop on Termination, Dagstuhl, Germany.
  37. Nachum Dershowitz, June 1999, “The Power of Simplification: A Survey on Rewriting in Theorem Proving” (Abstract), Bar-Ilan Symposium on Foundations of Artificial Intelligence.
  38. Nachum Dershowitz and Subrata Mitra, July 1999, “Jeopardy”, Proceedings of the Tenth International Conference on Rewriting Techniques and Applications (Trento, Italy), P. Narendran and M. Rusinowitch, eds., Lecture Notes in Computer Science, vol. 1631, Springer-Verlag, Berlin, pp. 16-29.
  39. Nachum Dershowitz and Ralf Treinen, Mar. 1998, “An On-line Database of Open Questions”, Proceedings of the Ninth International Conference on Rewriting Techniques and Applications (Japan), T. Nipkow, ed., Lecture Notes in Computer Science, vol. 1379, Springer-Verlag, Berlin, pp. 332-342.
  40. Nachum Dershowitz and Subrata Mitra, July 1998, “Function Inversion”, Proceedings of the 5th Workshop of Logic, Language, Information and Computation, R. J. G. B. de Queiroz and M. Finger, eds., University of São Paulo, São Paulo, Brazil, pp. 55-59.
  41. Nachum Dershowitz, Sept. 1998, “Calendar Function Inversion” (Abstract), CCL II Workshop, Jerusalem, Israel.
  42. Nachum Dershowitz and Ralf Treinen, 1998-, “The Complete List of RTA Open Problems”, maintained online at http://rtaloop.mancoosi.univ-paris-diderot.fr.
  43. Nachum Dershowitz, Naomi Lindenstrauss, and Yehoshua Sagiv, May 1997, “What Norms are Useful for Logic Programs?” (Abstract), Extended Abstracts of the Third International Termination Workshop (Ede, The Netherlands), T. Arts, ed., Universiteit Utrecht, Utrecht, The Netherlands.
  44. Nachum Dershowitz, May 1997, “Well-Quasi Orderings and Some Applications” (Abstract), Extended Abstracts of the Third International Termination Workshop (Ede, The Netherlands), T. Arts, ed., Universiteit Utrecht, Utrecht, The Netherlands.
  45. Nachum Dershowitz, June 1997, “Innocuous Constructor-Sharing Combinations”, Proceedings of the Eighth International Conference on Rewriting Techniques and Applications (Sitges, Spain), H. Comon, ed., Lecture Notes in Computer Science, vol. 1232, Springer-Verlag, Berlin, pp. 202-216.
  46. Nachum Dershowitz, Aug. 1997, “When are Two Rewrite Systems More than None?”, Proceedings of the Twenty-Second International Symposium on Mathematical Foundations of Computer Science (Bratislava, Slovakia), I. Pr'ivara and P. Ruzicka, eds., Lecture Notes in Computer Science, vol. 1295, Springer-Verlag, Berlin, pp. 37-43.
  47. Nachum Dershowitz and Naomi Lindenstrauss, Aug. 1997, “Abstract And-Parallel Machines”, Proceedings of the Third International Euro-Par Conference on Parallel Processing (Passau, Germany), C. Lengauer, M. Griebl, and S. Gorlatch, eds., Lecture Notes in Computer Science, vol. 1300, Springer-Verlag, Berlin, pp. 1221-1225.
  48. Subrata Mitra and Nachum Dershowitz, January 1996, “Matching and Unification in Rewrite Theories”, Technical Report ADTI-1996-001, IBM Software Solutions Division, San Jose, CA.
  49. Nachum Dershowitz, May 1996, “Trees, Ordinals, and Termination” (Abstract), Proceedings of the 3rd Workshop on Logic, Language, Information and Computation, Salvador, Brazil.
  50. Nachum Dershowitz, Sept. 1996, “Narrowing Streams” (Abstract), CCL II Workshop, Escorial, Spain.
  51. Nachum Dershowitz and Laurent Vigneron, “Rewriting Home Page” (web page), maintained online at http://www.rewriting.org.
  52. Nachum Dershowitz, Mar. 1995, “Rewrite-Based Deduction: Expansion and Contraction” (Abstract), Seminar Report No. 110, Dagstuhl Seminar on Deduction, W. Bibel, K. Furikawa, and M. Stickel, eds., p. 10.
  53. Nachum Dershowitz, Jean-Pierre Jouannaud, and Jan Willem Klop, Feb. 1995, “Problems in Rewriting III”, Technical report IR-380, Computer Science, Vrije University, Amsterdam.
  54. Nachum Dershowitz, Jean-Pierre Jouannaud, and Jan Willem Klop, Apr. 1995, “Problems in Rewriting III”, Proceedings of the Sixth International Conference on Rewriting Techniques and Applications (Kaiserslautern, Germany), J. Hsiang, ed., Lecture Notes in Computer Science, vol. 914, Springer-Verlag, Berlin, pp. 457-471.
  55. Nachum Dershowitz, 1995, “Contextual Termination” (Abstract), Second International Workshop on Termination, La Bresse, France.
  56. Nachum Dershowitz and Charles Hoot, May 1995, “Natural Termination”, Theoretical Computer Science, vol. 142, no. 2, pp. 179-207. 
  57. Nachum Dershowitz, 1995, “33 Examples of Termination”, in: French Spring School of Theoretical Computer Science Advanced Course on Term Rewriting (Font Romeaux, France, May 1993), H. Comon and J.-P. Jouannaud, eds., Lecture Notes in Computer Science, vol. 909, Springer-Verlag, Berlin, pp. 16-26.
  58. Subrata Mitra and Nachum Dershowitz, May 1995, “Matching and Unification in Restricted Convergent Systems”, Technical Report ADTI-1995-007, IBM Software Solutions Division, San Jose, CA.
  59. Nachum Dershowitz and Naomi Lindenstrauss, editors, 1995, Proceedings of the International Workshop on Conditional and Typed Rewriting Systems (Jerusalem, Israel, July 1994), Lecture Notes in Computer Science, vol. 968, Springer-Verlag, Berlin, (375+viii pages).
  60. Nachum Dershowitz, 1995, “Hierarchical Termination”, Proceedings of the International Workshop on Conditional and Typed Rewriting Systems (Jerusalem, Israel, July 1994), N. Dershowitz and N. Lindenstrauss, eds., Lecture Notes in Computer Science, vol. 968, Springer-Verlag, Berlin, pp. 89-105.
  61. Nachum Dershowitz, Dec. 1995, “Goal Solving as Operational Semantics”, Proceedings of the International Logic Programming Symposium, Portland, OR, J. Lloyd, ed., MIT Press, Cambridge, MA, pp. 3-17.
  62. Leo Bachmair and Nachum Dershowitz, Mar. 1994, “Equational Inference, Canonical Proofs, and Proof Orderings”, J. of the Association of Computing Machinery, vol. 41, no. 2, pp. 236-276. 
  63. Nachum Dershowitz and Naomi Lindenstrauss, eds., July 1994, Abstracts of the International Workshop on Conditional (and Typed) Rewriting Systems, Hebrew University, Jerusalem, Israel.
  64. Nachum Dershowitz, July 1994, “Hierarchical Termination” (Extended Abstract), Abstracts of the International Workshop on Conditional (and Typed) Rewriting Systems, Hebrew University, Jerusalem, Israel.
  65. Nachum Dershowitz, Oct. 1994, “From Specifications to Programs: Induction in the Service of Synthesis” (Abstract), Proceedings of the Fourth International Workshop on Analogical and Inductive Inference (Reinhardsbrunn Castle, Germany), S. Arikawa and K. Jantke, eds., Lecture Notes in Artificial Intelligence, vol. 872, Springer-Verlag, Berlin, pp. 6-7.
  66. Nachum Dershowitz and Subrata Mitra, Jan. 1993, “Path Orderings for Termination of Associative-Commutative Rewriting”, Proceedings of the Third International Workshop on Conditional Rewriting Systems (Pont-a-Mousson, France, July 1992), M. Rusinowitch, ed., Lecture Notes in Computer Science, vol. 656, Springer-Verlag, Berlin, pp. 168-174.
  67. Nachum Dershowitz, Jan. 1993, “Semigroups Satisfying xm+n= xn”, Proceedings of the Third International Workshop on Conditional Rewriting Systems (Pont-a-Mousson, France, July 1992), M. Rusinowitch, ed., Lecture Notes in Computer Science, vol. 656, Springer-Verlag, Berlin, pp. 307-314.
  68. Nachum Dershowitz and Subrata Mitra, 1993, “Higher-Order Unification with Convergent Systems”, Preliminary Papers of the International Workshop on Higher-Order Rewriting, Amsterdam, The Netherlands.
  69. Nachum Dershowitz, 1993, “A Taste of Rewrite Systems”, in: Functional Programming, Concurrency, Simulation and Automated Reasoning, P. Lauer and J. Zucker, eds., Springer-Verlag, Berlin, Lecture Notes in Computer Science, vol. 693, pp. 199-228.
  70. Nachum Dershowitz, Apr. 1993, “Trees, Ordinals, and Termination”, Proceedings of the Fourth International Joint Conference on Theory and Practice of Software Development (Orsay, France), M.-C. Gaudel and J.-P. Jouannaud, eds., Lecture Notes in Computer Science, vol. 668, Springer-Verlag, Berlin, pp. 243-250.
  71. Yuh-jeng Lee and Nachum Dershowitz, May 1993, “Debugging Logic Programs Using Specifications”, Proceedings of the First International Workshop on Automated and Algorithmic Debugging (Linkoping, Sweden), Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 64-78.
  72. Nachum Dershowitz and Charles Hoot, June 1993, “Topics in Termination”, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), C. Kirchner, ed., Lecture Notes in Computer Science, Berlin, Springer-Verlag.
  73. Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem Klop, 1993, “More Problems in Rewriting”, Report CS-R9332, Centrum voor Wiskunde en Informatica, Amsterdam.
  74. Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem Klop, June 1993, “More Problems in Rewriting”, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), C. Kirchner, ed., Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 468-487.
  75. Nachum Dershowitz, 1993, “A Taste of Rewriting”, Leibnitz Center for Research in Computer Science, Hebrew University, Technical report 93-5, Jerusalem, Israel.
  76. Nachum Dershowitz and Uday Reddy, 1993, “Deductive and Inductive Synthesis of Equational Programs”, J. of Symbolic Computation, vol. 15, pp. 467-494.
  77. Nachum Dershowitz and Yuh-jeng Lee, 1993, “Logical Debugging”, J. of Symbolic Computation, vol. 15, pp. 745-773.
  78. Nachum Dershowitz and Subrata Mitra, Dec. 1993, “Higher-Order and Semantic Unification”, Proceedings of the Thirteenth Conference on Foundations of Software Technology and Theoretical Computer Science (Bombay, India), Lecture Notes in Computer Science, vol. 761, Springer-Verlag, Berlin, pp. 139-150.
  79. Nachum Dershowitz, 1992, “Rewriting Methods for Word Problems”, in: Words, Languages & Combinatorics (Proceedings of the International Colloquium, Kyoto, Japan, Aug. 1990), M. Ito, ed., World Scientific, Singapore, pp. 104-118.
  80. Leo Bachmair and Nachum Dershowitz, Apr. 1992, “Equational Inference, Canonical Proofs, and Proof Orderings”, Report DCS-R-92-1746, Department of Computer Science, University of Illinois, Urbana, IL.
  81. Nachum Dershowitz and Subrata Mitra, July 1992, “RPO for AC-Termination”, Preliminary Papers of the Third International Workshop on Conditional Rewriting Systems, Pont-a-Mousson, France, M. Rusinowitch, ed., pp. 96-100.
  82. Nachum Dershowitz, July 1992, “Bands and Related Semigroups”, Preliminary Papers of the Third International Workshop on Conditional Rewriting Systems, M. witch, ed., Pont-a-Mousson, France, pp. 162-164.
  83. Nachum Dershowitz and Edward M. Reingold, July 1992, “Ordinal Arithmetic with List Expressions”, Proceedings of the Symposium on Logical Foundations of Computer Science (Tver, Russia), A. Nerode and M. Taitslin, eds., Lecture Notes in Computer Science, vol. 620, Springer-Verlag, Berlin, pp. 117-126.
  84. Nachum Dershowitz, Subrata Mitra, and G. Sivakumar, June 1992, “Decidable Matching for Convergent Systems”, Proceedings of the Eleventh Conference on Automated Deduction (Saratoga Springs, NY), D. Kapur, ed., Lecture Notes in Artificial Intelligence, vol. 607, Springer-Verlag, Berlin, pp. 589-602.
  85. Nachum Dershowitz and Jean-Pierre Jouannaud, Feb. 1991, “Notations for Rewriting”, Bulletin of the European Association of Theoretical Computer Science, no. 43, pp. 162-172.
  86. Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem Klop, 1991, “Open Problems in Rewriting”, Proceedings of the Fourth International Conference on Rewriting Techniques and Applications (Como, Italy), R. Book, ed., Lecture Notes in Computer Science, vol. 488, Springer-Verlag, Berlin, pp. 445-456.
  87. Nachum Dershowitz, 1991, “A Maximal-Literal Unit Strategy for Horn Clauses”, Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems (Montreal, Canada, June 1990), S. Kaplan and M. Okada, eds., Lecture Notes in Computer Science, vol. 516, Springer-Verlag, Berlin, pp. 14-25.
  88. Nachum Dershowitz, June 1991, “Infinite Rewriting” (Abstract), Abstracts of an International Symposium on Theoretical Computer Science in honor of Boris A. Trakhtenbrot, Tel-Aviv University, Tel-Aviv, Israel.
  89. Nachum Dershowitz, June 1991, “Natural Termination Proofs”, Proceedings of the Bar-Ilan Symposium on Foundations of Artificial Intelligence, Bar-Ilan University, Ramat-Gan, Israel.
  90. Nachum Dershowitz, July 1991, “Canonical Sets of Horn Clauses”, Proceedings of the Eighteenth International Colloquium on Automata, Languages and Programming (Madrid, Spain), J. Leach Albert, B. Monien and M. Rodriguez Artalejo, eds., Lecture Notes in Computer Science, vol. 510, Springer-Verlag, Berlin, pp. 267-278.
  91. Nachum Dershowitz, Aug. 1991, “Ordering-Based Strategies for Horn Clauses”, Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pp. 118-124, Sydney, Australia.
  92. Nachum Dershowitz, Stéphane Kaplan, and David A. Plaisted, 1991, “Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, ...”, Theoretical Computer Science, vol. 83, no. 1, pp. 71-96. Reviewed in Computing Reviews 9208-0604. 
  93. Nachum Dershowitz, Jean-Pierre Jouannaud, and Jan Willem Klop, Dec. 1991, “Open Problems in Rewriting”, Technical report CS-R9114, Computer Science, CWI, Amsterdam.
  94. Nachum Dershowitz and Jean-Pierre Jouannaud, 1990, “Rewrite Systems”, in: Handbook of Theoretical Computer Science, vol. B: Formal Methods and Semantics, chap. 6, pp. 243-320, J. van Leeuwen, ed., North-Holland, Amsterdam.
  95. Nachum Dershowitz and Mitsuhiro Okada, 1990, “A Rationale for Conditional Equational Programming”, Theoretical Computer Science, vol. 75, pp. 111-138. 
  96. Nachum Dershowitz, June 1990, “A Maximal-Literal Unit Strategy for Horn Clauses”, Extended Abstracts of the Second International Workshop on Conditional and Typed Rewriting Systems, S. Kaplan and M. Okada, eds., Concordia University, Montreal, Canada, pp. 21-27.
  97. Nachum Dershowitz and E. Pinchover, July 1990, “Inductive Synthesis of Equational Programs”, Proceedings of the Eighth National Conference on Artificial Intelligence, AAAI, Boston, MA, pp. 234-239.
  98. Nachum Dershowitz, Aug. 1990, “Rewriting Methods for Word Problems”, Abstracts of International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, pp. 18-20.
  99. Nachum Dershowitz, Aug. 1990, “Infinite Rewriting”, Proceedings of Toyohashi Symposium on Theoretical Computer Science, K. Hashiguchi, ed., Toyohashi, Japan, pp. 27-31.
  100. Nachum Dershowitz, Subrata Mitra, and G. Sivakumar, Oct. 1990, “Equation Solving in Conditional AC-Theories”, Proceedings of the Second Conference on Algebraic and Logic Programming (Nancy, France), H. Kirchner and W. Wechler, eds., Lecture Notes in Computer Science, vol. 463, Springer-Verlag, Berlin, pp. 283-297.
  101. Nachum Dershowitz and Naomi Lindenstrauss, Oct. 1990, “An Abstract Concurrent Machine for Rewriting”, Proceedings of the Second Conference on Algebraic and Logic Programming (Nancy, France), H. Kirchner and W. Wechler, eds., pp. 318-331, Lecture Notes in Computer Science, vol. 463, Springer-Verlag, Berlin.
  102. Nachum Dershowitz and Naomi Lindenstrauss, Oct. 1990, “A Parallel Implementation of Equational Programming”, Proceedings of the Fifth Jerusalem Conference on Information Technology, IEEE Computer Society, Jerusalem, Israel, pp. 426-435.
  103. Nachum Dershowitz and Stéphane Kaplan, Jan. 1989, “Rewrite, Rewrite, Rewrite, Rewrite, Rewrite,...”, Proceedings of the Sixteenth ACM Symposium on Principles of Programming Languages, Austin, TX, pp. 250-259.
  104. N. Alan Josephson and Nachum Dershowitz, Jan./Mar. 1989, “An Implementation of Narrowing”, J. Logic Programming, vol. 6, no. 1&2, pp. 57-77. 
  105. Nachum Dershowitz, editor, Apr. 1989, Third International Conference on Rewriting Techniques and Applications (Chapel Hill, NC), Lecture Notes in Computer Science, vol. 355, Springer-Verlag, Berlin (579+vii pages).
  106. Nachum Dershowitz and Jean-Pierre Jouannaud, Apr. 1989, “Rewrite Systems”, Laboratoire de Recherche en Informatique, Université de Paris-Sud, Rapport de Recherche 478, Orsay, France.
  107. Nachum Dershowitz and Naomi Lindenstrauss, June 1989, “Average Time Analyses Related to Logic Programming”, Proceedings of the Sixth International Conference on Logic Programming (Lisbon, Portugal), G. Levi and M. Martelli, eds., pp. 369-381, MIT Press, Cambridge, MA.
  108. Nachum Dershowitz, Stéphane Kaplan, and David A. Plaisted, July 1989, “Infinite Normal Forms”, European Association of Theoretical Computer Science, Proceedings of the Sixteenth International Colloquium on Automata, Languages and Programming (Stresa, Italy), Lecture Notes in Computer Science, vol. 372, Springer-Verlag, Berlin, pp. 249-262.
  109. Leo Bachmair, Nachum Dershowitz and David A. Plaisted, 1989, “Completion Without Failure”, in: Resolution of Equations in Algebraic Structures, vol. 2: Rewriting Techniques, H. Ait-Kaci and M. Nivat, eds., chap. 1, Academic Press, New York, pp. 1-30.
  110. Nachum Dershowitz, 1989, “Completion and Its Applications”, in: Resolution of Equations in Algebraic Structures, vol. 2: Rewriting Techniques, H. Ait-Kaci and M. Nivat, eds., chap. 2, Academic Press, New York, pp. 31-86. Reviewed in Math. Reviews 91h:68097.
  111. Leo Bachmair and Nachum Dershowitz, Oct. 1989, “Completion for Rewriting Modulo a Congruence”, Theoretical Computer Science, vol. 67, no. 2 & 3. 
  112. Leo Bachmair and Nachum Dershowitz, 1988, “Critical Pair Criteria for Completion”, J. of Symbolic Computation, vol. 6, no. 1, pp. 1-18. Reviewed in Math. Reviews 89j:68087.
  113. Nachum Dershowitz, Mitsuhiro Okada, and G. Sivakumar, May 1988, “Canonical Conditional Rewrite Systems”, Proceedings of the Ninth Conference on Automated Deduction (Argonne, IL), Lecture Notes in Computer Science, vol. 310, Springer-Verlag, Berlin, pp. 538-549. Reviewed in Zbl 667.68043.
  114. Nachum Dershowitz and Mitsuhiro Okada, July 1988, “Proof-Theoretic Techniques and the Theory of Rewriting”, Proceedings of the Third IEEE Symposium on Logic in Computer Science, Edinburgh, Scotland, pp. 104-111.
  115. Nachum Dershowitz and David A. Plaisted, 1988, “Equational Programming”, in: Machine Intelligence 11: The logic and acquisition of knowledge, J. E. Hayes, D. Michie and J. Richards, eds., chap. 2, Oxford Press, Oxford, pp. 21-56.
  116. Nachum Dershowitz, Leo Marcus and Andrzej Tarlecki, Aug. 1988, “Existence, Uniqueness, and Construction of Rewrite Systems”, SIAM J. of Computing, vol. 17, no. 4, pp. 629-639. Reviewed in Math. Reviews 89k:68090 and Zbl 658.68029. 
  117. Nachum Dershowitz and G. Sivakumar, Aug. 1988, “Goal-Directed Equation Solving”, Proceedings of the Seventh National Conference on Artificial Intelligence, AAAI, St. Paul, MN, pp. 166-170.
  118. Nachum Dershowitz and Mitsuhiro Okada, Nov. 1988, “Conditional Equational Programming and the Theory of Conditional Term Rewriting”, Proceedings of the International Conference on Fifth Generation Computer Systems, ICOT, pp. 337-346, Tokyo, Japan.
  119. Nachum Dershowitz, Feb./Apr. 1987, “Termination of Rewriting”, J. of Symbolic Computation, vol. 3, no. 1&2, pp. 69-115, Corrigendum: 4, 3 (Dec. 1987), 409-410. Reviewed in Computing Reviews 8810-0792 and Math. Reviews 88j:68099ab.
  120. Nachum Dershowitz, 1987, “Termination of Rewriting”, in: Rewriting Techniques and Applications, pp. 69-115, J.-P. Jouannaud, ed., Academic Press. Reprinted from Journal of Symbolic Computation.
  121. Nachum Dershowitz and Yuh-jeng Lee, Apr. 1987, “Deductive Debugging”, Report DCS-F-87-961, Department of Computer Science, University of Illinois, Urbana, IL.
  122. Nachum Dershowitz and Jieh Hsiang, May 1987, “Refutational Theorem Proving With Oriented Equations” (Abstract), Preliminary Proceedings of the Colloquium on the Resolution of Equations in Algebraic Structures, Lakeway, TX.
  123. Nachum Dershowitz, May 1987, “Completion and Its Applications”, Preliminary Proceedings of the Colloquium on the Resolution of Equations in Algebraic Structures, Lakeway, TX.
  124. Leo Bachmair and Nachum Dershowitz, May 1987, “Completion for Rewriting Modulo a Congruence”, Proceedings of the Second International Conference on Rewriting Techniques and Applications (Bordeaux, France), P. Lescanne, ed., Lecture Notes in Computer Science, vol. 256, Springer-Verlag, Berlin, pp. 192-203.
  125. Leo Bachmair and Nachum Dershowitz, June 1987, “Inference Rules for Rewrite-Based First-Order Theorem Proving”, Proceedings of the Second IEEE Symposium on Logic in Computer Science, Ithaca, NY, pp. 331-337.
  126. Leo Bachmair and Nachum Dershowitz, June 1987, “Critical Pair Criteria for Rewriting Modulo a Congruence” (Extended abstract), Proceedings of the 1987 European Conference on Computer Algebra (Symbolic and Algebraic Computation) (Leipzig, East Germany), J. H. Davenport, ed., Lecture Notes in Computer Science, vol. 378, Springer-Verlag, Berlin, pp. 452-453.
  127. Nachum Dershowitz, Mitsuhiro Okada, and G. Sivakumar, July 1987, “Confluence of Conditional Rewrite Systems”, Proceedings of the First International Workshop on Conditional Term Rewriting Systems (Orsay, France), S. Kaplan and J.-P. Jouannaud, eds., Lecture Notes in Computer Science, vol. 308, Springer-Verlag, Berlin, pp. 31-44. Reviewed in Zbl 666.68094.
  128. Nachum Dershowitz and G. Sivakumar, July 1987, “Solving Goals in Equational Languages”, Proceedings of the First International Workshop on Conditional Term Rewriting Systems (Orsay, France), S. Kaplan and J.-P. Jouannaud, eds., Lecture Notes in Computer Science, vol. 308, Springer-Verlag, Berlin, pp. 45-55. Reviewed in Zbl 666.68093.
  129. Nachum Dershowitz and Yuh-jeng Lee, Aug. 1987, “Deductive Debugging”, Proceedings of the Fourth IEEE Symposium on Logic Programming, San Francisco, CA, pp. 298-306.
  130. Nachum Dershowitz, 1986, “Program Abstraction and Instantiation”, in: Readings in Artificial Intelligence and Software Engineering, C. Rich and R. Waters, ed., chap. IX, Morgan Kaufmann, Los Altos, CA, pp. 475-490. Reprinted from ACM Transactions on Programming Languages and Systems.
  131. Nachum Dershowitz and David A. Plaisted, Apr. 1986, “Equational Programming”, Report R-86-1265, Department of Computer Science, University of Illinois, Urbana, IL.
  132. Leo Bachmair, Nachum Dershowitz and Jieh Hsiang, June 1986, “Orderings for Equational Proofs”, Proceedings of the IEEE Symposium on Logic in Computer Science, Cambridge, MA, pp. 346-357. Winner of LICS 2006 “Test-of-time” award.
  133. Leo Bachmair and Nachum Dershowitz, July 1986, “Commutation, Transformation, and Termination”, Proceedings of the Eighth International Conference on Automated Deduction (Oxford, England), J. H. Siekmann, ed., Lecture Notes in Computer Science, vol. 230, Springer-Verlag, Berlin, pp. 5-20. 
  134. Leo Bachmair and Nachum Dershowitz, July 1986, “Critical Pair Criteria for the Knuth-Bendix Completion Procedure”, Proceedings of the 1986 ACM Symposium on Symbolic and Algebraic Computation, B. W. Char, ed., Waterloo, Ontario, pp. 215-217.
  135. N. Alan Josephson and Nachum Dershowitz, Sept. 1986, “An Implementation of Narrowing: The Rite Way”, Proceedings of the IEEE Symposium on Logic Programming, Salt Lake City, UT, pp. 187-197.
  136. Nachum Dershowitz, Feb. 1985, “Rewriting and Verification” (Position Paper), Proceedings of a Formal Verification Workshop (VERkshop III), Watsonville, CA, p. 60, ACM SIGSOFT Software Engineering Notes 10, 4 (Aug. 1985). 
  137. Nachum Dershowitz and David A. Plaisted, Feb. 1985, “Conditional Rewriting”, Proceedings of a Formal Verification Workshop (VERkshop III), ACM Software Engineering Notes 10, 4 (Aug. 1985), Watsonville, CA, pp. 55-59. 
  138. Nachum Dershowitz, Mar. 1985, “Synthesis by Completion”, Interim report, Center for Applied Logic and Artificial Intelligence, Bar-Ilan University, Ramat-Gan, Israel.
  139. Nachum Dershowitz, May 1985, “Termination”, Proceedings of the First International Conference on Rewriting Techniques and Applications (Dijon, France), Lecture Notes in Computer Science, vol. 202, Springer-Verlag, Berlin, pp. 180-224. Reviewed in Zbl 581.68031.
  140. Nachum Dershowitz, May/June 1985, “Computing with Rewrite Systems”, Information and Control, vol. 64, no. 2/3, pp. 122-157. Reviewed in Math. Reviews 87e:68098 and Zbl 584.68020. 
  141. Nachum Dershowitz and David A. Plaisted, July 1985, “Logic Programming cum Applicative Programming”, Proceedings of the IEEE Symposium on Logic Programming, Boston, MA, pp. 54-66.
  142. Nachum Dershowitz, Aug. 1985, “Synthesis by Completion”, Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, CA, pp. 208-214.
  143. Nachum Dershowitz, Aug. 1985, “Termination of Rewriting”, Report R-85-1220, Department of Computer Science, University of Illinois, Urbana, IL.
  144. Nachum Dershowitz, Oct. 1985, “Completeness of Completion” (Abstract), Bulletin of the European Association for Theoretical Computer Science, vol. 27, pp. 94.
  145. Nachum Dershowitz, Leo Marcus, and Andrzej Tarlecki, Dec. 1985, “Existence, Uniqueness, and Construction of Rewrite Systems”, Report ATR-85(8354)-7, Computer Science Laboratory, The Aerospace Corporation, El Segundo, CA.
  146. Nachum Dershowitz, May 1984, “Equations as Programming Language”, Proceedings of the Fourth Jerusalem Conference on Information Technology, IEEE Computer Society, Jerusalem, Israel, pp. 114-124.
  147. Nachum Dershowitz and N. Alan Josephson, July 1984, “Logic Programming by Completion”, Proceedings of the Second International Logic Programming Conference, Uppsala, Sweden, pp. 313-320.
  148. Nachum Dershowitz and Leo Marcus, Aug. 1984, “Existence and Construction of Rewrite Systems” (revised), Office of Information Sciences Research, The Aerospace Corp., El Segundo, CA.
  149. Nachum Dershowitz, Jan. 1983, “Computing with Rewrite Systems”, Technical Report ATR-83(8478)-1, Office of Information Sciences Research, The Aerospace Corp., El Segundo, CA.
  150. Nachum Dershowitz, May 1983, “Applications of the Knuth-Bendix Completion Procedure”, Technical Report ATR-83(8478)-2, Office of Information Sciences Research, The Aerospace Corporation, El Segundo, CA.
  151. Nachum Dershowitz, May 1983, “Well-Founded Orderings”, Technical Report ATR-83(8478)-3, Office of Information Sciences Research, The Aerospace Corporation, El Segundo, CA.
  152. Jieh Hsiang and Nachum Dershowitz, July 1983, “Rewrite Methods for Clausal and Non-Clausal Theorem Proving”, European Association of Theoretical Computer Science, Proceedings of the Tenth International Colloquium on Automata, Languages and Programming (Barcelona, Spain), Lecture Notes in Computer Science, vol. 154, Springer-Verlag, Berlin, pp. 331-346.
  153. Nachum Dershowitz, Jieh Hsiang, N. Alan Josephson, and David A. Plaisted, Aug. 1983, “Associative-Commutative Rewriting”, Proceedings of the Eighth International Joint Conference on Artificial Intelligence, Karlsruhe, West Germany, pp. 940-944.
  154. Nachum Dershowitz, Sept. 1983, “Computing With Rewrite Systems”, Proceedings of the NSF Workshop on the Rewrite Rule Laboratory, General Electric Research and Development, Schenectady, NY, pp. 269-298.
  155. Nachum Dershowitz, Mar. 1982, “Orderings for Term-Rewriting Systems”, Theoretical Computer Science, vol. 17, no. 3, pp. 279-301. Reviewed in Zbl 525.68054. Number 12 on "List of the 100 most cited articles to appear in Theoretical Computer Science". 
  156. Nachum Dershowitz, Dec. 1982, “Applications of the Knuth-Bendix Completion Procedure”, Proceedings of the Seminaire d'Informatique Theorique, Paris, France, pp. 95-111.
  157. Nachum Dershowitz and Leo Marcus, Dec. 1982, “Existence and Construction of Rewrite Systems”, Technical Report ATR-82(8478)-3, Office of Information Sciences Research, The Aerospace Corporation, El Segundo, CA.
  158. Nachum Dershowitz, July 1981, “Termination of Linear Rewriting Systems (Preliminary Version)”, European Association of Theoretical Computer Science, Proceedings of the Eighth International Colloquium on Automata, Languages and Programming (Acre, Israel), Lecture Notes in Computer Science, vol. 115, Springer-Verlag, Berlin, pp. 448-458.
  159. Nachum Dershowitz, 1980, “On the Representation of Ordinals up to Γ0”, Unpublished, Department of Computer Science, University of Illinois, Urbana, IL.
  160. Nachum Dershowitz, Apr. 1979, “A Note on Simplification Orderings”, Report DCS-4-79-986, Department of Computer Science, University of Illinois, Urbana, IL.
  161. Nachum Dershowitz and Zohar Manna, July 1979, “Proving Termination with Multiset Orderings”, Proceedings of the Sixth International EATCS Colloquium on Automata, Languages and Programming (Graz, Austria), Lecture Notes in Computer Science, vol. 71, Springer-Verlag, Berlin, pp. 188-202.
  162. Nachum Dershowitz and Zohar Manna, Aug. 1979, “Proving Termination With Multiset Orderings”, Communications of the ACM, vol. 22, no. 8, pp. 465-476.
  163. Nachum Dershowitz, Aug. 1979, “Orderings for Term-Rewriting Systems”, Report DCS-R-79-987, Department of Computer Science, University of Illinois, Urbana, Il.
  164. Nachum Dershowitz, Oct. 1979, “Orderings for Term-Rewriting Systems”, Proceedings of the Twentieth IEEE Symposium on Foundations of Computer Science, San Juan, PR, pp. 123-131.
  165. Nachum Dershowitz, Nov. 1979, “A Note on Simplification Orderings”, Information Processing Letters, vol. 9, no. 5, pp. 212-215. Reviewed in Math. Reviews 81f:68021. 
  166. Nachum Dershowitz and Zohar Manna, Mar. 1978, “Proving Termination with Multiset Orderings”, Memo AIM-310, STAN-CS-78-651, Stanford Artificial Intelligence Laboratory, Stanford University, Stanford, CA.