The following pages link to Nachum Dershowitz (Q199247):
Displaying 36 items.
- (Q4986664) (← links)
- (Q5013888) (← links)
- Trees, ordinals and termination (Q5044740) (← links)
- What is the Church-Turing Thesis? (Q5055286) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Topics in termination (Q5055795) (← links)
- More problems in rewriting (Q5055812) (← links)
- Problems in rewriting III (Q5055847) (← links)
- An abstract concurrent machine for rewriting (Q5096204) (← links)
- Confluence by Critical Pair Analysis (Q5170823) (← links)
- Generic Parallel Algorithms (Q5175885) (← links)
- More Patterns in Trees: Up and Down, Young and Old, Odd and Even (Q5189529) (← links)
- Graph Path Orderings (Q5222963) (← links)
- Abstract canonical inference (Q5277771) (← links)
- Verification: Theory and Practice (Q5305636) (← links)
- Verification: Theory and Practice (Q5305647) (← links)
- Logic Programming (Q5313178) (← links)
- (Q5386123) (← links)
- The Four Sons of Penrose (Q5387834) (← links)
- Boolean Rings for Intersection-Based Satisfiability (Q5387914) (← links)
- A critical pair criterion for completion modulo a congruence (Q5393376) (← links)
- Boris A. Trakhtenbrot: Academic Genealogy and Publications (Q5452173) (← links)
- The Church-Turing Thesis over Arbitrary Domains (Q5452180) (← links)
- Yaacov Choueka: A Profile (Q5498740) (← links)
- Term Rewriting and Applications (Q5703863) (← links)
- Term Rewriting and Applications (Q5703873) (← links)
- Theory and Applications of Satisfiability Testing (Q5713732) (← links)
- Theory and Applications of Satisfiability Testing (Q5713744) (← links)
- New Computational Paradigms (Q5717089) (← links)
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction (Q5756585) (← links)
- Between Broadway and the Hudson: A Bijection of Corridor Paths (Q5856390) (← links)
- Semigroups satisfying x m+n = x n (Q5881194) (← links)
- A maximal-literal unit strategy for horn clauses (Q5881264) (← links)
- Processes, Terms and Cycles: Steps on the Road to Infinity (Q5898155) (← links)
- A general framework for automatic termination analysis od logic programs (Q5941755) (← links)
- Exact Exploration (Q6748787) (← links)
