Fine-grained concurrent completion

DOI10.1007/3-540-61464-8_39zbMath1503.68123OpenAlexW1562935458MaRDI QIDQ5055848

No author found.

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61464-8_39

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

Fine-grained concurrent completion

Uses Software

• PARTHEO
• DISCOUNT
• Aquarius

Cites Work

• Unnamed Item
• Unnamed Item
• A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
• Distributed deduction by clause-diffusion: Distributed contraction and the Aquarius prover
• Derivation of a termination detection algorithm for distributed computations
• On the sequential nature of unification
• An algorithm for finding canonical sets of ground rewrite rules in polynomial time
• Modularity of completeness revisited
• Fine-grained concurrent completion

This page was built for publication: Fine-grained concurrent completion