Extensions of unification modulo ACUI

Franz Baader, Pavlos Marantidis, Antoine Mottet, Alexander Okhotin

Результат исследований: Научные публикации в периодических изданияхстатьярецензирование

Аннотация

The theory ACUI of an associative, commutative, and idempotent binary function symbol + with unit 0 was one of the first equational theories for which the complexity of testing solvability of unification problems was investigated in detail. In this paper, we investigate two extensions of ACUI. On one hand, we consider approximate ACUI-unification, where we use appropriate measures to express how close a substitution is to being a unifier. On the other hand, we extend ACUI-unification to ACUIG-unification, that is, unification in equational theories that are obtained from ACUI by adding a finite set G of ground identities. Finally, we combine the two extensions, that is, consider approximate ACUI-unification. For all cases we are able to determine the exact worst-case complexity of the unification problem.

Язык оригиналаанглийский
Страницы (с-по)597-626
ЖурналMathematical Structures in Computer Science
Том30
Номер выпуска6
DOI
СостояниеОпубликовано - 1 июн 2020

Предметные области Scopus

  • Математика (разное)
  • Прикладные компьютерные науки

Fingerprint Подробные сведения о темах исследования «Extensions of unification modulo ACUI». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать