Nachum Dershowitz

Affiliation School of Computer Science, Tel Aviv University
Publications 181
H-index 18
Sorted by:

Publications

#Cited
816 A Taste of Rewrite Systems - - 1993
497 Rewriting - - 2001
221 PROVING TERMINATION WITH MULTISET ORDERINGS -
138 Completion without Failure - - 1989
84 Hierarchical Termination - Theoretical Computer Science - 1995
57 Confluence of Conditional Rewrite Systems -
45 A General Framework for Automatic Termination Analysis of Logic Programs - - 2000
33 Completion for rewriting modulo a congruence - - 1988
33 Bounded model checking with QBF - in Int’l Conf. on Theory and Applications of Satisfiability Testing - 2005
32 A scalable algorithm for minimal unsatisfiable core extraction - In Proc. SAT’06 - 2006
29 Equational Inference, Canonical Proofs, And Proof Orderings - Journal of the ACM - 1992
27 Deductive and Inductive Synthesis of Equational Programs - Journal of Symbolic Computation - 1992
24 Rewrite Methods for Clausal and Nonclausal Theorem Proving - in Proceedings of the Tenth International Conference on Automata, Languages and Programming - 1983
23 33 Examples of Termination - In Proc. French Spring School of Theoretical Computer Science, LNCS 909 - 1995
23 Parallel Multithreaded Satisfiability Solver: Design and Implementation - - 2005
23 Completion and Its Applications - - 1989
20 A clause-based heuristic for SAT solvers - In Int. Conf. on Theory and Applications of Satisfiability Testing (SAT - 2005
19 Open Problems in Rewriting - Proceeding of the Fifth International Conference on Rewriting Techniques and Application (Montreal, Canada), LNCS 690 - 1991
14 The Church-Turing Thesis over Arbitrary Domains - - 2008
14 Decidable Matching for Convergent Systems - In Proceedings of the Eleventh Conference on Automated Deduction - 1992

View completed publications >>