| 2008 |
|---|
| 141 | | Arnon Avron,
Nachum Dershowitz,
Alexander Rabinovich:
Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday
Springer 2008 |
| 140 | EE | Nachum Dershowitz,
Claude Kirchner:
SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets.
Concurrency, Graphs and Models 2008: 194-208 |
| 139 | EE | Nachum Dershowitz:
Canonicity!
IJCAR 2008: 327-331 |
| 138 | EE | Maria Paola Bonacina,
Nachum Dershowitz:
Canonical Inference for Implicational Systems.
IJCAR 2008: 380-395 |
| 137 | EE | Nachum Dershowitz:
Bit Inference.
PAAR/ESHOL 2008 |
| 136 | EE | Udi Boker,
Nachum Dershowitz:
The Church-Turing Thesis over Arbitrary Domains.
Pillars of Computer Science 2008: 199-229 |
| 135 | EE | Arnon Avron,
Nachum Dershowitz,
Alexander Rabinovich:
Boris A. Trakhtenbrot: Academic Genealogy and Publications.
Pillars of Computer Science 2008: 46-57 |
| 134 | EE | Andreas Blass,
Nachum Dershowitz,
Yuri Gurevich:
When are two algorithms the same?
CoRR abs/0811.0811: (2008) |
| 2007 |
|---|
| 133 | | Nachum Dershowitz,
Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings
Springer 2007 |
| 132 | EE | Nachum Dershowitz,
Iddo Tzameret:
Complexity of Propositional Proofs Under a Promise.
ICALP 2007: 291-302 |
| 131 | EE | Nachum Dershowitz,
Georg Moser:
The Hydra Battle Revisited.
Rewriting, Computation and Proof 2007: 1-27 |
| 130 | EE | Nachum Dershowitz,
Ziyad Hanna,
Alexander Nadel:
Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver.
SAT 2007: 287-293 |
| 129 | EE | Maria Paola Bonacina,
Nachum Dershowitz:
Abstract canonical inference.
ACM Trans. Comput. Log. 8(1): (2007) |
| 128 | EE | Nachum Dershowitz,
Iddo Tzameret:
Complexity of Propositional Proofs under a Promise
CoRR abs/0707.4255: (2007) |
| 127 | EE | Jacob Katz,
Ziyad Hanna,
Nachum Dershowitz:
Space-Efficient Bounded Model Checking
CoRR abs/0710.4629: (2007) |
| 126 | EE | Nachum Dershowitz,
E. Castedo Ellerman:
Leanest quasi-orderings.
Inf. Comput. 205(4): 535-556 (2007) |
| 2006 |
|---|
| 125 | EE | Nachum Dershowitz,
Jieh Hsiang,
Guan-Shieng Huang,
Daher Kaiss:
Boolean Rings for Intersection-Based Satisfiability.
LPAR 2006: 482-496 |
| 124 | EE | Nachum Dershowitz,
Ziyad Hanna,
Alexander Nadel:
A Scalable Algorithm for Minimal Unsatisfiable Core Extraction.
SAT 2006: 36-41 |
| 123 | EE | Udi Boker,
Nachum Dershowitz:
A hypercomputational alien.
Applied Mathematics and Computation 178(1): 44-57 (2006) |
| 122 | EE | Nachum Dershowitz,
Ziyad Hanna,
Alexander Nadel:
A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
CoRR abs/cs/0605085: (2006) |
| 121 | EE | Nachum Dershowitz,
Mitchell A. Harris,
Guan-Shieng Huang:
Enumeration Problems Related to Ground Horn Theories
CoRR abs/cs/0610054: (2006) |
| 120 | EE | Udi Boker,
Nachum Dershowitz:
Abstract Effective Models.
Electr. Notes Theor. Comput. Sci. 135(3): 15-23 (2006) |
| 119 | EE | Udi Boker,
Nachum Dershowitz:
Comparing Computational Power.
Logic Journal of the IGPL 14(5): 633-647 (2006) |
| 118 | EE | Nachum Dershowitz,
Claude Kirchner:
Abstract canonical presentations.
Theor. Comput. Sci. 357(1-3): 53-69 (2006) |
| 2005 |
|---|
| 117 | EE | Udi Boker,
Nachum Dershowitz:
How to Compare the Power of Computational Models.
CiE 2005: 54-64 |
| 116 | EE | Jacob Katz,
Ziyad Hanna,
Nachum Dershowitz:
Space-Efficient Bounded Model Checking.
DATE 2005: 686-687 |
| 115 | EE | Nachum Dershowitz:
The Four Sons of Penrose.
LPAR 2005: 125-138 |
| 114 | EE | Nachum Dershowitz:
Primitive Rewriting.
Processes, Terms and Cycles 2005: 127-147 |
| 113 | EE | Nachum Dershowitz,
E. Castedo Ellerman:
Leanest Quasi-orderings.
RTA 2005: 32-45 |
| 112 | EE | Nachum Dershowitz:
Open. Closed. Open.
RTA 2005: 376-393 |
| 111 | EE | Nachum Dershowitz,
Ziyad Hanna,
Jacob Katz:
Bounded Model Checking with QBF.
SAT 2005: 408-414 |
| 110 | EE | Nachum Dershowitz,
Ziyad Hanna,
Alexander Nadel:
A Clause-Based Heuristic for SAT Solvers.
SAT 2005: 46-60 |
| 109 | EE | Udi Boker,
Nachum Dershowitz:
Comparing Computational Power
CoRR abs/cs/0510069: (2005) |
| 108 | EE | Yulik Feldman,
Nachum Dershowitz,
Ziyad Hanna:
Parallel Multithreaded Satisfiability Solver: Design and Implementation.
Electr. Notes Theor. Comput. Sci. 128(3): 75-90 (2005) |
| 107 | EE | 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) |
| 2004 |
|---|
| 106 | EE | Nachum Dershowitz:
Termination by Abstraction.
ICLP 2004: 1-18 |
| 105 | EE | Nachum Dershowitz,
Jieh Hsiang,
Guan-Shieng Huang,
Daher Kaiss:
Boolean Ring Satisfiability.
SAT 2004 |
| 104 | EE | Maria Paola Bonacina,
Nachum Dershowitz:
Abstract Canonical Inference
CoRR cs.LO/0406030: (2004) |
| 2003 |
|---|
| 103 | | Nachum Dershowitz:
Verification: Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday
Springer 2003 |
| 102 | EE | Nachum Dershowitz,
Claude Kirchner:
Abstract Saturation-Based Inference.
LICS 2003: 65-74 |
| 101 | EE | Nachum Dershowitz:
Pæan to Zohar Manna.
Verification: Theory and Practice 2003: 1-10 |
| 100 | EE | Nachum Dershowitz,
D. N. Jayasimha,
Seungjoon Park:
Bounded Fairness.
Verification: Theory and Practice 2003: 304-317 |
| 99 | EE | Nachum Dershowitz:
Ground Canonicity
CoRR cs.LO/0304017: (2003) |
| 98 | EE | Nachum Dershowitz,
Iddo Tzameret:
Gap Embedding for Well-Quasi-Orderings.
Electr. Notes Theor. Comput. Sci. 84: (2003) |
| 97 | EE | Nachum Dershowitz:
Canonicity.
Electr. Notes Theor. Comput. Sci. 86(1): (2003) |
| 2001 |
|---|
| 96 | | Nachum Dershowitz,
David A. Plaisted:
Rewriting.
Handbook of Automated Reasoning 2001: 535-610 |
| 95 | EE | 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) |
| 2000 |
|---|
| 94 | | Nachum Dershowitz:
Artificial intelligence: Retrospective/prospective.
Ann. Math. Artif. Intell. 28(1-4): 3-5 (2000) |
| 93 | EE | Nachum Dershowitz,
Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
CoRR cs.PL/0011036: (2000) |
| 92 | EE | Nachum Dershowitz,
Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
A General Framework for Automatic Termination Analysis of Logic Programs
CoRR cs.PL/0012008: (2000) |
| 91 | | Naomi Lindenstrauss,
Nachum Dershowitz:
Abstract and-parallel Machines.
Computers and Artificial Intelligence 19(5): (2000) |
| 1999 |
|---|
| 90 | EE | Nachum Dershowitz,
Subrata Mitra:
Jeopardy.
RTA 1999: 16-29 |
| 89 | EE | Nachum Dershowitz,
Naomi Lindenstrauss,
Yehoshua Sagiv,
Alexander Serebrenik:
Automatic Termination Analysis of Programs Containing Arithmetic Predicates.
Electr. Notes Theor. Comput. Sci. 30(1): (1999) |
| 1998 |
|---|
| 88 | EE | Nachum Dershowitz,
Ralf Treinen:
An On-line Problem Database.
RTA 1998: 332-342 |
| 1997 |
|---|
| 87 | | Nachum Dershowitz,
Naomi Lindenstrauss:
Abstract And-Parallel Machines.
Euro-Par 1997: 1221-1225 |
| 86 | | Nachum Dershowitz:
When are Two Rewrite Systems More than None?
MFCS 1997: 37-43 |
| 85 | | Nachum Dershowitz:
Innocuous Constructor-Sharing Combinations.
RTA 1997: 202-216 |
| 1995 |
|---|
| 84 | | Nachum Dershowitz,
Naomi Lindenstrauss:
Conditional and Typed Rewriting Systems, 4th International Workshop, CTRS-94, Jerusalem, Israel, July 13-15, 1994, Proceedings
Springer 1995 |
| 83 | | Nachum Dershowitz:
Goal Solving as Operational Semantics.
ILPS 1995: 3-17 |
| 82 | | Nachum Dershowitz,
Jean-Pierre Jouannaud,
Jan Willem Klop:
Problems in Rewriting III.
RTA 1995: 457-471 |
| 81 | EE | Nachum Dershowitz,
Charles Hoot:
Natural Termination.
Theor. Comput. Sci. 142(2): 179-207 (1995) |
| 1994 |
|---|
| 80 | | Nachum Dershowitz:
From Specifications to Programs: Induction in the Service of Synthesis (Abstract).
AII/ALT 1994: 6-7 |
| 79 | | Nachum Dershowitz:
Hierachical Termination.
CTRS 1994: 89-105 |
| 78 | EE | Leo Bachmair,
Nachum Dershowitz:
Equational Inference, Canonical Proofs, and Proof Orderings.
J. ACM 41(2): 236-276 (1994) |
| 1993 |
|---|
| 77 | | Yuh-Jeng Lee,
Nachum Dershowitz:
Debugging Logic Programs Using Specifications.
AADEBUG 1993: 75-84 |
| 76 | | Nachum Dershowitz,
Subrata Mitra:
Higher-Order and Semantic Unification.
FSTTCS 1993: 139-150 |
| 75 | | Nachum Dershowitz:
A Taste of Rewrite Systems.
Functional Programming, Concurrency, Simulation and Automated Reasoning 1993: 199-228 |
| 74 | | Nachum Dershowitz,
Charles Hoot:
Topics in Termination.
RTA 1993: 198-212 |
| 73 | | Nachum Dershowitz,
Jean-Pierre Jouannaud,
Jan Willem Klop:
More Problems in Rewriting.
RTA 1993: 468-487 |
| 72 | | Nachum Dershowitz:
Trees, Ordinals and Termination.
TAPSOFT 1993: 243-250 |
| 71 | | Nachum Dershowitz:
Examples of Termination.
Term Rewriting 1993: 16-26 |
| 70 | | Nachum Dershowitz,
Uday S. Reddy:
Deductive and Inductive Synthesis of Equational Programs.
J. Symb. Comput. 15(5/6): 467-494 (1993) |
| 69 | | Nachum Dershowitz,
Yuh-Jeng Lee:
Logical Debugging.
J. Symb. Comput. 15(5/6): 745-773 (1993) |
| 68 | | Edward M. Reingold,
Nachum Dershowitz,
Stewart M. Clamen:
Calendrical Calculations, II: Three Historical Calendars.
Softw., Pract. Exper. 23(4): 383-404 (1993) |
| 1992 |
|---|
| 67 | | Nachum Dershowitz,
Subrata Mitra,
G. Sivakumar:
Decidable Matching for Convergent Systems (Preliminary Version).
CADE 1992: 589-602 |
| 66 | | Nachum Dershowitz,
Subrata Mitra:
Path Orderings for Termination of Associative-Commutative Rewriting.
CTRS 1992: 168-174 |
| 65 | | Nachum Dershowitz:
Semigroups Satisfying xm+n = xn.
CTRS 1992: 307-314 |
| 64 | | Nachum Dershowitz,
Edward M. Reingold:
Ordinal Arithmetic with List Structures.
LFCS 1992: 117-126 |
| 1991 |
|---|
| 63 | | Nachum Dershowitz:
Cononical Sets of Horn Clauses.
ICALP 1991: 267-278 |
| 62 | | Nachum Dershowitz:
Ordering-Based Strategies for Horn Clauses.
IJCAI 1991: 118-125 |
| 61 | | Nachum Dershowitz,
Jean-Pierre Jouannaud,
Jan Willem Klop:
Open Problems in Rewriting.
RTA 1991: 445-456 |
| 60 | | Nachum Dershowitz,
Jean-Pierre Jouannaud:
Notations for Rewting.
Bulletin of the EATCS 43: 162-174 (1991) |
| 59 | | Nachum Dershowitz,
Stéphane Kaplan,
David A. Plaisted:
Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . . .
Theor. Comput. Sci. 83(1): 71-96 (1991) |
| 1990 |
|---|
| 58 | | Nachum Dershowitz,
Eli Pinchover:
Inductive Synthesis of Equational Programs.
AAAI 1990: 234-239 |
| 57 | | Nachum Dershowitz,
Subrata Mitra,
G. Sivakumar:
Equation Solving in Conditional AC-Theories.
ALP 1990: 283-297 |
| 56 | | Nachum Dershowitz,
Naomi Lindenstrauss:
An Abstract Concurrent Machine for Rewriting.
ALP 1990: 318-331 |
| 55 | | Nachum Dershowitz:
A Maximal-Literal Unit Strategy for Horn Clauses.
CTRS 1990: 14-25 |
| 54 | | Nachum Dershowitz,
Jean-Pierre Jouannaud:
Rewrite Systems.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 243-320 |
| 53 | | Nachum Dershowitz,
Edward M. Reingold:
Calendrical Calculations.
Softw., Pract. Exper. 20(9): 899-928 (1990) |
| 52 | | Nachum Dershowitz,
Mitsuhiro Okada:
A Rationale for Conditional Equational Programming.
Theor. Comput. Sci. 75(1&2): 111-138 (1990) |
| 1989 |
|---|
| 51 | | Nachum Dershowitz:
Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings
Springer 1989 |
| 50 | | Nachum Dershowitz,
Hon Wai Leong:
Fast Exchange Sorts.
FODO 1989: 102-113 |
| 49 | | Nachum Dershowitz,
Stéphane Kaplan,
David A. Plaisted:
Infinite Normal Forms (Preliminary Version).
ICALP 1989: 249-262 |
| 48 | | Nachum Dershowitz,
Naomi Lindenstrauss:
Average Time Analyses Related to Logic Programming.
ICLP 1989: 369-381 |
| 47 | | Nachum Dershowitz,
Stéphane Kaplan:
Rewrite, Rewrite, Rewrite, Rewrite, Rewrite.
POPL 1989: 250-259 |
| 46 | EE | Nachum Dershowitz,
Shmuel Zaks:
Patterns in trees.
Discrete Applied Mathematics 25(3): 241-255 (1989) |
| 45 | | N. Alan Josephson,
Nachum Dershowitz:
An Implementation of Narrowing.
J. Log. Program. 6(1&2): 57-77 (1989) |
| 44 | | Leo Bachmair,
Nachum Dershowitz:
Completion for Rewriting Modulo a Congruence.
Theor. Comput. Sci. 67(2&3): 173-201 (1989) |
| 1988 |
|---|
| 43 | | Nachum Dershowitz,
G. Sivakumar:
Goal-Directed Equation Solving.
AAAI 1988: 166-170 |
| 42 | | Nachum Dershowitz,
Mitsuhiro Okada,
G. Sivakumar:
Canonical Conditional Rewrite Systems.
CADE 1988: 538-549 |
| 41 | | Nachum Dershowitz,
Mitsuhiro Okada:
Conditional Equational Programming and the Theory of Conditional Term Rewriting.
FGCS 1988: 337-346 |
| 40 | | Nachum Dershowitz,
Mitsuhiro Okada:
Proof-Theoretic Techniques for Term Rewriting Theory
LICS 1988: 104-111 |
| 39 | | Leo Bachmair,
Nachum Dershowitz:
Critical Pair Criteria for Completion.
J. Symb. Comput. 6(1): 1-18 (1988) |
| 38 | | Nachum Dershowitz,
Leo Marcus,
Andrzej Tarlecki:
Existence, Uniqueness, and Construction of Rewrite Systems.
SIAM J. Comput. 17(4): 629-639 (1988) |
| 1987 |
|---|
| 37 | | Nachum Dershowitz,
Mitsuhiro Okada,
G. Sivakumar:
Confluence of Conditional Rewrite Systems.
CTRS 1987: 31-44 |
| 36 | | Nachum Dershowitz,
G. Sivakumar:
Solving Goals in Equational Languages.
CTRS 1987: 45-55 |
| 35 | | Leo Bachmair,
Nachum Dershowitz:
A critical pair criterion for completion modulo a congruence.
EUROCAL 1987: 452-453 |
| 34 | | Leo Bachmair,
Nachum Dershowitz:
Inference Rules for Rewrite-Based First-Order Theorem Proving
LICS 1987: 331-337 |
| 33 | | Leo Bachmair,
Nachum Dershowitz:
Completion for Rewriting Modulo a Congruence.
RTA 1987: 192-203 |
| 32 | | Nachum Dershowitz,
Yuh-Jeng Lee:
Deductive Debugging.
SLP 1987: 298-306 |
| 31 | | Nachum Dershowitz:
Termination of Rewriting.
J. Symb. Comput. 3(1/2): 69-116 (1987) |
| 1986 |
|---|
| 30 | | Leo Bachmair,
Nachum Dershowitz:
Commutation, Transformation, and Termination.
CADE 1986: 5-20 |
| 29 | | Leo Bachmair,
Nachum Dershowitz,
Jieh Hsiang:
Orderings for Equational Proofs
LICS 1986: 346-357 |
| 28 | | N. Alan Josephson,
Nachum Dershowitz:
An Implementation of Narrowing: The RITE Way.
SLP 1986: 187-197 |
| 27 | EE | Nachum Dershowitz,
Shmuel Zaks:
Ordered trees and non-crossing partitions.
Discrete Mathematics 62(2): 215-218 (1986) |
| 1985 |
|---|
| 26 | | Nachum Dershowitz:
Synthesis by Completion.
IJCAI 1985: 208-214 |
| 25 | | Nachum Dershowitz:
Termination.
RTA 1985: 180-224 |
| 24 | | Nachum Dershowitz,
David A. Plaisted:
Logic Programming cum Applicative Programming.
SLP 1985: 54-66 |
| 23 | EE | Nachum Dershowitz:
Program Abstraction and Instantiation.
ACM Trans. Program. Lang. Syst. 7(3): 446-477 (1985) |
| 22 | | Nachum Dershowitz:
Synthetic Programming.
Artif. Intell. 25(3): 323-373 (1985) |
| 21 | | Nachum Dershowitz:
Computing with Rewrite Systems
Information and Control 65(2/3): 122-157 (1985) |
| 1984 |
|---|
| 20 | | Nachum Dershowitz,
Shmuel Zaks:
Patterns in Trees.
CAAP 1984: 93-102 |
| 19 | | Nachum Dershowitz,
N. Alan Josephson:
Logic Programming by Completion.
ICLP 1984: 313-320 |
| 1983 |
|---|
| 18 | | Jieh Hsiang,
Nachum Dershowitz:
Rewrite Methods for Clausal and Non-Clausal Theorem Proving.
ICALP 1983: 331-346 |
| 17 | | Nachum Dershowitz,
Jieh Hsiang,
N. Alan Josephson,
David A. Plaisted:
Associative-Commutative Rewriting.
IJCAI 1983: 940-944 |
| 1982 |
|---|
| 16 | | Nachum Dershowitz:
Orderings for Term-Rewriting Systems.
Theor. Comput. Sci. 17: 279-301 (1982) |
| 1981 |
|---|
| 15 | | Nachum Dershowitz,
Shmuel Zaks:
Applied Tree Enumerations.
CAAP 1981: 180-193 |
| 14 | | Nachum Dershowitz:
Termination of Linear Rewriting Systems (Preliminary Version).
ICALP 1981: 448-458 |
| 13 | | Nachum Dershowitz:
The Evolution of Programs: Program Abstraction and Instantiation.
ICSE 1981: 79-89 |
| 12 | | Nachum Dershowitz,
Zohar Manna:
Inference Rules for Program Annotation.
IEEE Trans. Software Eng. 7(2): 207-222 (1981) |
| 1980 |
|---|
| 11 | EE | Nachum Dershowitz,
Shmuel Zaks:
Enumerations of ordered trees.
Discrete Mathematics 31(1): 9-28 (1980) |
| 10 | | Nachum Dershowitz:
The Schorr-Waite Marking Algorithm Revisited.
Inf. Process. Lett. 11(3): 141-143 (1980) |
| 1979 |
|---|
| 9 | | Nachum Dershowitz:
Orderings for Term-Rewriting Systems
FOCS 1979: 123-131 |
| 8 | | Nachum Dershowitz,
Zohar Manna:
Proving termination with Multiset Orderings.
ICALP 1979: 188-202 |
| 7 | | Nachum Dershowitz,
Zohar Manna:
Proving Termination with Multiset Orderings.
Commun. ACM 22(8): 465-476 (1979) |
| 6 | | Nachum Dershowitz:
A Note on Simplification Orderings.
Inf. Process. Lett. 9(5): 212-215 (1979) |
| 1978 |
|---|
| 5 | | Nachum Dershowitz,
Zohar Manna:
Inference Rules for Program Annotation.
ICSE 1978: 158-167 |
| 4 | EE | R. Attar,
Yaacov Choueka,
Nachum Dershowitz,
Aviezri S. Fraenkel:
KEDMA - Linguistic Tools for Retrieval Systems.
J. ACM 25(1): 52-66 (1978) |
| 1977 |
|---|
| 3 | | Nachum Dershowitz:
Automatic Program Annotation.
IJCAI 1977: 378 |
| 2 | | Nachum Dershowitz,
Zohar Manna:
The Evolution of Programs: A System for Automatic Program Modification.
POPL 1977: 144-154 |
| 1 | | Nachum Dershowitz,
Zohar Manna:
The Evolution of Programs: Automatic Program Modification.
IEEE Trans. Software Eng. 3(6): 377-385 (1977) |
