scientific article; zbMATH DE number 4047099

MaRDI QIDQ3783558zbMATH OpenFDO

Authors

Publication date 1987

zbMATH Keywords

EREWlogic programmingmodel of parallel computationterm-matchingunification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Term matching on parallel computers
• Efficient parallel term matching and anti-unification
• On the sequential nature of unification
• scientific article; zbMATH DE number 4049127
• scientific article; zbMATH DE number 4090854

Cited in

(9)

• On the relationship of congruence closure and unification
• Optimal parallel algorithms for forest and term matching
• scientific article; zbMATH DE number 4049127 (Why is no real title available?)
• Parallel Algorithms for Term Matching
• scientific article; zbMATH DE number 4090854 (Why is no real title available?)
• Term matching on parallel computers
• Using the tree representation of terms to recognize matching with neural networks
• Some complexity theoretic aspects of AC rewriting
• Efficient parallel term matching and anti-unification

This page was built for publication:

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