Footnote:
Hinweis: Link zum Artikel, der zuerst in der Zeitschrift „ Journal of automated reasoning” erschienen ist. DOI: 10.1007/s10817-022-09624-4
Description:
The word problem for a finite set of ground identities is known to be decidable in polynomial time using congruence closure, and this is also the case if some of the function symbols are assumed to be commutative or defined by certain shallow identities, called strongly shallow. We show that decidability in P is preserved if we add the assumption that certain function symbols f are extensional in the sense that f (s₁, . . . , sn) ≈ f (t₁, . . . , tn) implies s₁ ≈ t₁, . . . , sn ≈ tn. In addition, we investigate a variant of extensionality that is more appropriate for commutative function symbols, but which raises the complexity of the word problem to coNP.