|
This article is cited in 4 scientific papers (total in 4 papers)
On complexity of the anti-unification problem
E. V. Kostylev, V. A. Zakharov
Abstract:
In this paper we suggest a new algorithm of anti-unification of logic terms represented by acyclic directed graphs and estimate its complexity. The anti-unification problem consists of the following: for two given terms find the most specific term that has the given terms as instances. We suggest an anti-unification algorithm whose complexity linearly depends on the size of the most specific term it computes. It is thus established that the anti-unification problem is of almost the same complexity as the unification problem. It is also shown that there exist terms whose most specific term is of size $O(n^2)$, where $n$ is the size of the graphs representing these terms.
Received: 14.06.2007
Citation:
E. V. Kostylev, V. A. Zakharov, “On complexity of the anti-unification problem”, Diskr. Mat., 20:1 (2008), 131–144; Discrete Math. Appl., 18:1 (2008), 85–98
Linking options:
https://www.mathnet.ru/eng/dm996https://doi.org/10.4213/dm996 https://www.mathnet.ru/eng/dm/v20/i1/p131
|
Statistics & downloads: |
Abstract page: | 626 | Full-text PDF : | 216 | References: | 48 | First page: | 17 |
|