Nachum Dershowitz

According to our database1, Nachum Dershowitz authored at least 191 papers between 1977 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Drags: A compositional algebraic framework for graph rewriting.
Theor. Comput. Sci., 2019

A Hackathon for Classical Tibetan.
JDMDH, 2019

Computability and Stability for Hybrid Algorithms.
Proceedings of the Advances in Swarm Intelligence - 10th International Conference, 2019

2018
A Method for Segmentation, Matching and Alignment of Dead Sea Scrolls.
Proceedings of the 2018 IEEE Winter Conference on Applications of Computer Vision, 2018

Graph Path Orderings.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Well-Founded Unions.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
Qumran Letter Restoration by Rotation and Reflection Modified PixelCNN.
Proceedings of the 14th IAPR International Conference on Document Analysis and Recognition, 2017

Relating Articles Textually and Visually.
Proceedings of the 14th IAPR International Conference on Document Analysis and Recognition, 2017

VASESKETCH: Automatic 3D Representation of Pottery from Paper Catalog Drawings.
Proceedings of the 14th IAPR International Conference on Document Analysis and Recognition, 2017

Image and text correction using language models.
Proceedings of the 1st International Workshop on Arabic Script Analysis and Recognition, 2017

2016
Universality in two dimensions.
J. Log. Comput., 2016

On the parallel computation thesis.
Logic Journal of the IGPL, 2016

Active Congruency-Based Reranking.
Front. Digital Humanities, 2016

Boris (Boaz) Trakhtenbrot, 1921-2016.
Bulletin of the EATCS, 2016

OCR Error Correction Using Character Correction and Feature-Based Word Classification.
Proceedings of the 12th IAPR Workshop on Document Analysis Systems, 2016

Axiomatizing Analog Algorithms.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

Stemming and Segmentation for Classical Tibetan.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2016

Honest Computability and Complexity.
Proceedings of the Martin Davis on Computability, 2016

2015
Hints Revealed.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Improving OCR for an under-resourced script using unsupervised word-spotting.
Proceedings of the 13th International Conference on Document Analysis and Recognition, 2015

Viral transcript alignment.
Proceedings of the 13th International Conference on Document Analysis and Recognition, 2015

2014
Joint word2vec Networks for Bilingual Semantic Representations.
Int. J. Comput. Linguistics Appl., 2014

Cellular Automata are Generic.
Proceedings of the Proceedings Tenth International Workshop on Developments in Computational Models, 2014

Confluence by Critical Pair Analysis.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

A Simple and Fast Word Spotting Method.
Proceedings of the 14th International Conference on Frontiers in Handwriting Recognition, 2014

Finding Inexact Quotations Within a Tibetan Buddhist Corpus.
Proceedings of the Digital Humanities 2014, 2014

Orthography and Biblical Criticism.
Proceedings of the Digital Humanities 2014, 2014

Where is my Other Half?
Proceedings of the Digital Humanities 2014, 2014

Congruency-Based Reranking.
Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014

Generic Parallel Algorithms.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

Inferring Paraphrases for a Highly Inflected Language from a Monolingual Corpus.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2014

Arabic Character Recognition.
Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

Yaacov Choueka: A Profile.
Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

Matching with a Hierarchical Ontology.
Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

Matching Phrases for Arabic-to-English Example-Based Translation System.
Proceedings of the Language, Culture, Computation. Computing of the Humanities, 2014

The Tel Aviv University System for the Code-Switching Workshop Shared Task.
Proceedings of the First Workshop on Computational Approaches to Code Switching@EMNLP 2014, 2014

2013
Automatic extraction of catalog data from digital images of historical manuscripts.
LLC, 2013

Integrating Copies Obtained from Old and New Preservation Efforts.
Proceedings of the 12th International Conference on Document Analysis and Recognition, 2013

OCR-Free Transcript Alignment.
Proceedings of the 12th International Conference on Document Analysis and Recognition, 2013

Res Publica: The Universal Model of Computation (Invited Talk).
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

Canonical Ground Horn Theories.
Proceedings of the Programming Logics - Essays in Memory of Harald Ganzinger, 2013

2012
Jumping and escaping: Modular termination and the abstract path ordering.
Theor. Comput. Sci., 2012

Modulo intervals: a proposed notation.
SIGACT News, 2012

Towards an Axiomatization of Simple Analog Algorithms.
Proceedings of the Theory and Applications of Models of Computation, 2012

Language Classification and Segmentation of Noisy Documents in Hebrew Scripts.
Proceedings of the 6th Workshop on Language Technology for Cultural Heritage, 2012

Estimating the Distinctiveness of Graphemes and Allographs in Palaeographic Classification.
Proceedings of the Digital Humanities 2012, 2012

Deriving Paraphrases for Highly Inflected Languages from Comparable Documents.
Proceedings of the COLING 2012, 2012

2011
Introduction.
Natural Computing, 2011

Identifying Join Candidates in the Cairo Genizah.
International Journal of Computer Vision, 2011

The Generic Model of Computation
Proceedings of the Proceedings 7th International Workshop on Developments of Computational Methods, 2011

A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-
Proceedings of the Proceedings 7th International Workshop on Developments of Computational Methods, 2011

Computerized paleography: Tools for historical manuscripts.
Proceedings of the 18th IEEE International Conference on Image Processing, 2011

Active clustering of document fragments using information derived from both images and catalogs.
Proceedings of the IEEE International Conference on Computer Vision, 2011

Automatic Extraction of Catalog Data from Genizah Fragments' Images.
Proceedings of the Digital Humanities 2011, 2011

Unsupervised Decomposition of a Document into Authorial Components.
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011

2010
Tel aviv university's system description for IWSLT 2010.
Proceedings of the 2010 International Workshop on Spoken Language Translation, 2010

Exact Exploration and Hanging Algorithms.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

Three Paths to Effectiveness.
Proceedings of the Fields of Logic and Computation, 2010

Yuri, Logic, and Computer Science.
Proceedings of the Fields of Logic and Computation, 2010

2009
More Patterns in Trees: Up and Down, Young and Old, Odd and Even.
SIAM J. Discrete Math., 2009

When are two algorithms the same?
Bulletin of Symbolic Logic, 2009

The influence of domain interpretations on computational models.
Applied Mathematics and Computation, 2009

Automatically identifying join candidates in the Cairo Genizah.
Proceedings of the 12th IEEE International Conference on Computer Vision Workshops, 2009

On Lazy Commutation.
Proceedings of the Languages: From Formal to Natural, 2009

2008
A Natural Axiomatization of Computability and Proof of Church's Thesis.
Bulletin of Symbolic Logic, 2008

Bit Inference.
Proceedings of the First International Workshop on Practical Aspects of Automated Reasoning, 2008

Canonicity!
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

Canonical Inference for Implicational Systems.
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets.
Proceedings of the Concurrency, 2008

The Church-Turing Thesis over Arbitrary Domains.
Proceedings of the Pillars of Computer Science, 2008

Boris A. Trakhtenbrot: Academic Genealogy and Publications.
Proceedings of the Pillars of Computer Science, 2008

Calendrical calculations (3. ed.).
Cambridge University Press, ISBN: 978-0-521-88540-9, 2008

2007
Abstract canonical inference.
ACM Trans. Comput. Log., 2007

Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Complexity of Propositional Proofs Under a Promise.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

The Hydra Battle Revisited.
Proceedings of the Rewriting, 2007

2006
Abstract canonical presentations.
Theor. Comput. Sci., 2006

Comparing Computational Power.
Logic Journal of the IGPL, 2006

Abstract Effective Models.
Electr. Notes Theor. Comput. Sci., 2006

A hypercomputational alien.
Applied Mathematics and Computation, 2006

A Scalable Algorithm for Minimal Unsatisfiable Core Extraction.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Boolean Rings for Intersection-Based Satisfiability.
Proceedings of the Logic for Programming, 2006

2005
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, 2005

Parallel Multithreaded Satisfiability Solver: Design and Implementation.
Electr. Notes Theor. Comput. Sci., 2005

A Clause-Based Heuristic for SAT Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Bounded Model Checking with QBF.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Leanest Quasi-orderings.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Open. Closed. Open.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

The Four Sons of Penrose.
Proceedings of the Logic for Programming, 2005

Space-Efficient Bounded Model Checking.
Proceedings of the 2005 Design, 2005

How to Compare the Power of Computational Models.
Proceedings of the New Computational Paradigms, 2005

Primitive Rewriting.
Proceedings of the Processes, 2005

2004
Boolean Ring Satisfiability.
Proceedings of the SAT 2004, 2004

Termination by Abstraction.
Proceedings of the Logic Programming, 20th International Conference, 2004

2003
Gap Embedding for Well-Quasi-Orderings.
Electr. Notes Theor. Comput. Sci., 2003

Abstract Saturation-Based Inference.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Bounded Fairness.
Proceedings of the Verification: Theory and Practice, 2003

Pæan to Zohar Manna.
Proceedings of the Verification: Theory and Practice, 2003

2002
Calendrical Tabulations - 1900 - 2200.
Cambridge University Press, ISBN: 978-0-521-78253-1, 2002

Calendrical calcuations - the millenium edition.
Cambridge University Press, ISBN: 978-0-521-77752-0, 2002

2001
A General Framework for Automatic Termination Analysis of Logic Programs.
Appl. Algebra Eng. Commun. Comput., 2001

Rewriting.
Proceedings of the Handbook of Automated Reasoning (in 2 volumes), 2001

2000
Abstract and-parallel Machines.
Computers and Artificial Intelligence, 2000

Artificial intelligence: Retrospective/prospective.
Ann. Math. Artif. Intell., 2000

1999
Automatic Termination Analysis of Programs Containing Arithmetic Predicates.
Electr. Notes Theor. Comput. Sci., 1999

Jeopardy.
Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

1998
An On-line Problem Database.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

1997
Innocuous Constructor-Sharing Combinations.
Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

When are Two Rewrite Systems More than None?
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Abstract And-Parallel Machines.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1995
Natural Termination.
Theor. Comput. Sci., 1995

Goal Solving as Operational Semantics.
Proceedings of the Logic Programming, 1995

Problems in Rewriting III.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

1994
Equational Inference, Canonical Proofs, and Proof Orderings.
J. ACM, 1994

Hierachical Termination.
Proceedings of the Conditional and Typed Rewriting Systems, 4th International Workshop, 1994

From Specifications to Programs: Induction in the Service of Synthesis (Abstract).
Proceedings of the Algorithmic Learning Theory, 1994

1993
Calendrical Calculations, II: Three Historical Calendars.
Softw., Pract. Exper., 1993

Deductive and Inductive Synthesis of Equational Programs.
J. Symb. Comput., 1993

Logical Debugging.
J. Symb. Comput., 1993

Trees, Ordinals and Termination.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

More Problems in Rewriting.
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

Topics in Termination.
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

A Taste of Rewrite Systems.
Proceedings of the Functional Programming, 1993

Higher-Order and Semantic Unification.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

Examples of Termination.
Proceedings of the Term Rewriting, 1993

Debugging Logic Programs Using Specifications.
Proceedings of the Automated and Algorithmic Debugging, First International Workshop, 1993

1992
Ordinal Arithmetic with List Structures.
Proceedings of the Logical Foundations of Computer Science, 1992

Path Orderings for Termination of Associative-Commutative Rewriting.
Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

Semigroups Satisfying xm+n = xn.
Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

Decidable Matching for Convergent Systems (Preliminary Version).
Proceedings of the Automated Deduction, 1992

1991
Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . . .
Theor. Comput. Sci., 1991

Notations for Rewting.
Bulletin of the EATCS, 1991

Open Problems in Rewriting.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

Ordering-Based Strategies for Horn Clauses.
Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

Cononical Sets of Horn Clauses.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
A Rationale for Conditional Equational Programming.
Theor. Comput. Sci., 1990

Calendrical Calculations.
Softw., Pract. Exper., 1990

The Cycle Lemma and Some Applications.
Eur. J. Comb., 1990

A parallel implementation of equational programming.
Proceedings of the Next Decade in Information Technology: Proceedings of the 5th Jerusalem Conference on Information Technology 1990, 1990

A Maximal-Literal Unit Strategy for Horn Clauses.
Proceedings of the Conditional and Typed Rewriting Systems, 1990

Equation Solving in Conditional AC-Theories.
Proceedings of the Algebraic and Logic Programming, 1990

An Abstract Concurrent Machine for Rewriting.
Proceedings of the Algebraic and Logic Programming, 1990

Inductive Synthesis of Equational Programs.
Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

Rewrite Systems.
Proceedings of the Handbook of Theoretical Computer Science, 1990

1989
An Implementation of Narrowing.
J. Log. Program., 1989

Rewrite, Rewrite, Rewrite, Rewrite, Rewrite.
Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

Average Time Analyses Related to Logic Programming.
Proceedings of the Logic Programming, 1989

Infinite Normal Forms (Preliminary Version).
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

Fast Exchange Sorts.
Proceedings of the Foundations of Data Organization and Algorithms, 1989

1988
Existence, Uniqueness, and Construction of Rewrite Systems.
SIAM J. Comput., 1988

Critical Pair Criteria for Completion.
J. Symb. Comput., 1988

Proof-Theoretic Techniques for Term Rewriting Theory
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

Conditional Equational Programming and the Theory of Conditional Term Rewriting.
Proceedings of the International Conference on Fifth Generation Computer Systems, 1988

Canonical Conditional Rewrite Systems.
Proceedings of the 9th International Conference on Automated Deduction, 1988

Goal-Directed Equation Solving.
Proceedings of the 7th National Conference on Artificial Intelligence, 1988

1987
Termination of Rewriting.
J. Symb. Comput., 1987

Deductive Debugging.
Proceedings of the 1987 Symposium on Logic Programming, San Francisco, California, USA, August 31, 1987

Completion for Rewriting Modulo a Congruence.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

Inference Rules for Rewrite-Based First-Order Theorem Proving
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

A critical pair criterion for completion modulo a congruence.
Proceedings of the EUROCAL '87, 1987

Solving Goals in Equational Languages.
Proceedings of the Conditional Term Rewriting Systems, 1987

Confluence of Conditional Rewrite Systems.
Proceedings of the Conditional Term Rewriting Systems, 1987

1986
Ordered trees and non-crossing partitions.
Discrete Mathematics, 1986

An Implementation of Narrowing: The RITE Way.
Proceedings of the 1986 Symposium on Logic Programming, 1986

Orderings for Equational Proofs
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

Critical-pair criteria for the Knuth-Bendix completion procedure.
Proceedings of the SYMSAC 1986, 1986

Commutation, Transformation, and Termination.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1985
Program Abstraction and Instantiation.
ACM Trans. Program. Lang. Syst., 1985

Computing with Rewrite Systems
Information and Control, 1985

Synthetic Programming.
Artif. Intell., 1985

Logic Programming cum Applicative Programming.
Proceedings of the 1985 Symposium on Logic Programming, 1985

Termination.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

Synthesis by Completion.
Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

1984
Logic Programming by Completion.
Proceedings of the Second International Logic Programming Conference, 1984

Patterns in Trees.
Proceedings of the CAAP'84, 1984

1983
Associative-Commutative Rewriting.
Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983

Rewrite Methods for Clausal and Non-Clausal Theorem Proving.
Proceedings of the Automata, 1983

1982
Orderings for Term-Rewriting Systems.
Theor. Comput. Sci., 1982

1981
The Evolution of Programs: Program Abstraction and Instantiation.
Proceedings of the 5th International Conference on Software Engineering, 1981

Termination of Linear Rewriting Systems (Preliminary Version).
Proceedings of the Automata, 1981

Applied Tree Enumerations.
Proceedings of the CAAP '81, 1981

1980
The Schorr-Waite Marking Algorithm Revisited.
Inf. Process. Lett., 1980

Enumerations of ordered trees.
Discrete Mathematics, 1980

1979
A Note on Simplification Orderings.
Inf. Process. Lett., 1979

Proving termination with Multiset Orderings.
Proceedings of the Automata, 1979

Orderings for Term-Rewriting Systems
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
KEDMA - Linguistic Tools for Retrieval Systems.
J. ACM, 1978

Inference Rules for Program Annotation.
Proceedings of the 3rd International Conference on Software Engineering, 1978

1977
The Evolution of Programs: Automatic Program Modification.
IEEE Trans. Software Eng., 1977

The Evolution of Programs: A System for Automatic Program Modification.
Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977

Automatic Program Annotation.
Proceedings of the 5th International Joint Conference on Artificial Intelligence. Cambridge, 1977


  Loading...