Title :
The unifiability problem in ground AC theories
Author :
Narendran, Paliath ; Rusinowitch, Michaël
Author_Institution :
Inst. of Programs and Logics, State Univ. of New York, Albany, NY, USA
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
Keywords :
decidability; programming theory; rewriting systems; associative-communicative symbols; decidable; finitely presented commutative semigroups; ground AC theories; ground equations; unifiability problem; uniform word problem; AC generators; Chromium; Equations; Logic programming; Petri nets;
Conference_Titel :
Logic in Computer Science, 1993. LICS '93., Proceedings of Eighth Annual IEEE Symposium on
Conference_Location :
Montreal, Que.
Print_ISBN :
0-8186-3140-6
DOI :
10.1109/LICS.1993.287572
