Efficient parallel term matching and anti-unification

DOI10.1007/BF00245298zbMath0784.68047OpenAlexW1492604685MaRDI QIDQ688582

Arthur L. Delcher, Simon Kasif

Publication date: 22 March 1994

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

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

zbMATH Keywords

theorem provinglogic programminginductive inferenceEREW PRAMCRCW PRAManti-unificationsymbolic pattern matchingterm matching

Mathematics Subject Classification ID

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

Related Items (5)

A New Algorithm for Computing Least Generalization of a Set of Atoms ⋮ On complexity of the anti-unification problem ⋮ Unranked second-order anti-unification ⋮ A Library of Anti-unification Algorithms ⋮ Anti-unification for unranked terms and hedges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the parallel complexity of anti-unification
• Parallel algorithms for the connected components and minimal spanning tree problems
• Optimal parallel algorithms for forest and term matching
• Most specific logic programs
• An Efficient Parallel Biconnectivity Algorithm
• On the sequential nature of unification
• PARLOG: parallel programming in logic
• Deterministic coin tossing with applications to optimal parallel list ranking
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• Parallel Merge Sort
• Parallel Algorithms for Term Matching
• Computing connected components on parallel computers
• Term matching on parallel computers
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
• Some results on the complexity of exploiting data dependency in parallel logic programs

This page was built for publication: Efficient parallel term matching and anti-unification