Nachum Dershowitz

Nachum Dershowitz, Edward M. Reingold: Modulo intervals: a proposed notation. SIGACT News 43(3): 60-64 (2012)

Nachum Dershowitz: Jumping and escaping: Modular termination and the abstract path ordering. Theor. Comput. Sci. 464: 35-47 (2012)

Kfir Bar, Nachum Dershowitz: Deriving Paraphrases for Highly Inflected Languages from Comparable Documents. COLING 2012: 185-200

Olivier Bournez, Nachum Dershowitz, Evgenia Falkovich: Towards an Axiomatization of Simple Analog Algorithms. TAMC 2012: 525-536

Lior Wolf, Rotem Littman, Naama Mayer, Tanya German, Nachum Dershowitz, Roni Shweka, Yaacov Choueka: Identifying Join Candidates in the Cairo Genizah. International Journal of Computer Vision 94(1): 118-135 (2011)

José Félix Costa, Nachum Dershowitz: Introduction. Natural Computing 10(4): 1215-1217 (2011)

Moshe Koppel, Navot Akiva, Idan Dershowitz, Nachum Dershowitz: Unsupervised Decomposition of a Document into Authorial Components. ACL 2011: 1356-1364

Lior Wolf, Lior Litwak, Nachum Dershowitz, Roni Shweka, Yaacov Choueka: Active clustering of document fragments using information derived from both images and catalogs. ICCV 2011: 1661-1667

Lior Wolf, Liza Potikha, Nachum Dershowitz, Roni Shweka, Yaacov Choueka: Computerized paleography: Tools for historical manuscripts. ICIP 2011: 3545-3548

Nachum Dershowitz: The Generic Model of Computation. DCM 2011: 59-71

Nachum Dershowitz, Evgenia Falkovich: A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-. DCM 2011: 72-78

Nachum Dershowitz, Alexander Nadel: From Total Assignment Enumeration to Modern SAT Solver. CoRR abs/1110.5867 (2011)

Nachum Dershowitz, Iddo Tzameret: Complexity of propositional proofs under a promise. ACM Trans. Comput. Log. 11(3) (2010)

Andreas Blass, Nachum Dershowitz, Wolfgang Reisig: Yuri, Logic, and Computer Science. Fields of Logic and Computation 2010: 1-48

Udi Boker, Nachum Dershowitz: Three Paths to Effectiveness. Fields of Logic and Computation 2010: 135-146

Andreas Blass, Nachum Dershowitz, Yuri Gurevich: Exact Exploration and Hanging Algorithms. CSL 2010: 140-154

Andreas Blass, Nachum Dershowitz, Wolfgang Reisig (Eds.): Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday. Lecture Notes in Computer Science 6300, Springer 2010, isbn 978-3-642-15024-1

Udi Boker, Nachum Dershowitz: The influence of domain interpretations on computational models. Applied Mathematics and Computation 215(4): 1323-1339 (2009)

Andreas Blass, Nachum Dershowitz, Yuri Gurevich: When are two algorithms the same? Bulletin of Symbolic Logic 15(2): 145-168 (2009)

Nachum Dershowitz, Shmuel Zaks: More Patterns in Trees: Up and Down, Young and Old, Odd and Even. SIAM J. Discrete Math. 23(1): 447-465 (2009)

Nachum Dershowitz: On Lazy Commutation. Languages: From Formal to Natural 2009: 59-82

Cristian S. Calude, José Félix Costa, Nachum Dershowitz, Elisabete Freire, Grzegorz Rozenberg (Eds.): Unconventional Computation, 8th International Conference, UC 2009, Ponta Delgada, Azores, Portugal, September 7-11, 2009. Proceedings. Lecture Notes in Computer Science 5715, Springer 2009, isbn 978-3-642-03744-3

Nachum Dershowitz, Edward M. Reingold: Calendrical calculations (3. ed.). Cambridge University Press 2008, isbn 978-0-521-88540-9, pp. I-XXIX, 1-479

Nachum Dershowitz, Yuri Gurevich: A Natural Axiomatization of Computability and Proof of Church's Thesis. Bulletin of Symbolic Logic 14(3): 299-350 (2008)

Arnon Avron, Nachum Dershowitz, Alexander Rabinovich: Boris A. Trakhtenbrot: Academic Genealogy and Publications. Pillars of Computer Science 2008: 46-57

Nachum Dershowitz, Claude Kirchner: SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets. Concurrency, Graphs and Models 2008: 194-208

Udi Boker, Nachum Dershowitz: The Church-Turing Thesis over Arbitrary Domains. Pillars of Computer Science 2008: 199-229

Nachum Dershowitz: Canonicity! IJCAR 2008: 327-331

Maria Paola Bonacina, Nachum Dershowitz: Canonical Inference for Implicational Systems. IJCAR 2008: 380-395

Nachum Dershowitz: Bit Inference. PAAR/ESHOL 2008

Arnon Avron, Nachum Dershowitz, 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 4800, Springer 2008, isbn 978-3-540-78126-4

Andreas Blass, Nachum Dershowitz, Yuri Gurevich: When are two algorithms the same? CoRR abs/0811.0811 (2008)

Nachum Dershowitz, E. Castedo Ellerman: Leanest quasi-orderings. Inf. Comput. 205(4): 535-556 (2007)

Maria Paola Bonacina, Nachum Dershowitz: Abstract canonical inference. ACM Trans. Comput. Log. 8(1) (2007)

Nachum Dershowitz, Georg Moser: The Hydra Battle Revisited. Rewriting, Computation and Proof 2007: 1-27

Nachum Dershowitz, Iddo Tzameret: Complexity of Propositional Proofs Under a Promise. ICALP 2007: 291-302

Nachum Dershowitz, Ziyad Hanna, Alexander Nadel: Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver. SAT 2007: 287-293

Nachum Dershowitz, Andrei Voronkov (Eds.): Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings. Lecture Notes in Computer Science 4790, Springer 2007, isbn 978-3-540-75558-6

Nachum Dershowitz, Iddo Tzameret: Complexity of Propositional Proofs under a Promise. CoRR abs/0707.4255 (2007)

Jacob Katz, Ziyad Hanna, Nachum Dershowitz: Space-Efficient Bounded Model Checking. CoRR abs/0710.4629 (2007)

Udi Boker, Nachum Dershowitz: A hypercomputational alien. Applied Mathematics and Computation 178(1): 44-57 (2006)

Udi Boker, Nachum Dershowitz: Abstract Effective Models. Electr. Notes Theor. Comput. Sci. 135(3): 15-23 (2006)

Udi Boker, Nachum Dershowitz: Comparing Computational Power. Logic Journal of the IGPL 14(5): 633-647 (2006)

Nachum Dershowitz, Claude Kirchner: Abstract canonical presentations. Theor. Comput. Sci. 357(1-3): 53-69 (2006)

Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, Daher Kaiss: Boolean Rings for Intersection-Based Satisfiability. LPAR 2006: 482-496

Nachum Dershowitz, Ziyad Hanna, Alexander Nadel: A Scalable Algorithm for Minimal Unsatisfiable Core Extraction. SAT 2006: 36-41

Nachum Dershowitz, Ziyad Hanna, Alexander Nadel: A Scalable Algorithm for Minimal Unsatisfiable Core Extraction. CoRR abs/cs/0605085 (2006)

Nachum Dershowitz, Mitchell A. Harris, Guan-Shieng Huang: Enumeration Problems Related to Ground Horn Theories. CoRR abs/cs/0610054 (2006)

Yulik Feldman, Nachum Dershowitz, Ziyad Hanna: Parallel Multithreaded Satisfiability Solver: Design and Implementation. Electr. Notes Theor. Comput. Sci. 128(3): 75-90 (2005)

Nachum Dershowitz: Book review: Term Rewriting Systems by "Terese" (Marc Bezem, Jan Willem Klop, and Roel de Vrijer, eds.), Cambridge University Press, Cambridge Tracts in Theoretical Computer Science 55, 2003, hard cover: ISBN 0-521-39115-6. TPLP 5(3): 395-399 (2005)

Nachum Dershowitz: Primitive Rewriting. Processes, Terms and Cycles 2005: 127-147

Udi Boker, Nachum Dershowitz: How to Compare the Power of Computational Models. CiE 2005: 54-64

Jacob Katz, Ziyad Hanna, Nachum Dershowitz: Space-Efficient Bounded Model Checking. DATE 2005: 686-687

Nachum Dershowitz: The Four Sons of Penrose. LPAR 2005: 125-138

Nachum Dershowitz, E. Castedo Ellerman: Leanest Quasi-orderings. RTA 2005: 32-45

Nachum Dershowitz: Open. Closed. Open. RTA 2005: 376-393

Nachum Dershowitz, Ziyad Hanna, Alexander Nadel: A Clause-Based Heuristic for SAT Solvers. SAT 2005: 46-60

Nachum Dershowitz, Ziyad Hanna, Jacob Katz: Bounded Model Checking with QBF. SAT 2005: 408-414

Udi Boker, Nachum Dershowitz: Comparing Computational Power. CoRR abs/cs/0510069 (2005)

Nachum Dershowitz: Termination by Abstraction. ICLP 2004: 1-18

Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, Daher Kaiss: Boolean Ring Satisfiability. SAT 2004

Maria Paola Bonacina, Nachum Dershowitz: Abstract Canonical Inference. CoRR cs.LO/0406030 (2004)

Nachum Dershowitz, Iddo Tzameret: Gap Embedding for Well-Quasi-Orderings. Electr. Notes Theor. Comput. Sci. 84: 80-90 (2003)

Nachum Dershowitz: Canonicity. Electr. Notes Theor. Comput. Sci. 86(1): 120-132 (2003)

Nachum Dershowitz: Pæan to Zohar Manna. Verification: Theory and Practice 2003: 1-10

Nachum Dershowitz, D. N. Jayasimha, Seungjoon Park: Bounded Fairness. Verification: Theory and Practice 2003: 304-317

Nachum Dershowitz, Claude Kirchner: Abstract Saturation-Based Inference. LICS 2003: 65-74

Nachum Dershowitz (Ed.): Verification: Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday. Lecture Notes in Computer Science 2772, Springer 2003, isbn 3-540-21002-4

Nachum Dershowitz: Ground Canonicity. CoRR cs.LO/0304017 (2003)

Edward M. Reingold, Nachum Dershowitz: Calendrical calcuations - the millenium edition. Cambridge University Press 2002, isbn 978-0-521-77752-0, pp. I-XXXII, 1-422

Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: A General Framework for Automatic Termination Analysis of Logic Programs. Appl. Algebra Eng. Commun. Comput. 12(1/2): 117-156 (2001)

Nachum Dershowitz, David A. Plaisted: Rewriting. Handbook of Automated Reasoning 2001: 535-610

Nachum Dershowitz: Artificial intelligence: Retrospective/prospective. Ann. Math. Artif. Intell. 28(1-4): 3-5 (2000)

Naomi Lindenstrauss, Nachum Dershowitz: Abstract and-parallel Machines. Computers and Artificial Intelligence 19(5) (2000)

Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: Automatic Termination Analysis of Programs Containing Arithmetic Predicates. CoRR cs.PL/0011036 (2000)

Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: A General Framework for Automatic Termination Analysis of Logic Programs. CoRR cs.PL/0012008 (2000)

Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik: Automatic Termination Analysis of Programs Containing Arithmetic Predicates. Electr. Notes Theor. Comput. Sci. 30(1): 39-58 (1999)

Nachum Dershowitz, Subrata Mitra: Jeopardy. RTA 1999: 16-29

Nachum Dershowitz, Ralf Treinen: An On-line Problem Database. RTA 1998: 332-342

Nachum Dershowitz, Naomi Lindenstrauss: Abstract And-Parallel Machines. Euro-Par 1997: 1221-1225

Nachum Dershowitz: When are Two Rewrite Systems More than None? MFCS 1997: 37-43

Nachum Dershowitz: Innocuous Constructor-Sharing Combinations. RTA 1997: 202-216

Nachum Dershowitz, Charles Hoot: Natural Termination. Theor. Comput. Sci. 142(2): 179-207 (1995)

Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop: Problems in Rewriting III. RTA 1995: 457-471

Nachum Dershowitz: Goal Solving as Operational Semantics. ILPS 1995: 3-17

Nachum Dershowitz, Naomi Lindenstrauss (Eds.): Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, Proceedings. Lecture Notes in Computer Science 968, Springer 1995, isbn 3-540-60381-6

Leo Bachmair, Nachum Dershowitz: Equational Inference, Canonical Proofs, and Proof Orderings. J. ACM 41(2): 236-276 (1994)

Nachum Dershowitz: From Specifications to Programs: Induction in the Service of Synthesis (Abstract). AII/ALT 1994: 6-7

Nachum Dershowitz: Hierachical Termination. CTRS 1994: 89-105

Nachum Dershowitz, Uday S. Reddy: Deductive and Inductive Synthesis of Equational Programs. J. Symb. Comput. 15(5/6): 467-494 (1993)

Nachum Dershowitz, Yuh-Jeng Lee: Logical Debugging. J. Symb. Comput. 15(5/6): 745-773 (1993)

Edward M. Reingold, Nachum Dershowitz, Stewart M. Clamen: Calendrical Calculations, II: Three Historical Calendars. Softw., Pract. Exper. 23(4): 383-404 (1993)

Yuh-Jeng Lee, Nachum Dershowitz: Debugging Logic Programs Using Specifications. AADEBUG 1993: 75-84

Nachum Dershowitz: Examples of Termination. Term Rewriting 1993: 16-26

Nachum Dershowitz, Subrata Mitra: Higher-Order and Semantic Unification. FSTTCS 1993: 139-150

Nachum Dershowitz: A Taste of Rewrite Systems. Functional Programming, Concurrency, Simulation and Automated Reasoning 1993: 199-228

Nachum Dershowitz, Charles Hoot: Topics in Termination. RTA 1993: 198-212

Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop: More Problems in Rewriting. RTA 1993: 468-487

Nachum Dershowitz: Trees, Ordinals and Termination. TAPSOFT 1993: 243-250

Nachum Dershowitz, Subrata Mitra, G. Sivakumar: Decidable Matching for Convergent Systems (Preliminary Version). CADE 1992: 589-602

Nachum Dershowitz, Subrata Mitra: Path Orderings for Termination of Associative-Commutative Rewriting. CTRS 1992: 168-174

Nachum Dershowitz: Semigroups Satisfying x^m+n = xⁿ. CTRS 1992: 307-314

Nachum Dershowitz, Edward M. Reingold: Ordinal Arithmetic with List Structures. LFCS 1992: 117-126

Nachum Dershowitz, Jean-Pierre Jouannaud: Notations for Rewting. Bulletin of the EATCS 43: 162-174 (1991)

Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted: Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . . . Theor. Comput. Sci. 83(1): 71-96 (1991)

Nachum Dershowitz: Cononical Sets of Horn Clauses. ICALP 1991: 267-278

Nachum Dershowitz: Ordering-Based Strategies for Horn Clauses. IJCAI 1991: 118-125

Nachum Dershowitz, Jean-Pierre Jouannaud, Jan Willem Klop: Open Problems in Rewriting. RTA 1991: 445-456

Nachum Dershowitz, Edward M. Reingold: Calendrical Calculations. Softw., Pract. Exper. 20(9): 899-928 (1990)

Nachum Dershowitz, Mitsuhiro Okada: A Rationale for Conditional Equational Programming. Theor. Comput. Sci. 75(1&2): 111-138 (1990)

Nachum Dershowitz, Eli Pinchover: Inductive Synthesis of Equational Programs. AAAI 1990: 234-239

Nachum Dershowitz, Subrata Mitra, G. Sivakumar: Equation Solving in Conditional AC-Theories. ALP 1990: 283-297

Nachum Dershowitz, Naomi Lindenstrauss: An Abstract Concurrent Machine for Rewriting. ALP 1990: 318-331

Nachum Dershowitz: A Maximal-Literal Unit Strategy for Horn Clauses. CTRS 1990: 14-25

Nachum Dershowitz, Jean-Pierre Jouannaud: Rewrite Systems. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 243-320

Nachum Dershowitz, Shmuel Zaks: Patterns in trees. Discrete Applied Mathematics 25(3): 241-255 (1989)

N. Alan Josephson, Nachum Dershowitz: An Implementation of Narrowing. J. Log. Program. 6(1&2): 57-77 (1989)

Leo Bachmair, Nachum Dershowitz: Completion for Rewriting Modulo a Congruence. Theor. Comput. Sci. 67(2&3): 173-201 (1989)

Nachum Dershowitz, Hon Wai Leong: Fast Exchange Sorts. FODO 1989: 102-113

Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted: Infinite Normal Forms (Preliminary Version). ICALP 1989: 249-262

Nachum Dershowitz, Naomi Lindenstrauss: Average Time Analyses Related to Logic Programming. ICLP 1989: 369-381

Nachum Dershowitz, Stéphane Kaplan: Rewrite, Rewrite, Rewrite, Rewrite, Rewrite. POPL 1989: 250-259

Nachum Dershowitz (Ed.): Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings. Lecture Notes in Computer Science 355, Springer 1989, isbn 3-540-51081-8

Leo Bachmair, Nachum Dershowitz: Critical Pair Criteria for Completion. J. Symb. Comput. 6(1): 1-18 (1988)

Nachum Dershowitz, Leo Marcus, Andrzej Tarlecki: Existence, Uniqueness, and Construction of Rewrite Systems. SIAM J. Comput. 17(4): 629-639 (1988)

Nachum Dershowitz, G. Sivakumar: Goal-Directed Equation Solving. AAAI 1988: 166-170

Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar: Canonical Conditional Rewrite Systems. CADE 1988: 538-549

Nachum Dershowitz, Mitsuhiro Okada: Conditional Equational Programming and the Theory of Conditional Term Rewriting. FGCS 1988: 337-346

Nachum Dershowitz, Mitsuhiro Okada: Proof-Theoretic Techniques for Term Rewriting Theory. LICS 1988: 104-111

Nachum Dershowitz: Termination of Rewriting. J. Symb. Comput. 3(1/2): 69-116 (1987)

Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar: Confluence of Conditional Rewrite Systems. CTRS 1987: 31-44

Nachum Dershowitz, G. Sivakumar: Solving Goals in Equational Languages. CTRS 1987: 45-55

Leo Bachmair, Nachum Dershowitz: A critical pair criterion for completion modulo a congruence. EUROCAL 1987: 452-453

Leo Bachmair, Nachum Dershowitz: Inference Rules for Rewrite-Based First-Order Theorem Proving. LICS 1987: 331-337

Leo Bachmair, Nachum Dershowitz: Completion for Rewriting Modulo a Congruence. RTA 1987: 192-203

Nachum Dershowitz, Yuh-Jeng Lee: Deductive Debugging. SLP 1987: 298-306

Nachum Dershowitz, Shmuel Zaks: Ordered trees and non-crossing partitions. Discrete Mathematics 62(2): 215-218 (1986)

Leo Bachmair, Nachum Dershowitz: Commutation, Transformation, and Termination. CADE 1986: 5-20

Leo Bachmair, Nachum Dershowitz: Critical-pair criteria for the Knuth-Bendix completion procedure. SYMSAC 1986: 215-217

Leo Bachmair, Nachum Dershowitz, Jieh Hsiang: Orderings for Equational Proofs. LICS 1986: 346-357

N. Alan Josephson, Nachum Dershowitz: An Implementation of Narrowing: The RITE Way. SLP 1986: 187-197

Nachum Dershowitz: Synthetic Programming. Artif. Intell. 25(3): 323-373 (1985)

Nachum Dershowitz: Computing with Rewrite Systems. Information and Control 65(2/3): 122-157 (1985)

Nachum Dershowitz: Program Abstraction and Instantiation. ACM Trans. Program. Lang. Syst. 7(3): 446-477 (1985)

Nachum Dershowitz: Synthesis by Completion. IJCAI 1985: 208-214

Nachum Dershowitz: Termination. RTA 1985: 180-224

Nachum Dershowitz, David A. Plaisted: Logic Programming cum Applicative Programming. SLP 1985: 54-66

Nachum Dershowitz, Shmuel Zaks: Patterns in Trees. CAAP 1984: 93-102

Nachum Dershowitz, N. Alan Josephson: Logic Programming by Completion. ICLP 1984: 313-320

Jieh Hsiang, Nachum Dershowitz: Rewrite Methods for Clausal and Non-Clausal Theorem Proving. ICALP 1983: 331-346

Nachum Dershowitz, Jieh Hsiang, N. Alan Josephson, David A. Plaisted: Associative-Commutative Rewriting. IJCAI 1983: 940-944

Nachum Dershowitz: Orderings for Term-Rewriting Systems. Theor. Comput. Sci. 17: 279-301 (1982)

Nachum Dershowitz, Zohar Manna: Inference Rules for Program Annotation. IEEE Trans. Software Eng. 7(2): 207-222 (1981)

Nachum Dershowitz, Shmuel Zaks: Applied Tree Enumerations. CAAP 1981: 180-193

Nachum Dershowitz: Termination of Linear Rewriting Systems (Preliminary Version). ICALP 1981: 448-458

Nachum Dershowitz: The Evolution of Programs: Program Abstraction and Instantiation. ICSE 1981: 79-89

Nachum Dershowitz, Shmuel Zaks: Enumerations of ordered trees. Discrete Mathematics 31(1): 9-28 (1980)

Nachum Dershowitz: The Schorr-Waite Marking Algorithm Revisited. Inf. Process. Lett. 11(3): 141-143 (1980)

Nachum Dershowitz, Zohar Manna: Proving Termination with Multiset Orderings. Commun. ACM 22(8): 465-476 (1979)

Nachum Dershowitz: A Note on Simplification Orderings. Inf. Process. Lett. 9(5): 212-215 (1979)

Nachum Dershowitz: Orderings for Term-Rewriting Systems. FOCS 1979: 123-131

Nachum Dershowitz, Zohar Manna: Proving termination with Multiset Orderings. ICALP 1979: 188-202

R. Attar, Yaacov Choueka, Nachum Dershowitz, Aviezri S. Fraenkel: KEDMA - Linguistic Tools for Retrieval Systems. J. ACM 25(1): 52-66 (1978)

Nachum Dershowitz, Zohar Manna: Inference Rules for Program Annotation. ICSE 1978: 158-167

Nachum Dershowitz, Zohar Manna: The Evolution of Programs: Automatic Program Modification. IEEE Trans. Software Eng. 3(6): 377-385 (1977)

Nachum Dershowitz: Automatic Program Annotation. IJCAI 1977: 378

Nachum Dershowitz, Zohar Manna: The Evolution of Programs: A System for Automatic Program Modification. POPL 1977: 144-154