Deciding the Confluence of Ordered Term Rewrite Systems

@inproceedings{ComonDecidingTC,
  title={Deciding the Confluence of Ordered Term Rewrite Systems},
  author={Huber Comon}
}
  • Huber Comon

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Paramodulation - based theorem proving

  • J. A. Robinsonand A. Voronkov
  • 2001

Simulation of Turing ma hines by a leftlinear rewrite rule

  • N. Dershowitz
  • 1997

On the re ursive de omposition ordering with lexi ographi al status and otherrelated orderings

  • L. Marvin
  • Journal of Automated Reasoning
  • 1990

Ordered rewriting and on uen e

  • E. Mark
  • Sti kel , editor , 10 th International Conferen e…
  • 1990

Proof by onsisten y

  • Deepak Kapur, David R. Musser.
  • Revue Fran  aise d ' Intelligen e Arti ielle
  • 1990

More problems in rewriting

  • J-P. Jouannaud N. Dershowitz, J-W. Klop
  • 1987

On ground on uen e of term rewritingsystems

  • Deepak Kapur, Paliath Narendran, Friedri h Otto
  • Arti ial Intelligen e
  • 1987

Similar Papers

Loading similar papers…