#### Filter Results:

- Full text PDF available (198)

#### Publication Year

1977

2017

- This year (1)
- Last 5 years (56)
- Last 10 years (99)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Nachum Dershowitz
- 20th Annual Symposium on Foundations of Computer…
- 1979

Methods of proving that a term-rewriting system terminates are presented. They are based on the notion of "simplification orderings", orderings in which any term that is homeomorphically embeddable in another is smaller than the other. A particularly useful class of simplification orderings, the "recursive path orderings", is defined. Several examples of… (More)

- Nachum Dershowitz, Jean-Pierre Jouannaud
- Handbook of Theoretical Computer Science, Volume…
- 1990

- Nachum Dershowitz, Zohar Manna
- Commun. ACM
- 1979

A common tool for proving the termination of programs is the <italic>well-founded set</italic>, a set ordered in such a way as to admit no infinite descending sequences. The basic approach is to find a <italic>termination function</italic> that maps the values of the program variables into some well-founded set, such that the value of the termination… (More)

- Leo Bachmair, Nachum Dershowitz
- CADE
- 1986

- Nachum Dershowitz
- ICALP
- 1981

- Leo Bachmair, Nachum Dershowitz
- Theor. Comput. Sci.
- 1987

- Nachum Dershowitz
- Inf. Process. Lett.
- 1979

- Nachum Dershowitz
- J. Symb. Comput.
- 1987

This survey describes methods for proving that systems of rewrite rules are terminating programs. We illustrate the use in termination proofs of various kinds of orderings on terms, including polynomial interpretations and path orderings. The effect of restrictions, such as linearity, on the form of rules is also considered. In general, however, termination… (More)

- Leo Bachmair, Nachum Dershowitz, Jieh Hsiang
- LICS
- 1986

- Leo Bachmair, Nachum Dershowitz
- J. ACM
- 1994

We describe the application of proof orderings—a technique for reasoning about inference systems-to various rewrite-based theorem-proving methods, including refinements of the standard Knuth-Bendix completion procedure based on critical pair criteria; Huet's procedure for rewriting modulo a congruence; ordered completion (a refutationally complete… (More)