Nachum Dershowitz
Israeli computer scientist
Nachum Dershowitz's AcademicInfluence.com Rankings
Download Badge
Computer Science Mathematics
Why Is Nachum Dershowitz Influential?
(Suggest an Edit or Addition)According to Wikipedia, Nachum Dershowitz is an Israeli computer scientist, known e.g. for the Dershowitz–Manna ordering and the multiset path ordering used to prove termination of term rewrite systems. He obtained his B.Sc. summa cum laude in 1974 in Computer Science–Applied Mathematics from Bar-Ilan University, and his Ph.D. in 1979 in Applied Mathematics from the Weizmann Institute of Science. From 1978, he worked at the Department of Computer Science of the University of Illinois at Urbana-Champaign, and was hired as a full professor of the Tel Aviv University in 1998. He was a guest researcher at Weizmann Institute, INRIA, ENS Cachan, Microsoft Research, and the universities of Stanford, Paris, Jerusalem, Chicago, and Beijing. He received the Herbrand Award for Distinguished Contributions to Automatic Reasoning in 2011.
Nachum Dershowitz's Published Works
Published Works
- Rewrite Systems (1991) (1777)
- Orderings for term-rewriting systems (1979) (765)
- Proving termination with multiset orderings (1979) (673)
- Termination of Rewriting (1987) (488)
- In handbook of automated reasoning (2001) (305)
- Orderings for Equational Proofs (1986) (173)
- Commutation, Transformation, and Termination (1986) (143)
- Verification: Theory and Practice (2004) (134)
- Computing with Rewrite Systems (1985) (126)
- Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243. (1989) (124)
- A Rationale for Conditional Equational Programming (1990) (122)
- Completion for Rewriting Modulo a Congruence (1987) (120)
- A Natural Axiomatization of Computability and Proof of Church's Thesis (2008) (115)
- Rewrite Methods for Clausal and Non-Clausal Theorem Proving (1983) (108)
- Calendrical calculations (1990) (107)
- A Note on Simplification Orderings (1979) (105)
- Equational inference, canonical proofs, and proof orderings (1994) (101)
- Bounded Model Checking with QBF (2005) (93)
- Equational programming (1986) (91)
- Canonical Conditional Rewrite Systems (1988) (89)
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction (2006) (89)
- Termination of Linear Rewriting Systems (Preliminary Version) (1981) (87)
- Confluence of Conditional Rewrite Systems (1988) (87)
- Verification : theory and practice : essays dedicated to Zohar Manna on the occasion of his 64th birthday (2004) (85)
- Enumerations of ordered trees (1980) (85)
- Logic Programming cum Applicative Programming (1985) (82)
- A General Framework for Automatic Termination Analysis of Logic Programs (2000) (82)
- Rewrite, rewrite, rewrite, rewrite, rewrite... (1989) (81)
- Completion and Its Applications (1989) (80)
- The Cycle Lemma and Some Applications (1990) (77)
- Chapter 9 – Rewriting (2001) (77)
- Parallel Multithreaded Satisfiability Solver: Design and Implementation (2005) (77)
- Natural Termination (1995) (75)
- Critical Pair Criteria for Completion (1988) (69)
- A Simple and Fast Word Spotting Method (2014) (65)
- OCR Error Correction Using Character Correction and Feature-Based Word Classification (2016) (62)
- Associative-Commutative Rewriting (1983) (62)
- Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . . (1991) (62)
- Joint word2vec Networks for Bilingual Semantic Representations (2014) (61)
- When are Two Algorithms the Same? (2008) (61)
- Deductive and Inductive Synthesis of Equational Programs (1993) (56)
- Open Problems in Rewriting (1991) (53)
- Unsupervised Decomposition of a Document into Authorial Components (2011) (52)
- Topics in Termination (1993) (49)
- Proof-theoretic techniques for term rewriting theory (1988) (49)
- The Church-Turing Thesis over Arbitrary Domains (2008) (49)
- The evolution of programs (1983) (47)
- Synthesis by Completion (1985) (42)
- Ordered trees and non-crossing partitions (1986) (40)
- Existence, Uniqueness, and Construction of Rewrite Systems (1988) (40)
- Calendrical calculations : the millennium edition (2001) (40)
- Identifying Join Candidates in the Cairo Genizah (2011) (38)
- Canonicity (2003) (38)
- A Taste of Rewrite Systems (1993) (38)
- A Clause-Based Heuristic for SAT Solvers (2005) (38)
- A Maximal-Literal Unit Strategy for Horn Clauses (1990) (35)
- Conditional and Typed Rewriting Systems (1994) (33)
- More Problems in Rewriting (1993) (32)
- Abstract canonical inference (2004) (32)
- Solving Goals in Equational Languages (1988) (30)
- Comparing Computational Power (2005) (29)
- Decidable Matching for Convergent Systems (Preliminary Version) (1992) (28)
- Inference Rules for Program Annotation (1978) (28)
- Logic Programming by Completion (1984) (28)
- Program abstraction and instantiation (1985) (28)
- Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday (2008) (28)
- An Implementation of Narrowing (1989) (27)
- Cayley's Formula: A Page From The Book (2016) (26)
- Termination by Abstraction (2004) (26)
- A simplified loop-free algorithm for generating permutations (1975) (26)
- Inference Rules for Rewrite-Based First-Order Theorem Proving (1987) (26)
- Inductive Synthesis of Equational Programs (1990) (26)
- The Evolution of Programs: Automatic Program Modification (1977) (24)
- Three Paths to Effectiveness (2010) (24)
- Examples of Termination (1993) (23)
- An Implementation of Narrowing: The RITE Way (1986) (23)
- Fields of Logic and Computation (2011) (23)
- The evolution of programs: a system for automatic program modification (1977) (21)
- Computerized paleography: Tools for historical manuscripts (2011) (21)
- Conditional Equational Programming and the Theory of Conditional Term Rewriting (1988) (21)
- Abstract canonical presentations (2006) (21)
- Trees, Ordinals and Termination (1993) (21)
- KEDMA—Linguistic Tools for Retrieval Systems (1978) (21)
- Bounded Fairness (2003) (20)
- Infinite Normal Forms (Preliminary Version) (1989) (20)
- Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver (2007) (20)
- Synthetic Programming (1985) (20)
- Decidable Matching for Convergent Systems (1992) (19)
- The Generic Model of Computation (2012) (19)
- Problems in Rewriting III (1995) (19)
- Notations for Rewting (1991) (18)
- OCR-Free Transcript Alignment (2013) (18)
- Applied Tree Enumerations (1981) (17)
- VASESKETCH: Automatic 3D Representation of Pottery from Paper Catalog Drawings (2017) (17)
- Fields of Logic and Computation II (2015) (17)
- Cononical Sets of Horn Clauses (1991) (17)
- Goal-Directed Equation Solving (1988) (17)
- Developing the ArchAIDE application: A digital workflow for identifying, organising and sharing archaeological pottery using automated image recognition (2020) (17)
- Open. Closed. Open (2005) (17)
- Exact Exploration and Hanging Algorithms (2010) (17)
- The Tel Aviv University System for the Code-Switching Workshop Shared Task (2014) (16)
- Ordering-Based Strategies for Horn Clauses (1991) (16)
- Patterns in trees (1989) (16)
- Deductive Debugging (1987) (16)
- Hierachical Termination (1994) (15)
- Equation Solving in Conditional AC-Theories (1990) (15)
- Abstract saturation-based inference (2003) (15)
- A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract- (2012) (14)
- An Abstract Concurrent Machine for Rewriting (1990) (14)
- The Hydra Battle Revisited (2007) (14)
- Graph Path Orderings (2018) (13)
- Drags: A compositional algebraic framework for graph rewriting (2019) (13)
- Goal Solving as Operational Semantics (1995) (12)
- Arabic Character Recognition (2014) (12)
- Space-efficient bounded model checking (2005) (12)
- Calendrical calculations, II: Three historical calendars (1993) (12)
- Automatic extraction of catalog data from digital images of historical manuscripts (2013) (12)
- Ordinal Arithmetic with List Structures (1992) (11)
- Jumping and escaping: Modular termination and the abstract path ordering (2012) (11)
- Axiomatizing Analog Algorithms (2016) (11)
- Boolean Ring Satisfiability (2004) (11)
- Active clustering of document fragments using information derived from both images and catalogs (2011) (11)
- Semantic Characteristics of Schizophrenic Speech (2019) (11)
- Fields of Logic and Computation III: Essays Dedicated to Yuri Gurevich on the Occasion of His 80th Birthday (2020) (10)
- Average Time Analyses Related to Logic Programming (1989) (10)
- Towards an Axiomatization of Simple Analog Algorithms (2012) (10)
- Logical Debugging (1993) (10)
- The automatic recognition of ceramics from only one photo: The ArchAIDE app (2021) (10)
- On the parallel computation thesis (2016) (9)
- Computerized Source Criticism of Biblical Texts (2015) (9)
- Abstract Effective Models (2006) (9)
- The influence of domain interpretations on computational models (2009) (9)
- Automatically identifying join candidates in the Cairo Genizah (2009) (9)
- How to Compare the Power of Computational Models (2005) (9)
- Viral transcript alignment (2015) (9)
- Critical-pair criteria for the Knuth-Bendix completion procedure (1986) (8)
- Conditional rewriting (1985) (8)
- Gap Embedding for Well-Quasi-Orderings (2003) (8)
- Improving OCR for an under-resourced script using unsupervised word-spotting (2015) (8)
- Automatic Palaeographic Exploration ofGenizah Manuscripts (2011) (8)
- Semigroups Satisfying xm+n = xn (1992) (8)
- The Schorr-Waite Marking Algorithm Revisited (1980) (8)
- Conditional and Typed Rewriting Systems: 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13 - 15, 1994. Proceedings (1995) (8)
- An On-line Problem Database (1998) (7)
- Estimating the Distinctiveness of Graphemes and Allographs in Palaeographic Classification (2012) (7)
- Canonical Ground Horn Theories (2013) (7)
- Computational Ceramicology (2019) (7)
- Innocuous Constructor-Sharing Combinations (1997) (7)
- Finding Inexact Quotations Within a Tibetan Buddhist Corpus (2014) (6)
- Using semantic equivalents for Arabic-to-English: Example-based translation (2012) (6)
- The evolution of programs: Program abstraction and instantiation (1981) (6)
- Drags: A Simple Algebraic Framework For Graph Rewriting (2018) (6)
- The RTA List of Open Problems (2010) (6)
- Path Orderings for Termination of Associative-Commutative Rewriting (1992) (6)
- On Lazy Commutation (2009) (6)
- Rewriting Techniques and Applications (1989) (6)
- Language, Culture, Computation. Computing of the Humanities, Law, and Narratives (2014) (6)
- A hypercomputational alien (2006) (6)
- A Natural Axiomatization of Church's Thesis (2007) (6)
- Indian Calendrical Calculations (2009) (6)
- Cellular Automata are Generic (2015) (5)
- The Average Height of Catalan Trees by Counting Lattice Paths (2015) (5)
- Higher-Order and Semantic Unification (1993) (5)
- Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems (1994) (5)
- Rewrite, Rewrite, Rewrite (1989) (5)
- Transcription Alignment for Highly Fragmentary Historical Manuscripts: The Dead Sea Scrolls (2020) (5)
- Transductive Learning for Reading Handwritten Tibetan Manuscripts (2019) (5)
- Confluence by Critical Pair Analysis (2014) (5)
- Calendrical Tabulations - 1900 - 2200 (2002) (5)
- Calendrical Calculations: The Ultimate Edition (2018) (5)
- Generic Parallel Algorithms (2014) (5)
- Canonical Inference for Implicational Systems (2008) (5)
- Morphological characteristics of spoken language in schizophrenia patients - an exploratory study. (2021) (5)
- A Formalization of the Church-Turing Thesis (2005) (5)
- Inferring Paraphrases for a Highly Inflected Language from a Monolingual Corpus (2014) (4)
- An Arabic to English Example-Based Translation System (2007) (4)
- Honest universality (2012) (4)
- Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings (2007) (4)
- Congruency-Based Reranking (2014) (4)
- Language, Culture, Computation. Computing - Theory and Technology (2014) (4)
- More Patterns in Trees: Up and Down, Young and Old, Odd and Even (2008) (4)
- 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, xxii+884 pages (2005) (4)
- Exact Exploration (2009) (4)
- Honest Computability and Complexity (2016) (4)
- A Formalization of the Church-Turing Thesis for State-Transition Models (2006) (4)
- Deriving Paraphrases for Highly Inflected Languages from Comparable Documents (2012) (4)
- OCR for Arabic using SIFT Descriptors With Online Failure Prediction (2011) (4)
- Boolean Rings for Intersection-Based Satisfiability (2006) (4)
- Complexity of propositional proofs under a promise (2007) (4)
- THE CHURCH THESIS, ITS PROOF, AND THE NOTION OF STABILITY AND STABILIZATION FOR ANALOG ALGORITHMS (2019) (3)
- Language Classification and Segmentation of Noisy Documents in Hebrew Scripts (2012) (3)
- Abstract Canonical Inference Systems (2002) (3)
- Integrating Copies Obtained from Old and New Preservation Efforts (2013) (3)
- The Invariance Thesis (2014) (3)
- A parallel implementation of equational programming (1990) (3)
- Satisfiability Testing Using Simplification in Boolean Rings (2003) (3)
- Image and text correction using language models (2017) (3)
- Enumeration Problems Related to Ground Horn Theories (2006) (3)
- Rewriting Methods for Word Problems (1992) (3)
- Automatic Metaphor Interpretation Using Word Embeddings (2020) (3)
- Using Synonyms for Arabic-to-English Example-Based Translation (2010) (3)
- Debugging Logic Programs Using Specifications (1993) (3)
- A Method for Segmentation, Matching and Alignment of Dead Sea Scrolls (2018) (3)
- Qumran Letter Restoration by Rotation and Reflection Modified PixelCNN (2017) (3)
- Transliteration of Judeo-Arabic Texts into Arabic Script Using Recurrent Neural Networks (2020) (2)
- Tel Aviv University’s system description for IWSLT 2010 (2010) (2)
- Automatic Termination Analysis of Programs Containing Arithmetic Predicates (2000) (2)
- Calendrical Calculations: Frontmatter (2007) (2)
- Relating Articles Textually and Visually (2017) (2)
- Processing Judeo-Arabic Texts (2015) (2)
- Is Bit-Vector Reasoning as Hard as NExpTime in Practice ? ( Extended Abstract ) (2015) (2)
- Calendrical calculations -- millennium ed. (2001) (2)
- Enumerating Satisfiable Propositional FormulCB (2011) (2)
- Foundations of Analog Algorithms (2012) (2)
- Abstract and-parallel Machines (1997) (2)
- Metaphor Interpretation Using Word Embeddings (2020) (2)
- Intersection-Based Methods for Satisfiability Using Boolean Rings (2005) (2)
- Between Broadway and the Hudson: A Bijection of Corridor Paths (2020) (2)
- Res Publica: The Universal Model of Computation (Invited Talk) (2013) (2)
- Matching with a Hierarchical Ontology (2014) (2)
- Automatic Extraction of Catalog Data from Genizah Fragments' Images (2011) (2)
- GPO : A Path Ordering for Graphs (2018) (2)
- The length of a scroll: Quantitative evaluation of material reconstructions (2020) (2)
- Universality in two dimensions (2016) (2)
- Modulo intervals: a proposed notation (2012) (2)
- Orthography and Biblical Criticism (2014) (1)
- Calendrical Calculations: The Tibetan Calendar (2007) (1)
- SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets (2008) (1)
- The communication complexity of multiparty set disjointness under product distributions (2021) (1)
- Using Verb Paraphrases for Arabic-to-English Example-Based Translation (2010) (1)
- Automatic Program Annotation (1977) (1)
- Querying Hebrew Texts via Word Spotting (2017) (1)
- Calendrical Calculations: The Chinese Calendar (2007) (1)
- Abstract Termination of Linear Rewriting Systems* -preliminary Version (1981) (1)
- The Universal Model of Computation (2013) (1)
- Calendrical Calculations: The French Revolutionary Calendar (2007) (1)
- 1700 Forests (2016) (1)
- A Hackathon for Classical Tibetan (2016) (1)
- Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers (2019) (1)
- Calendrical Calculations: Preface (2007) (1)
- From Total Assignment Enumeration to Modern SAT Solver (2011) (1)
- Calendrical Calculations: The Hebrew Calendar (2007) (1)
- Termination of non-simple rewrite systems (1996) (1)
- Leanest quasi-orderings (2005) (1)
- Fifth International Workshop on Termination (WST '0l) (2001) (1)
- When are Two Rewrite Systems More than None? (1997) (1)
- Hints Revealed (2015) (1)
- Dense Correspondences and Ancient Texts (2016) (1)
- Domain-Independent Deception: Definition, Taxonomy and the Linguistic Cues Debate (2022) (1)
- How Much Does Lookahead Matter for Disambiguation? Partial Arabic Diacritization Case Study (2022) (1)
- Matching Phrases for Arabic-to-English Example-Based Translation System (2014) (1)
- Dependency Pairs are a Simple Semantic Path Ordering (2013) (1)
- Calendrical calculations (3. ed.) (2008) (1)
- Ground Canonicity (2003) (1)
- Boris A. Trakhtenbrot: Academic Genealogy and Publications (2008) (1)
- Touchard's Drunkard (2016) (1)
- Fast Exchange Sorts (1989) (1)
- Abstract Eective Models (2005) (1)
- Fast Search with Poor OCR (2019) (1)
- Bit Inference (2008) (1)
- The Four Sons of Penrose (2005) (1)
- Debugging logic programs using executable specifications (1988) (1)
- Stemming and Segmentation for Classical Tibetan (2016) (1)
- The impact of tumor detection method on genomic and clinical risk and chemotherapy recommendation in early hormone receptor positive breast cancer (2021) (0)
- 14th International Conference on Frontiers in Handwriting Recognition, ICFHR 2014, Crete, Greece, September 1-4, 2014 (2014) (0)
- Pæan to Zohar Manna (2003) (0)
- Where is my Other Half? (2014) (0)
- A Statistical Exploration of Text Partition Into Constituents: The Case of the Priestly Source in the Books of Genesis and Exodus (2023) (0)
- Acknowledgement to referees (2004) (0)
- Computational Visual Ceramicology: Matching Image Outlines to Catalog Sketches (2021) (0)
- Computational Ceramicology: Matching Image Outlines to Catalog Sketches (2020) (0)
- What is the Church-Turing Thesis? (2020) (0)
- From Specifications to Programs: Induction in the Service of Synthesis (Abstract) (1994) (0)
- On Canonical Implicational Systems ? (0)
- On the Optimality of RAM Complexity (2013) (0)
- Yaacov Choueka: A Profile (2014) (0)
- Computability and Stability for Hybrid Algorithms (2019) (0)
- Using semantic equivalents for Arabic-to-English (2012) (0)
- Calendrical Calculations: The Gregorian Calendar (2007) (0)
- Yuri, Logic, and Computer Science (2010) (0)
- And-Parallel Machines ? (0)
- Leanest Quasi-orderings Preliminary Version (2005) (0)
- Calendrical Calculations: The Julian Calendar (2007) (0)
- Program Modification and Debugging (1983) (0)
- Statistical Transliteration of Judeo-Arabic Texts (2014) (0)
- The Mayan Calendars (2007) (0)
- Random-Access Machines and the Extended Church-Turing Thesis (2012) (0)
- Calendrical Calculations: Function, Parameter, and Constant Types (2007) (0)
- Inductive Synt quat ional (1999) (0)
- Masking Morphosyntactic Categories to Evaluate Salience for Schizophrenia Diagnosis (2022) (0)
- Introduction (2011) (0)
- Well-Quasi-Orderings on Binary Trees (2005) (0)
- Calendrical Calculations: The Islamic Calendar (2007) (0)
- Calendrical Calculations: License and Limited Warranty and Remedy (2007) (0)
- 2 Completion and Its Applications (1989) (0)
- Calendrical Calculations: The Bahá'í Calendar (2007) (0)
- On the Representation of Ordinals up to Fa (0)
- Generic Graph Semantics (2018) (0)
- From Backtracking to Chaff (2008) (0)
- Unconventional Computation : 8th International Conference, UC 2009, Ponta Delgada, Portugal, September 7-11, 2009. Proceedings (2009) (0)
- Calendrical Calculations: Time and Astronomy (2007) (0)
- A hypercomputational alien q (2006) (0)
- Calendrical Calculations: Envoi (2007) (0)
- Preliminary Version Gap Embedding for Well-Quasi-Orderings 1 (2003) (0)
- Style Classification of Rabbinic Literature for Detection of Lost Midrash Tanhuma Material (2022) (0)
- Program Annotation and Analysis (1983) (0)
- Proceedings of the 3rd international conference on Rewriting Techniques and Applications (1989) (0)
- Rewriting and verification (1985) (0)
- The Old Hindu Calendars (2007) (0)
- A Gap Tree Theorem for Quasi-Ordered Labels 1 (2005) (0)
- Rebutting Rebuttals (2022) (0)
- RAM Complexity is Optimal (2013) (0)
- Calendrical Calculations: About the Cover (2007) (0)
- Between Broadway and the Hudson (2020) (0)
- Matching and Searching the Dead Sea Scrolls (2018) (0)
- An Abstract Path Ordering (2010) (0)
- A Bijection of Corridor Paths (2021) (0)
- Let's be honest (2021) (0)
- Rewriting Techniques and Applications: 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings (1989) (0)
- A critical pair criterion for completion modulo a congruence (1987) (0)
- Running head: Morphological characteristics in schizophrenia patients (2021) (0)
- Abstract Effective Models (2006) (0)
- Abstract State Machines : A Generic Model of Computation (2010) (0)
- Can Yes-No Question-Answering Models be Useful for Few-Shot Metaphor Detection? (2022) (0)
- Chapter 6 Honest Computability and Complexity (2016) (0)
- Unit checking: Symbolic model checking for a unit of code ESSAYS DEDICATED TO ZHOAR MANNA ON THE OCCASION OF HIS 64TH BIRTHDAY (2003) (0)
- Part II of Essays Dedicated to Yaacov Choueka on Language, Culture, Computation. Computing of the Humanities, Law, and Narratives - Volume 8002 (2014) (0)
- ORDERED CONSTRUCTION OF COMBINATORIAL OBJECTSMITCH HARRIS AND NACHUM DERSHOWITZ (0)
- Program Synthesis and Extension (1983) (0)
- Primitive Rewriting (2005) (0)
- Calendrical Calculations: The Persian Calendar (2007) (0)
- Calendrical Calculations: Generic Cyclical Calendars (2007) (0)
- FAST EXCHANGE SORTS 1 (1998) (0)
- Ftp 2003 Preliminary Version (2003) (0)
- Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01). (2003) (0)
- The Algebra of Infinite Sequences: Notations and Formalization (2020) (0)
- Calendrical calcuations - the millenium edition (2002) (0)
- Domain-Independent Deception: Taxonomy, Datasets and Linguistic Analysis (2021) (0)
- RAM is as Good as it Gets (2012) (0)
- 56P The impact of tumour detection method on genomic and clinical risk and chemotherapy recommendation in early hormone receptor positive breast cancer (2021) (0)
- Abstracts of the Israeli Seminar on Computational Linguistics (2010) (0)
- Systematic Textual Availability of Manuscripts (2022) (0)
- Calendrical Calculations: The Balinese Pawukon Calendar (2007) (0)
- Calendrical Calculations: The Coptic and Ethiopic Calendars (2007) (0)
- Termination of Rewritingt (2013) (0)
- Commuting and Escaping (2012) (0)
- de Vrijer’s Measure for SN of λ→ in Scheme (2021) (0)
- Active Congruency-Based Reranking (2016) (0)
- Language, Culture, Computation. Computational Linguistics and Linguistics (2014) (0)
- Artificial intelligence: Retrospective/prospective (2000) (0)
- Calendrical Calculations: The Modern Hindu Calendars (2007) (0)
- Astronomical Lunar Calendars (2007) (0)
- Consolidating the results of automatic search in large scale digital collections (2012) (0)
- Calendrical Calculations: The ISO Calendar (2007) (0)
- In the next section we consider functional programming using simplification and rewrit ing, and in the section that follows we consider logic programming using unification and nar (1985) (0)
- Well-founded Path Orderings for Drags (2016) (0)
- Abstract P3-05-27: The impact of co-existing ductal carcinoma in situ in invasive early hormone receptor positive breast cancer on the genomic and clinical risk of recurrence (2023) (0)
- Calendrical Calculations: Mathematical Notations (2007) (0)
- Well-Founded Unions (2018) (0)
- KETCH : Automatic 3 D Representation of Pottery from Paper Catalogue Drawings (2017) (0)
- Calendrical Calculations: The Ecclesiastical Calendars (2007) (0)
- Knowledge based programming assistant, KBPA-1 (1982) (0)
- Well-founded Path Orderings for Operads (2016) (0)
- Jeopardy Inverting Mildly Deep De nitions (1999) (0)
This paper list is powered by the following services:
Other Resources About Nachum Dershowitz
What Schools Are Affiliated With Nachum Dershowitz?
Nachum Dershowitz is affiliated with the following schools: