A note on the parallel complexity of anti-unification

DOI10.1007/BF00245297MaRDI QIDQ688579zbMATH OpenOpenAlexFDO

Authors Krishna Palem, Gabriel M. Kuper, Kenneth McAloon, 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

anti-unificationNCunification

Mathematics Subject Classification ID

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

Recommendations

• On complexity of the anti-unification problem
• Efficient parallel term matching and anti-unification
• Higher-order pattern anti-unification in linear time
• On the sequential nature of unification
• Anti-unification in constraint logic programming

Cites work

• An Efficient Unification Algorithm
• Dynamic parallel memories
• scientific article; zbMATH DE number 3349329 (Why is no real title available?)
• Linear unification
• Most specific logic programs
• On the sequential nature of unification
• Optimal parallel generation of a computation tree form
• Parallel Algorithms for Term Matching
• Parallelism in random access machines
• Term matching on parallel computers

Cited in

(6)

• 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
• scientific article; zbMATH DE number 2064226 (Why is no real title available?)
• A new algorithm for computing least generalization of a set of atoms
• Efficient parallel term matching and anti-unification
• On the parameterized complexity of associative and commutative unification

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688579)