Paper: The unifiability problem in ground AC theories (at LICS 1993)

Authors: Paliath Narendran Michaël Rusinowitch

Abstract

It is shown that unifiability is decidable in theories presented by a set of ground equations with several associative-communicative symbols (ground AC theories). This result applies, for instance, to finitely presented commutative semigroups, and it extends the authors' previous work (P. Narendran and M. Rusinwithch, 1991) where they gave an algorithm for solving the uniform word problem in ground AC theories

BibTeX

  @InProceedings{NarendranRusinowitc-Theunifiabilityprob,
    author = 	 {Paliath Narendran and Michaël Rusinowitch},
    title = 	 {The unifiability problem in ground AC theories},
    booktitle =  {Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science (LICS 1993)},
    year =	 {1993},
    month =	 {June}, 
    pages =      {364--370},
    location =   {Montreal, Canada}, 
    publisher =	 {IEEE Computer Society Press}
  }