Paper: The theory of ground rewrite systems is decidable (at LICS 1990)

Authors: Max Dauchet Sophie Tison

Abstract

Using tree automata techniques, it is proven that the theory of ground rewrite systems is decidable. Novel decision procedures are presented for most classic properties of ground rewrite systems. An example is presented to illustrate how these results could be used for specification and debugging

BibTeX

  @InProceedings{DauchetTison-Thetheoryofgroundre,
    author = 	 {Max Dauchet and Sophie Tison},
    title = 	 {The theory of ground rewrite systems is decidable},
    booktitle =  {Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science (LICS 1990)},
    year =	 {1990},
    month =	 {June}, 
    pages =      {242--248},
    location =   {Philadelphia, PA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }