Fine-grained concurrent completion (Q5055848)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7631279

Language	Label	Description	Also known as
English	Fine-grained concurrent completion	scientific article; zbMATH DE number 7631279

Statements

scholarly article

0 references

Fine-grained concurrent completion (English)

0 references

Rewriting Techniques and Applications

0 references

publication date

9 December 2022

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-61464-8_39

0 references

Distributed deduction by clause-diffusion: Distributed contraction and the Aquarius prover

0 references

Derivation of a termination detection algorithm for distributed computations

0 references

0 references

On the sequential nature of unification

0 references

An algorithm for finding canonical sets of ground rewrite rules in polynomial time

0 references

Modularity of completeness revisited

0 references

Fine-grained concurrent completion

0 references

0 references

A fast algorithm for generating reduced ground rewriting systems from a set of ground equations

0 references

Partheo: A high-performance parallel theorem prover

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/3-540-61464-8_39

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5055848

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5055848&oldid=38019776"