On the public citation graph

Distributed deduction by Clause-Diffusion: the aquarius prover

https://doi.org/10.1007/bfb0013183
0 signed · 33 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-16780-3_140openalex-snapshot
RRL: A rewrite rule laboratory
inferredcites →https://doi.org/10.1007/3-540-52531-9_127openalex-snapshot
The computation of Gröbner bases on a shared memory multiprocessor
inferredcites →https://doi.org/10.1007/3-540-55425-4_5openalex-snapshot
Implementing parallel rewriting
inferredcites →https://doi.org/10.1007/3-540-55425-4_6openalex-snapshot
Experiments with Roo, a parallel automated deduction system
inferredcites →https://doi.org/10.1007/3-540-55437-8_94openalex-snapshot
A Buchberger Algorithm for distributed memory multi-processors
inferredcites →https://doi.org/10.1007/3-540-55602-8_159openalex-snapshot
A parallel completion procedure for term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-56503-5_17openalex-snapshot
On fairness in distributed automated deduction
inferredcites →https://doi.org/10.1007/978-3-662-21551-7_6openalex-snapshot
Distributing equational theorem proving
inferredcites →https://doi.org/10.1007/bf00244493openalex-snapshot
Challenge problems in elementary calculus
inferredcites →https://doi.org/10.1007/bf00263447openalex-snapshot
Exploitation of parallel processing for implementing high-performance deduction systems
inferredcites →https://doi.org/10.1007/bf00302643openalex-snapshot
Automated proofs of the moufang identities in alternative rings
inferredcites →https://doi.org/10.1007/bf02432151openalex-snapshot
Seventy-five problems for testing automatic theorem provers
inferredcites →https://doi.org/10.1007/bfb0012889openalex-snapshot
RRL: A rewrite rule laboratory
inferredcites →https://doi.org/10.1007/bfb0024172openalex-snapshot
Implementing parallel rewriting
inferredcites →https://doi.org/10.1016/0378-4754(90)90189-popenalex-snapshot
Introduction to parallel programming
inferredcites →https://doi.org/10.1145/49093.1058124openalex-snapshot
Book review: Automated Reasoning: 33 Basic Research Problems by Larry Wos (Prentice Hall 1988)
inferredcites →https://doi.org/10.21236/ada460990openalex-snapshot
The Path-Indexing Method for Indexing Terms
inferredcites →https://doi.org/10.2172/5955653openalex-snapshot
Parallel programming with PCN
inferredcites →https://doi.org/10.2307/2274625openalex-snapshot
Larry Wos. Automated reasoning: 33 basic research problems. Prentice Hall, Englewood Cliffs, N.J., 1988, xiii + 319 pp.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jsco.1996.0027openalex-snapshot
Strategy Compliant Multi-Threaded Term Completion
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_72openalex-snapshot
Distributed theorem proving by Peers
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_32openalex-snapshot
p-SETHEO: Strategy Parallelism in Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-0348-8800-4_1openalex-snapshot
Parallel Completion Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_6openalex-snapshot
Parallel Theorem Proving
inferred← citeshttps://doi.org/10.1007/bf00881888openalex-snapshot
On subsumption in distributed derivations
inferred← citeshttps://doi.org/10.1007/bf00881910openalex-snapshot
Parallelization of deduction strategies: An analytical study
inferred← citeshttps://doi.org/10.1007/bf00881946openalex-snapshot
METEOR: Exploring model elimination theorem proving
inferred← citeshttps://doi.org/10.1007/bfb0013162openalex-snapshot
Design and Implementation of Symbolic Computation Systems
inferred← citeshttps://doi.org/10.1007/bfb0057466openalex-snapshot
Strategy selection for automated theorem proving
inferred← citeshttps://doi.org/10.1142/9789814533584_0003openalex-snapshot
On the reconstruction of proofs in distributed theorem proving with contraction: a modified Clause-Diffusion method
inferred← citeshttps://doi.org/10.25560/5591openalex-snapshot
A global workspace framework for combined reasoning
inferred← citeshttps://doi.org/10.3233/fi-1995-24128openalex-snapshot
THE CLAUSE-DIFFUSION METHODOLOGY FOR DISTRIBUTED DEDUCTION
inferred← citeshttps://doi.org/10.70675/b8a908cfzea79z4efdza9dezd3589d30dd25openalex-snapshot
Designing an Automated Concurrent Tableau-Based Theorem Prover for First-Order Logic
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.