Nachum Dershowitz

PUBLICATIONS

Books Favorites Drafts Legend
In Press
 Pending Current: 2011 2010
2009 2008 2007 2006 2005 2004 2003 2002 2001 2000
1999 1998 1997 1996 1995 1994 1993 1992 1991 1990
1989 1988 1987 1986 1985 1984 1983 1982 1981 1980
1979 1978 1977 1976 1975

    To appear

  1. Edward M. Reingold and Nachum Dershowitz, 2012, “Calendars”, McGraw-Hill Encyclopedia of Science & Technology, 11th ed.
  2. +Maria Paola Bonacina and Nachum Dershowitz, 2012, “Canonical Ground Horn Theories”, Workshop on Programming Logics (in Memory of Harald Ganzinger), Andreas Podelski, Andrei Voronkov, and Reinhard Wilhelm, eds., Lecture Notes in Computer Science, Springer-Verlag, Berlin.
  3. *Kfir Bar and Nachum Dershowitz, “Semantics for Example-Based Arabic Machine Translation”, Challenges for Arabic Machine Translation, Abdelhadi Soudi, Stephan Vogel, Guenter Neumann, and Ali Farghaly, eds., Natural Language Processing Series, John Benjamins, Amsterdam.
  4. *Nachum Dershowitz and Evgenia Falkovich, 2012, “Effectiveness”, Hector Zenil, ed., Computation in Nature & The Nature of Computation, World Scientific/Imperial College Press.
  5. ++Nachum Dershowitz and Ephraim Nissan, editors, Language, Culture, Computation: Essays Dedicated to Yaacov Choueka, Lecture Notes in Computer Science, Springer-Verlag, Berlin (3 volumes).
  6. +Kfir Bar, Yaacov Choueka, and Nachum Dershowitz, “Matching Phrases for Arabic-to-English Example-Based Translation System”, Language, Culture, Computation: Studies in Honor of Yaacov Choueka, Nachum Dershowitz and Ephraim Nissan, eds., Lecture Notes in Computer Science, Springer-Verlag, Berlin.
  7. +Yaacov Choueka, Nachum Dershowitz, and Liad Tal, “Matching with a Hierarchical Ontology”, Language, Culture, Computation: Studies in Honor of Yaacov Choueka, Nachum Dershowitz and Ephraim Nissan, eds., Lecture Notes in Computer Science, Springer-Verlag, Berlin.
  8. *Nachum Dershowitz and Edward M. Reingold, 2012, “Jewish Dating Pitfalls and Resources”, Genealogical Research - Scientific Tools and Methodologies, H. Daniel Wagner, ed.

    9. Pending

  9. Roni Shweka, Yaacov Choueka, Lior Wolf, and Nachum Dershowitz, October 2011, “Automatic Extraction of Catalog Data from Digital Images of Historical Manuscripts”.
  10. Noga Levy, Lior Wolf, Nachum Dershowitz, and Peter Stokes, November 2011, “Estimating the Distinctiveness of Graphemes and Allographs in Palaeographic Classification” (Extended Abstract).
  11. Nachum Dershowitz and Edward M. Reingold, December 2011, “Modulo Intervals: A Proposed Notation”.
  12. Evgenia Falkovich and Nachum Dershowitz, July 2011, “A Formalization and Proof of the Classical Extended Church-Turing Thesis”.
  13. Andrey Stolyarenko and Nachum Dershowitz, 2011, “OCR for Arabic using SIFT Descriptors With On-Line Failure Prediction”.
  14. Olivier Bournez, Nachum Dershowitz, and Evgenia Falkovich, January 2012, “Towards an Axiomatization of Simple Analog Algorithms”.
  15. Nachum Dershowitz, January 2012, “Laziness and Lifting”.
  16. Tal Rubenczyk, Nachum Dershowitz, Yaacov Choueka, Michael Flor, Oren Hod, and Assaf Roth, May 2004, “Search Engine Method and Apparatus” (patent pending).
  17. Nachum Dershowitz and Claude Kirchner, May 2006, “Dispositif et procédé de résolution de contraintes (Equation-Solving Method and Device)” (patent pending).
  18. Oren Hod, Assaf Roth, Tal Rubenczyk, Nachum Dershowitz, Erez Lotan, Liad Tal, and Yael Villa, Oct. 2006, “Learning Spelling Corrections from Query Logs” (patent pending).

    19. In Preparation

  19. Andreas Blass, Nachum Dershowitz, and Yuri Gurevich, “What is an Algorithm?”.
  20. Andreas Blass, Nachum Dershowitz, and Yuri Gurevich, March 2010, “Exact Exploration”.
  21. *Nachum Dershowitz and Evgenia Falkovich, Feb 2012, “Honest Universality”, S. Abramsky, ed., Special issue of the Philosophical Transactions of the Royal Society A.
  22. Nachum Dershowitz, Feb. 2010, “Notations for Sets of Sequences”.
  23. Idan Dershowitz, Nachum Dershowitz, Moshe Koppel, and Navot Akiva, “Computerized Source-Criticism of Biblical Texts”.
  24. Nachum Dershowitz, Bernhard Gramlich, Mitsuhiro Okada, G. Sivakumar, and Claus-Peter Wirth, “Conditional Confluence”.
  25. Nachum Dershowitz, “Maimonidean Calendrical Astronomy”, unpublished abstract.
  26. Nachum Dershowitz and Edward M. Reingold, Mathematics for the Programmer, McGraw-Hill.

    27. 2011

  27. *Nachum Dershowitz and Edward M. Reingold, 2011, “Indian Calendrical Calculations”, Ancient Indian Leaps into Mathematics, B. S. Yadav and Man Mohan, eds., Birkhäuser, Boston, pp. 1-32.
  28. Kfir Bar and Nachum Dershowitz, Jan. 2011, “Using Verb Paraphrases for Arabic-to-English Example-Based Translation” (Extended Abstract), Workshop on Machine Translation and Morphologically-rich Languages, Haifa, Israel.
  29. *Lior Wolf, Nachum Dershowitz, Liza Potikha, Tanya German, Roni Shweka, and Yaacov Choueka, 2011, “Automatic Paleographic Exploration of Genizah Manuscripts”, in Kodikologie und Paläographie im Digitalen Zeitalter 2 - Codicology and Palaeography in the Digital Age 2, Franz Fischer, Christiane Fritze, and Georg Vogeler, eds., with Bernhard Assmann, Malte Rehbein, and Patrick Sahle, Schriften des Instituts für Dokumentologie und Editorik, vol. 3, Norderstedt: Books on Demand, Germany, pp. 157-179.
  30. ++José Félix Costa and Nachum Dershowitz, eds.,  2011, Special Issue on Unconventional Computation, Natural Computing, vol. 10, pp. 1215-1217, available online 13 January 2011. link
  31. Nachum Dershowitz and Evgenia Falkovich, June 2011, “A Formalization and Proof of the Extended Church-Turing Thesis” (Extended Abstract), Studia Logica Conference on Trends in Logic, IX: Church Thesis: Logic, Mind and Nature, Krakow, Poland.
  32. Alex Zhicharevich and Nachum Dershowitz, June 2011, “Matching Poorly Recognized Texts to a Corpus” (Abstract), Israeli Seminar on Computational Linguistics (ISCOL), Bar-Ilan University. (Poster.)
  33. Andrey Stolyarenko and Nachum Dershowitz, June 2011, “OCR for Arabic using SIFT Descriptors With On-Line Failure Prediction”, Israeli Seminar on Computational Linguistics (ISCOL), Bar-Ilan University.
  34. Roni Shweka, Yaacov Choueka, Lior Wolf, Nachum Dershowitz, and Masha Zeldin, June 2011, “Automatic Extraction of Catalog Data from Genizah Fragments’ Images” (Extended Abstract), Digital Humanities (DH 2001), Palo Alto, CA.
  35. +Moshe Koppel, Navot Akiva, Idan Dershowitz, and Nachum Dershowitz, June 2011, “Unsupervised Decomposition of a Document into Authorial Components”, Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies (ACL-HLT), Portland, OR, 1356-1364. link
  36. Nachum Dershowitz, July 2011, “The Generic Model of Computation”, Proceedings of the Seventh International Workshop on Developments in Computational Models (DCM 2011), Zurich, Switzerland, Electronic Proceedings Theoretical Computer Science.
  37. Nachum Dershowitz and Evgenia Falkovich, July 2011, “A Formalization and Proof of the Extended Church-Turing Thesis”, Proceedings of the Seventh International Workshop on Developments in Computational Models (DCM 2011), Zurich, Switzerland, Electronic Proceedings Theoretical Computer Science.
  38. Lior Wolf and Nachum Dershowitz, July 2011, “Identifying Join Candidates in the Cairo Genizah” (Abstract), ESF Workshop on Digital Palaeography, Würzburg, Germany.
  39. Nachum Dershowitz, July 2011, “What is an Effective Algorithm?” (Abstract), 14th Congress of Logic, Methodology and Philosophy of Science, Nancy, France.
  40. +Lior Wolf, Nachum Dershowitz, Liza Potikha, Roni Shweka, and Yaacov Choueka, Sept. 2011, “Computerized Paleography: Tools for Historical Manuscripts”, IEEE International Conference on Image Processing (ICIP 2011), Brussels, Belgium.
  41. *Roni Shweka, Yaacov Choueka, Lior Wolf, and Nachum Dershowitz, 2011, “‘Veqarev otam ehad el ehad’: Zihuy ktav yad vetseruf qit'ei hagnizah beemtsa'ut mahshev (Identifying Handwriting and Joining Genizah Fragments by Computer)”, Ginzei Kedem, vol. 7, pp. 171-207. (In Hebrew.)
  42. +Lior Wolf, Lior Litwak, Nachum Dershowitz, Roni Shweka, and Yaacov Choueka, Nov. 2011, “Active Clustering of Document Fragments using Information Derived from Both Images and Catalogs”, International Conference on Computer Vision (ICCV), Barcelona, Spain.

    43. 2010

  43. *Nachum Dershowitz and Iddo Tzameret, May 2010, “Complexity of Propositional Proofs under a Promise”, ACM Transactions on Computational Logic, vol. 11, no. 3, article 18 (29 pp.).
  44. Kfir Bar and Nachum Dershowitz, June 2010, “Using Synonyms for Arabic-to-English Example-Based Translation” (Abstract), Abstracts of the Israeli Seminar on Computational Linguistics (ISCOL), Tel Aviv University, Israel, pp. 28-29.
  45. °°Nachum Dershowitz, Shalom Lappin, and Shuly Wintner, editors, June 2010, Abstracts of the Israeli Seminar on Computational Linguistics, Tel Aviv University, Israel.
  46. Nachum Dershowitz, July 2010, “An Abstract Path Ordering”, Eleventh International Workshop on Termination (WST), Edinburgh, Scotland.
  47. ++Andreas Blass, Nachum Dershowitz, and Wolfgang Reisig, eds., Aug. 2010, Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, Lecture Notes in Computer Science, vol. 6300, Springer-Verlag, Berlin (627+xxv pages).
  48. +Udi Boker and Nachum Dershowitz, Aug. 2010, “Three Paths to Effectiveness”, Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, Andreas Blass, Nachum Dershowitz, and Wolfgang Reisig, eds., Lecture Notes in Computer Science, vol. 6300, Springer-Verlag, Berlin, pp. 135-146.
  49. Andreas Blass, Nachum Dershowitz, and Wolfgang Reisig, Aug. 2010, “Yuri, Logic, and Computer Science”, Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, Andreas Blass, Nachum Dershowitz, and Wolfgang Reisig, eds., Lecture Notes in Computer Science, vol. 6300, Springer-Verlag, Berlin, pp. 1-48.
  50. +Andreas Blass, Nachum Dershowitz, and Yuri Gurevich, Aug. 2010, “Exact Exploration and Hanging Algorithms”, Anuj Dawar and Helmut Veith, eds., Proceedings of the 24th International Workshop on Computer Science Logic (CSL 2010), Brno, Czech Republic, Lecture Notes in Computer Science, vol. 6247, Springer-Verlag, Berlin, pp. 140-154.
  51. +Olivier Bournez and Nachum Dershowitz, Sept. 2010, “Foundations of Analog Algorithms”, Proceedings of the Third International Workshop on Physics and Computation (P&C), Nile River, Egypt.
  52. *Lior Wolf, Rotem Littman, Naama Mayer, Tanya German, Nachum Dershowitz, Roni Shweka, and Yaacov Choueka, Oct. 2010, “Automatically Identifying Join Candidates in the Cairo Genizah”, International Journal of Computer Vision, pp. 1-18. link
  53. +Kfir Bar and Nachum Dershowitz, Oct. 2010, “Using Synonyms for Arabic-to-English Example-Based Translation”, The Ninth Bienniel Conference of the Association for Machine Translation in the Americas, Denver, CO.
  54. +Kfir Bar and Nachum Dershowitz, Dec. 2010, “Tel Aviv University’s System Description for IWSLT 2010”, International Workshop on Spoken Language Translation (IWSLT 2010), Paris, France.

    55. 2009

  55. *Nachum Dershowitz and Shmuel Zaks, Jan. 2009, “More Patterns in Trees: Up and Down, Young and Old, Odd and Even”, SIAM J. on Discrete Mathematics, vol. 23, no. 1, pp. 447-465. link
  56. +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.
  57. *Andreas Blass, Nachum Dershowitz, and Yuri Gurevich, June 2009, “When are Two Algorithms the Same?”, Bulletin of Symbolic Logic, vol. 15, no. 2, pp. 145-168. link
  58. °Andreas Blass, Nachum Dershowitz, and Yuri Gurevich, July 2009, “Exact Exploration”, TechReport MSR-TR-2009-99, Microsoft Research, Redmond, WA.
  59. Kfir Bar, Nachum Dershowitz, Aug. 2009, “NIST Open Machine Translation 2009 Evaluation: Tel Aviv University’s System Description”, National Institute of Standards and Technology (NIST) Open MT Evaluation Workshop, Ottawa. Ontario, Canada.
  60. ++Christian S. Calude, José Félix Costa, Nachum Dershowitz, Elisabete Freire, and Grzegorz Rozenberg, editors, Sept. 2009, Proceedings of the Eighth International Conference on Unconventional Computation (UC 2009; Ponta Delgada, Portugal; Sept. 2009), Lecture Notes in Computer Science, vol. 5715, Springer-Verlag, Berlin.
  61. Udi Boker and Nachum Dershowitz, Sept. 2009, “Three Paths to Effectiveness”, Preproceedings of HyperNet09: The UC2009 Hypercomputation Workshop, Ponta Delgada, Portugal, pp. 23-28.
  62. *Udi Boker and Nachum Dershowitz, Oct. 2009, “The Influence of the Domain Interpretation on Computational Models”, Applied Mathematics and Computation, vol. 215, no. 4, pp. 1323-1339. link
  63. +Lior Wolf, Rotem Littman, Naama Mayer, Nachum Dershowitz, Roni Shweka, and Yaacov Choueka, Oct. 2009, “Automatically Identifying Join Candidates in the Cairo Genizah” (Extended Abstract), IEEE Workshop on eHeritage and Digital Art Preservation (in conjunction with ICCV 2009), Kyoto, Japan. Best paper award.
  64. Lior Wolf, Rotem Littman, Naama Mayer, Nachum Dershowitz, Roni Shweka, and Yaacov Choueka, Dec. 2009, “Automatically Identifying Join Candidates in the Cairo Genizah” (Abstract), Israel Computer Vision Day, Herzliya, Israel.

    65. 2008

  65. **Nachum Dershowitz and Edward M. Reingold, 2008, Calendrical Calculations, third edition, Cambridge University Press (477+xxxi pages).
  66. ++Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, editors, 2008, Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, Lecture Notes in Computer Science, vol. 4800, Springer-Verlag, Berlin (682+xxi pages).
  67. +Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, 2008, “Boris A. Trakhtenbrot: Genealogy and Publications”, Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, eds., Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, Lecture Notes in Computer Science, vol. 4800, Springer-Verlag, Berlin, pp. 46-57.
  68. +Udi Boker and Nachum Dershowitz, 2008, “The Church-Turing Thesis over Arbitrary Domains”, Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, eds., Lecture Notes in Computer Science, vol. 4800, Springer-Verlag, Berlin, pp. 199-229.
  69. Andreas Blass, Nachum Dershowitz, and Yuri Gurevich, Feb. 2008, “When are Two Algorithms the Same?”, TechReport MSR-TR-2008-20, Microsoft Research, Redmond, WA.
  70. +Nachum Dershowitz and Claude Kirchner, July 2008, “SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets”, Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday, Pierpaolo Degano, Rocco De Nicola, and José Meseguer, eds., Lecture Notes in Computer Science, vol. 5065, Springer-Verlag, Berlin, pp. 194-208.
  71. +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.
  72. +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.
  73. Nachum Dershowitz, Aug. 2008, “Bit Inference”, Workshop on Practical Aspects of Automated Reasoning, Sydney, Australia, pp. 26-35.
  74. +Udi Boker and Nachum Dershowitz, Aug. 2008, “The Influence of the Domain Interpretation on Computational Models”, International Workshop on Physics and Computation, Vienna, Austria, Centre for Discrete Mathematics and Theoretical Computer Science, Report CDMTCS-327, pp. 49-68.
  75. *Nachum Dershowitz and Yuri Gurevich, Sept. 2008, “A Natural Axiomatization of Computability and Proof of Church’s Thesis”, Bulletin of Symbolic Logic, vol. 14, no. 3, pp. 299-350. link
  76. Andreas Blass, Nachum Dershowitz, and Yuri Gurevich, Nov. 2008, “When are Two Algorithms the Same?”, Informal publication, arXiv:0811.0811v1 [cs.GL].
  77. #Nachum Dershowitz, Sept. 2008, “An Axiomatic Approach to Hyper-Computation” (Abstract), Abstracts of Graph Theory, Computational Intelligence and Thought: A Conference Celebrating Martin Charles Golumbic’s 60th Birthday, Tiberias, Israel.
  78. Nachum Dershowitz and Alexander Nadel, 2008, “From Total Assignment Enumeration to a Modern SAT Solver”. Informal publication, arXiv:1110.5867v1 [cs.LO].

    79. 2007

  79. *Maria Paola Bonacina and Nachum Dershowitz, Jan. 2007, “Abstract Canonical Inference”, ACM Transactions on Computational Logic, vol. 8, no. 1, article 6. link
  80. *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. link
  81. +Kfir Bar, Nachum Dershowitz, and Yaacov Choueka, Apr. 2007, “Example-Based Arabic-to-English Translation” (Extended Abstract), Proceedings of a Workshop on Arabic Natural Language Processing, Fez, Morocco, pp. 325/1-4.
  82. Nachum Dershowitz and Shmuel Zaks, May 2007, “More Patterns in Trees: Up and Down, Young and Old, Odd and Even” (Abstract), 1st Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM), Banff, Alberta, Canada.
  83. +Nachum Dershowitz, Ziyad Hanna, and Alexander Nadel, May 2007, “Towards a Better Understanding of a Conflict-Driven SAT Solver”, Proceedings of the Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT 2007; Lisbon, Portugal), João Marques-Silva and Karem A. Sakallah, eds., Lecture Notes in Computer Science, vol. 4501, Springer-Verlag, Berlin, pp. 287-293. link
  84. +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. link
  85. Nachum Dershowitz and Iddo Tzameret, July 2007, “Complexity of Propositional Proofs under a Promise”, Informal publication, arXiv:0707.4255v1 [cs.CC].
  86. +Nachum Dershowitz and Iddo Tzameret, July 2007, “Complexity of Propositional Proofs under a Promise”, Proceedings of the Thirty-Fourth International Colloquium on Automata, Languages and Programming (ICALP), Wroclaw, Poland, L. Arge, C. Cachin, T. Jurdzi’nski, and A. Tarlecki, eds., Lecture Notes in Computer Science, vol. 4596, Springer-Verlag, Berlin, pp. 291-302. link
  87. Nachum Dershowitz and Yuri Gurevich, July 2007, “A Natural Axiomatization of Church’s Thesis”, TechReport MSR-TR-2007-85, Microsoft Research, Redmond, WA.
  88. Maria Paola Bonacina and Nachum Dershowitz, Oct. 2007, “Canonical Ground Horn Theories”, Research Report 49/2007, Dipartimento di Informatica, Università degli Studi di Verona.
  89. ++Nachum Dershowitz and Andrei Voronkov, editors, Oct. 2007, Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-07; Yerevan, Armenia; Oct. 15-19, 2007), Lecture Notes in Computer Science, vol. 4790, Springer-Verlag, Berlin (562+xiii pages).
  90. °°Nachum Dershowitz and Andrei Voronkov, editors, Oct. 2007, Short Papers of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-07; Yerevan, Armenia; Oct. 15-19, 2007).
  91. Jacob Katz, Ziyad Hanna, and Nachum Dershowitz, Oct. 2007, “Space-Efficient Bounded Model Checking”, arXiv copy.

    92. 2006

  92. +Udi Boker and Nachum Dershowitz, Feb. 2006, “Abstract Effective Models”, New Developments in Computational Models: Proceedings of the First International Workshop on Developments in Computational Models (DCM 2005) (Lisbon, Portugal, July 2005), M. Fernández and I. Mackie, eds., Electronic Notes in Theoretical Computer Science, vol. 135, no. 3, pp. 15-23. link
  93. Nachum Dershowitz, Ziyad Hanna, and Alexander Nadel, May 2006, “A Scalable Algorithm for Minimal Unsatisfiable Core Extraction”, Informal publication, arXiv:cs/0605085v1 [cs.LO].
  94. Kfir Bar, Nachum Dershowitz, and Yaacov Choueka, June 2006, “Example-Based Arabic-English Machine Translation” (Abstract), Israeli Seminar in Computational Linguistics, Haifa.
  95. *Udi Boker and Nachum Dershowitz, July 2006, “A Hypercomputational Alien”, J. of Applied Mathematics & Computation, vol. 178, no. 1, pp. 44-57; available online 9 Nov. 2005. link
  96. *Nachum Dershowitz and Claude Kirchner, July 2006, “Abstract Canonical Presentations”, Theoretical Computer Science, vol. 357, nos. 1-3, pp. 53-69. link
  97. +Nachum Dershowitz, Ziyad Hanna, and Alexander Nadel, Aug. 2006, “A Scalable Algorithm for Minimal Unsatisfiable Core Extraction”, Theory and Applications of Satisfiability Testing - SAT 2006: Proceedings of the 9th International Conference (Seattle, WA), Armin Biere and Carla P. Gomes, eds., Lecture Notes in Computer Science, volume 4121, Springer-Verlag, Berlin, pp. 36-41. link
  98. 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].
  99. ++Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, editors, Oct. 2006, Special issue on “Logic and Computation: Symposia at Tel Aviv”, Logic Journal of the IGPL, vol. 14, no. 5.
  100. *Udi Boker and Nachum Dershowitz, Oct. 2006, “Comparing Computational Power”, Logic Journal of the IGPL, vol. 14, no. 5, pp. 633-648. link
  101. +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. link

    102. 2005

  102. +Jacob Katz, Ziyad Hanna, and Nachum Dershowitz, March 2005, “Space-Efficient Bounded Model Checking” (Extended Abstract), Design, Automation and Test in Europe, Munich, Germany, vol. 2, pp. 686-687. link
  103. 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. link
  104. +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. link
  105. +Yulik Feldman, Nachum Dershowitz, and Ziyad Hanna, Apr. 2005, “ Parallel Multithreaded Satisfiability Solver: Design and Implementation”, Proceedings of the 3rd International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2004), Sept. 2004, London, UK; Electronic Notes in Theoretical Computer Science, vol. 128, no. 3, pp. 75-90. link
  106. +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. link
  107. Udi Boker and Nachum Dershowitz, June 2005, “How to Compare the Power of Computational Models”, Computability in Europe 2005: New Computational Paradigms (Amsterdam), S. Barry Cooper, Benedikt Löwe, Leen Torenvliet, eds., Lecture Notes in Computer Science, vol. 3526, Springer-Verlag, Berlin, pp. 54-64. link
  108. +Nachum Dershowitz, Ziyad Hanna, and Alexander Nadel, June 2005, “A Clause-Based Heuristic for SAT Solvers”, F. Bacchus and T. Walsch, eds., Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT 2005; St. Andrews, Scotland), Lecture Notes in Computer Science, vol. 3569, Springer-Verlag, Berlin, pp. 46-60. link
  109. +Nachum Dershowitz, Ziyad Hanna, and Jacob Katz, June 2005, “Bounded Model Checking with QBF”, F. Bacchus and T. Walsch, eds., Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT 2005; St. Andrews, Scotland), Lecture Notes in Computer Science, vol. 3569, Springer-Verlag, Berlin, pp. 408-414. link
  110. Nachum Dershowitz and Iddo Tzameret, June 2005, “A Gap Tree Theorem for Quasi-ordered Labels”. Unpublished draft.
  111. Nachum Dershowitz, E. Castedo Ellerman, and Edward M. Reingold, July 2005, “Well-Quasi-Orderings on Binary Trees”. Unpublished draft.
  112. Udi Boker and Nachum Dershowitz, July 2005, “Abstract Effective Models”, Preliminary Proceedings of New Developments in Computational Models: International Workshop on Developments in Computational Models (DCM 2005), M. Fernández and I. Mackie, eds., Lisbon, Portugal, pp. 114-123.
  113. Udi Boker and Nachum Dershowitz, Oct. 2005, “Comparing Computational Power”, Informal publication, arXiv:cs/0510069v1 [cs.LO].
  114. Nachum Dershowitz, Nov. 2005, “Entropic Questioning”.  Unpublished draft.
  115. +Nachum Dershowitz, Dec. 2005, “The Four Sons of Penrose”, Proceedings of the Eleventh Conference on Logic Programming for Artificial Intelligence and Reasoning (LPAR; Jamaica), G. Sutcliffe and A. Voronkov, eds., Lecture Notes in Computer Science, vol. 3835, Springer-Verlag, Berlin, pp. 125-138. link
  116. *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.

    117. 2004

  117. °°Nachum Dershowitz and Alexander Rabinovich, editors, March 2004, Abstracts of an International Symposium on Models of Computation, School of Computer Science, Tel Aviv University, Ramat Aviv, Israel.
  118. Nachum Dershowitz, March 2004, “Comparing Computational Power” (Abstract), Abstracts of an International Symposium on Models of Computation, N. Dershowitz and A. Rabinovich, editors, School of Computer Science, Tel Aviv University, Ramat Aviv, Israel.
  119. °°Arnon Avron and Nachum Dershowitz, editors, March 2004, Abstracts of an International Symposium on Logic and Computation, School of Computer Science, Tel Aviv University, Ramat Aviv, Israel.
  120. 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.
  121. Maria Paola Bonacina and Nachum Dershowitz, May 2004, “Abstract Canonical Inference”, Research Report 18/2004, Dipartimento di Informatica, Università degli Studi di Verona.
  122. Maria Paola Bonacina and Nachum Dershowitz, May 2004, “Abstract Canonical Inference”, Informal publication, arXiv.org.
  123. +Nachum Dershowitz and Edward M. Reingold, July 2004, “Hebrew Dating” (Abstract), Conference Syllabus of the 24th IAJGS International Conference on Jewish Genealogy, Jerusalem, Israel, p. 129; extended abstract on CD-ROM.
  124. +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.
  125. Nachum Dershowitz, Dec. 2004, “Hindu Calendrical Calculations” (Abstract), Abstracts of International Conference on History and Heritage of Mathematical Sciences, Indore, India.

    126. 2003

  126. Nachum Dershowitz and Mitchell A. Harris, Jan. 2003, “Enumerating the Propositions Equivalents to a Boolean Formula”. Cf. Chauvin et al.
  127. Nachum Dershowitz, April 2003, “Ground Canonicity”, Informal publication, arXiv:cs/0304017v1 [cs.LO].
  128. 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. link
  129. Nachum Dershowitz and Claude Kirchner, June 2003, “Abstract Saturation-Based Inference”, Proceedings of the Eighteenth IEEE Symposium on Logic in Computer Science (LICS), Ottawa, pp. 65-74.
  130. 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.
  131. 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.
  132. Nachum Dershowitz, D. N. Jayasimha, and Seungjoon Park, “Bounded Fairness” (Abstract), July 2003, Abstracts of the International Symposium on Verification — Theory and Practice — Honoring Zohar Manna’s 64th Birthday (Sicily, Italy).
  133. +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. link
  134. Nachum Dershowitz and Mitchell A. Harris, Sept. 2003, “Enumerating Satisfiable Propositional Formulae”, Abstracts of EuroComb’03 (European Conference on Combinatorics, Graph Theory and Applications), J. Fiala, ed., Report 2003-145, Institute for Theoretical Computer Science, Charles University, Prague, Czech Republic, pp. 87-90.
  135. Nachum Dershowitz and Mitchell A. Harris, Oct. 2003, “Enumerating Satisfiable Propositional Formulæ”, unpublished draft.
  136. 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.
  137. ++Nachum Dershowitz, editor, 2003, Verification — Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, Lecture Notes in Computer Science, vol. 2772, Springer-Verlag, Berlin (783+xv pages).
  138. *Nachum Dershowitz, D. N. Jayasimha, and Seungjoon Park, 2003, “Bounded Fairness”, Verification — Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, N. Dershowitz, ed., Lecture Notes in Computer Science, vol. 2772, Springer-Verlag, Berlin, pp. 304-317.
  139. +Nachum Dershowitz, 2003, “Pæan to Zohar Manna”, Verification — Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, N. Dershowitz, ed., Lecture Notes in Computer Science, vol. 2772, Springer-Verlag, Berlin, pp. 1-10.

    140. 2002

  140. Claude Kirchner and Nachum Dershowitz, July 2002, “Abstract Canonical Inference Systems” (Abstract), 16th International Workshop on Unification, Copenhagen, Denmark.
  141. **Edward M. Reingold and Nachum Dershowitz, 2002, Calendrical Tabulations, Cambridge University Press (606+xxx pages).
  142. Nachum Dershowitz and Ely Pinchover, 2002, “Automatic Inductive Synthesis of Functional Programs”, unpublished draft.

    143. 2001

  143. *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.
  144. °°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.
  145. °°Nachum Dershowitz, editor, June 2001, Abstracts of the Bar-Ilan International Symposium on Artificial Intelligence (BISFAI ’01), Ramat-Gan, Israel.
  146. Edward M. Reingold and Nachum Dershowitz, 2001, Calendrical Calculations: The Millennium Edition, Cambridge University Press (423+xxxii pages). Choice’s Outstanding Academic Title Award (2002).
  147. Edward M. Reingold and Nachum Dershowitz, with Robert McNally, 2001, Calendrica 2.1 (Calendrical Calculations Millennium Software Package), Cambridge University Press (CD-ROM).
  148. *Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, and Alexander Serebrenik, 2001, “A General Framework for Automatic Termination Analysis of Logic Programs”, Applicable Algebra in Engineering, Communication and Computing, vol. 12, no. 1/2, pp. 117-156. link
  149. Nachum Dershowitz and Claude Kirchner, Dec. 2001, “Inversion Strategies”, Workshop on Rule-Based Constraint Reasoning and Programming (RCoRP’01), Cyprus.
  150. #Nachum Dershowitz, Sept. 1999, “Sharing Constructors” (Abstract), 14th International Workshop on Algebraic Development Techniques, Bonas, France

    151. 2000

  151. +Nachum Dershowitz, 2000, “[Hebrew] Calendar”, Reader’s Guide to Judaism, M. Terry, ed., Fitzroy Dearborn, Chicago, IL, pp. 97-98.
  152. Nachum Dershowitz and Claude Kirchner, editors, Sept. 2000, RULE 2000: Proceedings of the First International Workshop on Rule-Based Programming, Montreal, Canada.
  153. *Nachum Dershowitz, Oct. 2000, “Artificial Intelligence: Retrospective/Prospective”, Annals of Mathematics and Artificial Intelligence, vol. 28, nos. 1-4, pp. 3-5. link
  154. Nachum Dershowitz and Edward M. Reingold, “Calendars”, McGraw-Hill Encyclopedia of Science & Technology, 8th ed., 2000. Also available on CD-ROM: McGraw-Hill Multimedia Encyclopedia of Science & Technology, Release 2.0, 2000. link
  155. *Nachum Dershowitz and Naomi Lindenstrauss, 2000, “Abstract And Parallel Machines”, Computers and Artificial Intelligence, vol. 19, pp. 475-493.
  156. Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, and Alexander Serebrenik, “Automatic Termination Analysis of Programs Containing Arithmetic Predicates”, Nov. 2000, Informal publication, arXiv.org.
  157. Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, and Alexander Serebrenik, Dec. 2000, “A General Framework for Automatic Termination Analysis of Logic Programs”, Informal publication, arXiv:cs/0012008v1 [cs.PL].

    158. 1999

  158. 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.
  159. Nachum Dershowitz, May 1999, “Undecidability Results that Follow from Results in Recursion Theory” (Abstract), Abstracts of the Fifth International Workshop on Termination, Dagstuhl, Germany.
  160. Nachum Dershowitz, June 1999, “The Power of Simplification: A Survey on Rewriting in Theorem Proving” (Abstract), Bar-Ilan Symposium on Foundations of Artificial Intelligence.
  161. +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.
  162. Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, and Alexander Serebrenik, “Automatic Termination Analysis of Programs Containing Arithmetic Predicates”, Nov. 1999, Proceedings of the Verification of Logic Programs Workshop (Las Cruces, NM), Jan Smaus and Sandro Etalle, eds., Electronic Notes in Theoretical Computer Science, vol. 30, no. 1, pp. 39-58. link
  163. +Schulamith C. Halevy and Nachum Dershowitz, 1999, “Prácticas Ocultas de los ‘Anusim’ del Nuevo Mundo” (in Spanish), Encuentro y Alteridad: Vida y cultura judia en America Latina, J. B. Liwerant and A. G. de Backal, eds., UNAM, Mexico City, pp. 35-46. English version: “Obscure Practices among New World Anusim”.
  164. Nachum Dershowitz, Maribel Fernandez, and Jean-Pierre Jouannaud, May 1999, “Modular Confluence Revisited”, unpublished draft. See “Modular Church-Rosser Modulo: The Complete Picture” by Jean-Pierre Jouannaud and Yoshihito Toyama.

    165. 1998

  165. 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.
  166. *Nachum Dershowitz and Edward M. Reingold, 1998, “Implementing Solar Astronomical Calendars”, in: Birashkname, M. Akrami, ed., Shahid Beheshti University, Tehran, Iran, pp. 477-487.
  167. Nachum Dershowitz, May 1998, “Realistic Virtuality”, abstract of unpublished essay.
  168. 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.
  169. Nachum Dershowitz, Sept. 1998, “Calendar Function Inversion” (Abstract), CCL II Workshop, Jerusalem, Israel.
  170. #Nachum Dershowitz and Edward M. Reingold, Aug. 1998, “A Terrestrial Calendar for Mars” (Abstract), Program Book of the Founding Convention of the Mars Society, University of Colorado at Boulder, Boulder, CO, pp. 117-118.
  171. Nachum Dershowitz, 1998, photo credit, in Schulamith Chava Halevy, HaTirah HaPnimit (Interior Castle: Poems about Being and Being Coerced), in Hebrew, Eked, Tel-Aviv, 1998.
  172. °°Nachum Dershowitz and Ralf Treinen, 1998-2010, “The Complete List of RTA Open Problems”, maintained online at http://rtaloop.mancoosi.univ-paris-diderot.fr.
  173. Nachum Dershowitz and Shmuel Zaks, Feb. 1998, “Trees and Paths”, unpublished draft. See Xavier Viennot’s counterexample.
  174. Mitchell A. Harris and Nachum Dershowitz, 1998, “Ordered Construction of Combinatorial Objects”, unpublished draft. Cf. the theory of combinatorial species.

    175. 1997

  175. 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.
  176. 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.
  177. +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.
  178. +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.
  179. 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.
  180. Nachum Dershowitz and Edward M. Reingold, 1997, Calendrical Calculations, Cambridge University Press (307+xxi pages). Reviewed in: Nature (Jan. 1, 1998); European J. of Physics (Mar. 1998), Computing Reviews (May 1998); Math. Reviews 98g:01007; Astronomy Now (Aug. 1998); ISIS (Dec. 1998); British J. for the History of Science (Mar. 1999); The Mathematical Gazette (Mar 1999); Zbl 894.01023.
  181. Edward M. Reingold and Nachum Dershowitz, 1997, Calendrica 1.0 (Calendrical Calculations Software Package).

    182. 1996

  182. °Subrata Mitra and Nachum Dershowitz, Jan. 1996, “Matching and Unification in Rewrite Theories”, Technical Report ADTI-1996-001, IBM Software Solutions Division, San Jose, CA.
  183. Nachum Dershowitz, May 1996, “Trees, Ordinals, and Termination” (Abstract), Proceedings of the 3rd Workshop on Logic, Language, Information and Computation, Salvador, Brazil.
  184. Nachum Dershowitz, Sept. 1996, “Narrowing Streams” (Abstract), CCL II Workshop, Escorial, Spain.
  185. Nachum Dershowitz and Laurent Vigneron, “Rewriting Home Page” (web page), maintained online at http://www.rewriting.org.
  186. Nachum Dershowitz, “Software Horror Stories” (web page), maintained online at http://www.cs.tau.ac.il/~nachum/horror.html.

    187. 1995

  187. 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.
  188. Nachum Dershowitz, Jean-Pierre Jouannaud, and Jan Willem Klop, Feb. 1995, “Problems in Rewriting III”, Technical report IR-380, Computer Science, Vrije University, Amsterdam.
  189. 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.
  190. Nachum Dershowitz, 1995, “Contextual Termination” (Abstract), Second International Workshop on Termination, La Bresse, France.
  191. *Nachum Dershowitz and Charles Hoot, May 1995, “Natural Termination”, Theoretical Computer Science, vol. 142, no. 2, pp. 179-207. link
  192. +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.
  193. °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.
  194. ++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).
  195. +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.
  196. +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.
  197. Schulamith C. Halevy and Nachum Dershowitz, Dec. 1995, “40 Days to Revelation” (audio tape), Twenty-Seventh Conference of the Association for Jewish Studies (Boston, MA).

    198. 1994

  198. *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. link
  199. Nachum Dershowitz and Naomi Lindenstrauss, eds., July 1994, Abstracts of the International Workshop on Conditional (and Typed) Rewriting Systems, Hebrew University, Jerusalem, Israel.
  200. Nachum Dershowitz, July 1994, “Hierarchical Termination” (Extended Abstract), Abstracts of the International Workshop on Conditional (and Typed) Rewriting Systems, Hebrew University, Jerusalem, Israel. Drafted December 1992.
  201. 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.

    202. 1993

  202. +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.
  203. +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.
  204. *Edward M. Reingold, Nachum Dershowitz, and Stewart H. Clamen, Apr. 1993, “Calendrical Calculations II: Three Historical Calendars”, Software—Practice and Experience, vol. 23, no. 4, pp. 383-404. link
  205. 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.
  206. +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.
  207. +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.
  208. 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.
  209. 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.
  210. Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem Klop, 1993, “More Problems in Rewriting”, Report CS-R9332, Centrum voor Wiskunde en Informatica, Amsterdam.
  211. 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.
  212. Nachum Dershowitz, 1993, “A Taste of Rewriting”, Leibnitz Center for Research in Computer Science, Hebrew University, Technical report 93-5, Jerusalem, Israel.
  213. Alan Bundy, Nachum Dershowitz, Martin Golumbic, and Hélène Kirchner, editors, Aug. 1993, Proceedings of the Workshop on Heuristics and Search Guiding in Automated Theorem Proving, 13th International Conference on Artificial Intelligence, Chambery, France.
  214. *Nachum Dershowitz and Uday Reddy, 1993, “Deductive and Inductive Synthesis of Equational Programs”, J. of Symbolic Computation, vol. 15, pp. 467-494.
  215. *Nachum Dershowitz and Yuh-jeng Lee, 1993, “Logical Debugging”, J. of Symbolic Computation, vol. 15, pp. 745-773.
  216. +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.

    217. 1992

  217. Edward M. Reingold and Nachum Dershowitz, Apr. 1992, tree.sty (Binary Tree Drawing in LaTeX Using the PiCTeX Macros), TeX macro package.
  218. +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.
  219. Edward M. Reingold, Nachum Dershowitz, and Stewart H. Clamen, Apr. 1992, “Calendrical Calculations, II: Three Historical Calendars”, Report DCS-R-92-1743, Department of Computer Science, University of Illinois, Urbana, IL.
  220. 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.
  221. 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.
  222. 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.
  223. +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.
  224. +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.

    225. 1991

  225. 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.
  226. 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.
  227. +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.
  228. 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.
  229. Nachum Dershowitz, June 1991, “Natural Termination Proofs”, Proceedings of the Bar-Ilan Symposium on Foundations of Artificial Intelligence, Bar-Ilan University, Ramat-Gan, Israel.
  230. +Nachum Dershowitz, July 1991, “Canonical Sets of Horn Clauses”, Proceedings of the Eighteenth International Colloquium on Automata, Languages and Programming (ICALP), 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.
  231. +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.
  232. *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. link
  233. Nachum Dershowitz, Jean-Pierre Jouannaud, and Jan Willem Klop, Dec. 1991, “Open Problems in Rewriting”, Technical report CS-R9114, Computer Science, CWI, Amsterdam.

    234. 1990

  234. Nachum Dershowitz and Edward M. Reingold, Apr. 1990, rangecite.sty (Document-Style Option for any Style with Numeric Citations).
  235. *Nachum Dershowitz and Shmuel Zaks, 1990, “The Cycle Lemma and Some Applications”, European J. of Combinatorics, vol. 11, no. 1, pp. 35-40. Reviewed in Math. Reviews 91c:05011.
  236. *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.
  237. *Nachum Dershowitz and Mitsuhiro Okada, 1990, “A Rationale for Conditional Equational Programming”, Theoretical Computer Science, vol. 75, pp. 111-138. link
  238. 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.
  239. 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.
  240. Nachum Dershowitz, Aug. 1990, “Rewriting Methods for Word Problems”, Abstracts of International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, pp. 18-20.
  241. Nachum Dershowitz, Aug. 1990, “Infinite Rewriting”, Proceedings of Toyohashi Symposium on Theoretical Computer Science, K. Hashiguchi, ed., Toyohashi, Japan, pp. 27-31.
  242. *Nachum Dershowitz and Edward M. Reingold, Sept. 1990, “Calendrical Calculations”, Software—Practice and Experience, vol. 20, no. 9, pp. 899-928.
  243. +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.
  244. +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.
  245. +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.

    246. 1989

  246. 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.
  247. *N. Alan Josephson and Nachum Dershowitz, Jan./Mar. 1989, “An Implementation of Narrowing”, J. Logic Programming, vol. 6, no. 1&2, pp. 57-77. link
  248. ++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).
  249. 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.
  250. +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.
  251. +Nachum Dershowitz and Hon-Wai Leong, June 1989, “Fast Exchange Sorts”, Proceedings of the Third International Conference on Foundations of Data Organization and Algorithms, W. Litwin and H. J. Schek, eds., Lecture Notes in Computer Science, vol. 367, Springer-Verlag, Berlin, pp. 102-113. Accepted for publication in Computer J.
  252. 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 (ICALP), Stresa, Italy, Lecture Notes in Computer Science, vol. 372, Springer-Verlag, Berlin, pp. 249-262.
  253. *Nachum Dershowitz and Shmuel Zaks, 1989, “Patterns in Trees”, Discrete Applied Mathematics, vol. 25, no. 3, pp. 241-255. Reviewed in Math. Reviews 91a:05033. link
  254. *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.
  255. *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.
  256. Edward M. Reingold and Nachum Dershowitz, Sept. 1989, “Calendrical Calculations”, Report DCS-R-89-1541, Department of Computer Science, University of Illinois, Urbana, IL.
  257. *Leo Bachmair and Nachum Dershowitz, Oct. 1989, “Completion for Rewriting Modulo a Congruence”, Theoretical Computer Science, vol. 67, no. 2 & 3. link

    258. 1988

  258. *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.
  259. +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.
  260. +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 (LICS), Edinburgh, Scotland, pp. 104-111.
  261. *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.
  262. *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. link
  263. +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.
  264. 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.

    265. 1987

  265. *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.
  266. 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.
  267. Nachum Dershowitz and Yuh-jeng Lee, Apr. 1987, “Deductive Debugging”, Report DCS-F-87-961, Department of Computer Science, University of Illinois, Urbana, IL.
  268. 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.
  269. Nachum Dershowitz, May 1987, “Completion and Its Applications”, Preliminary Proceedings of the Colloquium on the Resolution of Equations in Algebraic Structures, Lakeway, TX.
  270. 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.
  271. +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.
  272. 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.
  273. +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.
  274. +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.
  275. 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.

    276. 1986

  276. 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.
  277. Nachum Dershowitz and David A. Plaisted, Apr. 1986, “Equational Programming”, Report R-86-1265, Department of Computer Science, University of Illinois, Urbana, IL.
  278. Leo Bachmair, Nachum Dershowitz and Jieh Hsiang, June 1986, “Orderings for Equational Proofs”, Proceedings of the IEEE Symposium on Logic in Computer Science (LICS), Cambridge, MA, pp. 346-357. Winner of LICS 2006 “Test-of-time” award.
  279. +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. link
  280. 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.
  281. *Nachum Dershowitz, 1986, “Programming by Analogy”, in: Machine Learning II: An Artificial Intelligence Approach, R. S. Michalski, J. G. Carbonell and T. M. Mitchell, eds., chap. 15, Morgan Kaufmann, Los Altos, CA, pp. 395-423.
  282. 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.
  283. *Nachum Dershowitz and Shmuel Zaks, Nov. 1986, “Ordered Trees and Non-Crossing Partitions (Note)”, Discrete Mathematics, vol. 62, no. 2, pp. 215-218. Reviewed in Math. Reviews 88c:05008. link
  284. D. N. Jayasimha and Nachum Dershowitz, Dec. 1986, “Bounded Fairness”, Technical Report 615, Center for Supercomputing Research and Development, University of Illinois, Urbana, IL.

    285. 1985

  285. Nachum Dershowitz and Shmuel Zaks, Jan. 1985, “Patterns in Trees”, Report LCS/TM-271, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA.
  286. 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). link
  287. 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. link
  288. *Nachum Dershowitz, Mar. 1985, “Synthetic Programming”, Artificial Intelligence, vol. 25, pp. 323-373. Reviewed in Computing Reviews 8601-0062. link
  289. Nachum Dershowitz, Mar. 1985, “Synthesis by Completion”, Interim report, Center for Applied Logic and Artificial Intelligence, Bar-Ilan University, Ramat-Gan, Israel.
  290. 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.
  291. *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. link
  292. *Nachum Dershowitz, July 1985, “Program Abstraction and Instantiation”, ACM Trans. on Programming Languages and Systems, vol. 7, no. 3, pp. 446-477.
  293. 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.
  294. Nachum Dershowitz, Aug. 1985, “Synthesis by Completion”, Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, CA, pp. 208-214.
  295. Nachum Dershowitz, Aug. 1985, “Termination of Rewriting”, Report R-85-1220, Department of Computer Science, University of Illinois, Urbana, IL.
  296. Nachum Dershowitz, Oct. 1985, “Completeness of Completion” (Abstract), Bulletin of the European Association for Theoretical Computer Science, vol. 27, pp. 94.
  297. 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.

    298. 1984

  298. Nachum Dershowitz, Jan. 1984, “Programming by Analogy”, Rapport, Laboratoire de Recherche en Informatique, Universite de Paris-Sud, Orsay, France.
  299. Nachum Dershowitz and Shmuel Zaks, Mar. 1984, “Patterns in Trees”, Ninth Colloquium on Trees in Algebra and Programming (CAAP), B. Courcelle, ed., Cambridge University Press, Bordeaux, France, pp. 93-102.
  300. 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.
  301. 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.
  302. 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.
  303. °KBPA Research Group (Mehdi T. Harandi, Donald Michie, Roy H. Campbell, Nachum Dershowitz, David A. Plaisted, eds.), Dec. 1984, “Knowledge-Based Programming Assistant: An Intelligent Programming Support Environment”, Progress Report (Jan.-Dec. 1984), Department of Computer Science, University of Illinois, Urbana, IL.

    304. 1983

  304. 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.
  305. **Nachum Dershowitz, 1983, The Evolution of Programs, Birkhäuser, Boston, MA (358 pages). Reviewed in Computing Reviews 84:09-0705, Software Maintenance News, Dec. 1984, Zbl 642.68002, and IEEE Software, May 1985. 
  306. 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.
  307. °Nachum Dershowitz, May 1983, “Well-Founded Orderings”, Technical Report ATR-83(8478)-3, Office of Information Sciences Research, The Aerospace Corporation, El Segundo, CA. Includes three notes: “Building well-founded orderings”; “Implementing recursive path orderings”; “A termination proof that requires more than polynomials”.
  308. Nachum Dershowitz, June 1983, “Programming by Analogy”, Proceedings of the Second International Workshop on Machine Learning, University of Illinois, Monticello, IL, pp. 26-31.
  309. +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 (ICALP), Barcelona, Spain, Lecture Notes in Computer Science, vol. 154, Springer-Verlag, Berlin, pp. 331-346.
  310. +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.
  311. 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.

    312. 1982

  312. *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”. link
  313. Nachum Dershowitz and Shmuel Zaks, Apr. 1982, “The Cycle Lemma and Some Applications”, Technical Report 238, Department of Computer Science, Technion, Haifa, Israel.
  314. °George F. Badger, Jr., Roy H. Campbell, Nachum Dershowitz, Mehdi T. Harandi, Andrew L. Laursen, Ryszard S. Michalski, Donald Michie, Robert Penka and Margaret Simmonds, Apr. 1982, “Knowledge Based Programming Assistant, KBPA-1”, Report DCS-F-82-894, Department of Computer Science, University of Illinois, Urbana, IL.
  315. Nachum Dershowitz, Dec. 1982, “Applications of the Knuth-Bendix Completion Procedure”, Proceedings of the Seminaire d’Informatique Theorique, Paris, France, pp. 95-111.
  316. 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.

    317. 1981

  317. Nachum Dershowitz and Shmuel Zaks, Mar. 1981, “Applied Tree Enumerations”, Proceedings of the Sixth Colloquium on Trees in Algebra and Programming (CAAP), Genoa, Italy, Lecture Notes in Computer Science, vol. 112, Springer-Verlag, Berlin, pp. 180-193. Reviewed in Math. Reviews 83d:68060.
  318. *Nachum Dershowitz and Zohar Manna, Mar. 1981, “Inference Rules for Program Annotation”, IEEE Trans. on Software Engineering, vol. SE-7, no. 2, pp. 207-222. link
  319. Nachum Dershowitz, Mar. 1981, “The Evolution of Programs: Program Abstraction and Instantiation”, Proceedings of the Fifth International Conference on Software Engineering, San Diego, CA, pp. 79-89. link
  320. Nachum Dershowitz, June 1981, “The Evolution of Programs: Program Abstraction and Instantiation”, Report DCS-R-80-1011, Department of Computer Science, University of Illinois, Urbana, IL.
  321. +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 (ICALP), Acre, Israel, Lecture Notes in Computer Science, vol. 115, Springer-Verlag, Berlin, pp. 448-458.

    322. 1980

  322. Zohar Manna (prepared in cooperation with N. Dershowitz), Jan. 1980, Synthesized Structured Programming, Final Technical Report RADC-TR-79-326, Rome Air Development Center, Air Force Systems Command.
  323. Nachum Dershowitz, May 1980, “The Evolution of Programs”, Report DCS-R-80-1017, Department of Computer Science, University of Illinois, Urbana, IL.
  324. Nachum Dershowitz, 1980, “On the Representation of Ordinals up to Γ0”, Unpublished, Department of Computer Science, University of Illinois, Urbana, IL.
  325. *Nachum Dershowitz and Shmuel Zaks, July 1980, “Enumerations of Ordered Trees”, Discrete Mathematics, vol. 31, no. 1, pp. 9-28. Reviewed in Math. Reviews 81g:05069 and Zbl 443.05049. link
  326. *Nachum Dershowitz, Nov. 1980, “The Schorr-Waite Marking Algorithm Revisited”, Information Processing Letters, vol. 11, no. 3, pp. 141-143. link

    327. 1979

  327. Nachum Dershowitz, Apr. 1979, “A Note on Simplification Orderings”, Report DCS-4-79-986, Department of Computer Science, University of Illinois, Urbana, IL.
  328. Nachum Dershowitz and Shmuel Zaks, June 1979, “Enumerations of Ordered Trees”, Report DCS-R-79-970, Department of Computer Science, University of Illinois, Urbana, IL.
  329. Nachum Dershowitz and Zohar Manna, July 1979, “Proving Termination with Multiset Orderings”, Proceedings of the Sixth International EATCS Colloquium on Automata, Languages and Programming (ICALP), Graz, Austria, Lecture Notes in Computer Science, vol. 71, Springer-Verlag, Berlin, pp. 188-202.
  330. *Nachum Dershowitz and Zohar Manna, Aug. 1979, “Proving Termination With Multiset Orderings”, Communications of the ACM, vol. 22, no. 8, pp. 465-476.
  331. Nachum Dershowitz, Aug. 1979, “Orderings for Term-Rewriting Systems”, Report DCS-R-79-987, Department of Computer Science, University of Illinois, Urbana, Il.
  332. 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.
  333. *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. link
  334. Nachum Dershowitz, Nov. 1979, “The Schorr-Waite Marking Algorithm Revisited”, Report DCS-R-79-999, Department of Computer Science, University of Illinois, Urbana, IL.

    335. 1978

  335. *Rony Attar, Yaacov Choueka, Nachum Dershowitz, and Aviezri S. Fraenkel, Jan. 1978, “KEDMA—Linguistic Tools for Retrieval Systems”, J. of the Association of Computing Machinery, vol. 25, no. 1, pp. 52-66. Reviewed in Computing Reviews 19:33,532 and Math. Reviews 57 #4702. link
  336. 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.
  337. Nachum Dershowitz and Zohar Manna, May 1978, “Inference Rules for Program Annotation”, Proceedings of the Third International Conference on Software Engineering, Atlanta, GA, pp. 158-166. Reviewed in Computing Reviews 20:34,421.

    338. 1977

  338. Nachum Dershowitz and Zohar Manna, Jan. 1977, “The Evolution of Programs: A System for Automatic Program Modification”, Proceedings of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, CA, pp. 144-154. link
  339. Nachum Dershowitz, Aug. 1977, “Automatic Program Annotation”, Proceedings of the Fifth International Joint Conference on Artificial Intelligence, Cambridge, MA, pp. 378.
  340. Nachum Dershowitz and Zohar Manna, Oct. 1977, “Inference Rules for Program Annotation”, Memo AIM-303, STAN-CS-77-631, Stanford Artificial Intelligence Laboratory, Stanford University, Stanford, CA.
  341. *Nachum Dershowitz and Zohar Manna, Nov. 1977, “The Evolution of Programs: Automatic Program Modification”, IEEE Trans. on Software Engineering, vol. SE-3, no. 6, pp. 377-385. Reviewed in Computing Reviews 19:32,987 and Math. Reviews 56 #10100. link

    342. 1976

  342. Nachum Dershowitz and Zohar Manna, Dec. 1976, “The Evolution of Programs: A System for Automatic Program Modification”, Memo AIM-294, STAN-CS-76-586, Stanford Artificial Intelligence Laboratory, Stanford University, Stanford, CA.

    343. 1975

  343. *Nachum Dershowitz, 1975, “A Simplified Loop-Free Algorithm for Generating Permutations”, BIT, vol. 15, no. 2, pp. 158-164. Reviewed in Zbl 0317.05006. link
  344. Nachum Dershowitz and Zohar Manna, July 1975, “On Automating Structured Programming”, Report, Department of Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel.
  345. Nachum Dershowitz and Zohar Manna, July 1975, “On Automating Structured Programming”, Proceedings of the IRIA Symposium on Proving and Improving Programs, Arc-et-Senans, France, pp. 167-193.

Legend

**Book (latest edition)
++Edited work
°°Collection
*Journal article or chapter in book
+Review or conference paper (refereed or invited; not superceded)
#Abstract (not superceded)
°Technical report (not superceded)
linkPublisher copy (may require subscription)