Parallelizing the closure computation in automated deduction

DOI10.1007/3-540-52885-7_77MaRDI QIDQ6488520zbMATH OpenFDO

Authors John K. Slaney, Ewing Lusk

Publication date 28 April 2023

Full work available at URL https://doi.org/10.1007/3-540-52885-7_77

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 15249
• Parallelization of the Buchberger algorithm
• scientific article; zbMATH DE number 1263425
• Parallel algorithm for construction of concept lattice
• Tree-based parallel algorithm design

Cites work

• 3088 varieties: A solution to the Ackermann constant problem
• Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
• scientific article; zbMATH DE number 1028818 (Why is no real title available?)
• On the structure of De Morgan monoids with corollaries on relevant logic and theories
• Sentential constants in R and \(R^{\neg}\)
• The Ackermann constant theorem: A computer-assisted investigation
• Using automated reasoning tools: A study of the semigroup \(F_ 2B_ 2\)

Cited in

(8)

• Parallel algorithm for computing fixpoints of Galois connections
• scientific article; zbMATH DE number 2089168 (Why is no real title available?)
• Cooperating proof attempts
• scientific article; zbMATH DE number 15249 (Why is no real title available?)
• Distributing equational theorem proving
• On the correctness of a distributed memory Gröbner basis algorithm
• Automated reasoning contributes to mathematics and logic
• A cooperative parallelization approach for property-directed \(k\)-induction

This page was built for publication: Parallelizing the closure computation in automated deduction

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