On complexity of the anti-unification problem
From MaRDI portal
Publication:3184519
DOI10.1515/DMA.2008.007zbMath1176.68092MaRDI QIDQ3184519
Egor V. Kostylev, Vladimir A. Zakharov
Publication date: 21 October 2009
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
computational complexity; acyclic directed graphs; anti-unification algorithm; anti-unification of logic terms
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- A note on the parallel complexity of anti-unification
- Efficient parallel term matching and anti-unification
- Properties of substitutions and unifications
- The logic-termal equivalence is polynomial-time decidable
- Linear unification
- An Efficient Unification Algorithm
- A Machine-Oriented Logic Based on the Resolution Principle