A note on the parallel complexity of anti-unification

DOI10.1007/BF00245297zbMath0784.68042OpenAlexW2094748790MaRDI QIDQ688579

Krishna V. Palem, Kenneth McAloon, Gabriel M. Kuper, Kenneth J. Perry

Publication date: 20 December 1993

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00245297

zbMATH Keywords

unificationNCanti-unification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Related Items (4)

A New Algorithm for Computing Least Generalization of a Set of Atoms ⋮ On complexity of the anti-unification problem ⋮ Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini ⋮ Efficient parallel term matching and anti-unification

Cites Work

• Unnamed Item
• Linear unification
• Most specific logic programs
• Dynamic parallel memories
• Optimal parallel generation of a computation tree form
• On the sequential nature of unification
• Parallel Algorithms for Term Matching
• An Efficient Unification Algorithm
• Term matching on parallel computers
• Parallelism in random access machines

This page was built for publication: A note on the parallel complexity of anti-unification