The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nachum Dershowitz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  126. Boris A. Trakhtenbrot: Academic Genealogy and Publications. [Citation Graph (, )][DBLP]


  127. The Church-Turing Thesis over Arbitrary Domains. [Citation Graph (, )][DBLP]


  128. SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets. [Citation Graph (, )][DBLP]


  129. On Lazy Commutation. [Citation Graph (, )][DBLP]


  130. Three Paths to Effectiveness. [Citation Graph (, )][DBLP]


  131. Yuri, Logic, and Computer Science. [Citation Graph (, )][DBLP]


  132. Canonicity! [Citation Graph (, )][DBLP]


  133. Canonical Inference for Implicational Systems. [Citation Graph (, )][DBLP]


  134. Bit Inference. [Citation Graph (, )][DBLP]


  135. Exact Exploration and Hanging Algorithms. [Citation Graph (, )][DBLP]


  136. A Natural Axiomatization of Computability and Proof of Church's Thesis. [Citation Graph (, )][DBLP]


  137. Comparing Computational Power [Citation Graph (, )][DBLP]


  138. When are two algorithms the same? [Citation Graph (, )][DBLP]


  139. Patterns in trees. [Citation Graph (, )][DBLP]


Search in 0.035secs, Finished in 0.040secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002