On the public citation graph

Parthenon: A parallel theorem prover for non-horn clauses

https://doi.org/10.1007/bf00244281
0 signed · 30 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/bf03037328openalex-snapshot
A Prolog technology theorem prover
inferredcites →https://doi.org/10.1007/bfb0014984openalex-snapshot
Or-parallel execution models of Prolog
inferredcites →https://doi.org/10.1145/321450.321456openalex-snapshot
Mechanical Theorem-Proving by Model Elimination
inferredcites →https://doi.org/10.1145/321526.321527openalex-snapshot
A Simplified Format for the Model Elimination Theorem-Proving Procedure

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-55602-8_168openalex-snapshot
Caching and lemmaizing in model elimination theorem provers
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_6openalex-snapshot
Parallel Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-642-76934-4_16openalex-snapshot
Modelling and Performance Analysis of a Parallel Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_10openalex-snapshot
Parallel Theorem Provers Based on Setheo
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/bf00881952openalex-snapshot
Tableau-based theorem provers: Systems and implementations
inferred← citeshttps://doi.org/10.1007/bfb0055144openalex-snapshot
Exploiting parallelism in interactive theorem provers
inferred← citeshttps://doi.org/10.1007/s10817-004-3243-2openalex-snapshot
Octopus: Combining Learning and Parallel Search
inferred← citeshttps://doi.org/10.1016/b978-0-444-81704-4.50015-6openalex-snapshot
Parallel Automated Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-0-444-81837-9.50020-8openalex-snapshot
Scalability of an OR-parallel Theorem Prover — A Modelling Approach —
inferred← citeshttps://doi.org/10.1016/j.eswa.2005.04.013openalex-snapshot
A multi-agent framework for distributed theorem proving
inferred← citeshttps://doi.org/10.1016/j.future.2012.08.006openalex-snapshot
Recent developments in high performance computing and security: An editorial
inferred← citeshttps://doi.org/10.1023/a:1005770705587openalex-snapshot
The Use of Lemmas in the Model Elimination Procedure
inferred← citeshttps://doi.org/10.1023/a:1005885725562openalex-snapshot
Nagging: A Distributed, Adversarial Search-Pruning Technique Applied to First-Order Inference
inferred← citeshttps://doi.org/10.1023/a:1006127022180openalex-snapshot
SPS-Parallelism + SETHEO = SPTHEO
inferred← citeshttps://doi.org/10.1023/a:1006469202251openalex-snapshot
Parallelization of a Hyper-Linking–Based Theorem Prover
inferred← citeshttps://doi.org/10.1023/a:1018932114059openalex-snapshot
A taxonomy of parallel strategies for deduction
inferred← citeshttps://doi.org/10.1093/comjnl/45.5.561openalex-snapshot
Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations
inferred← citeshttps://doi.org/10.1109/iccitechn.2010.5723892openalex-snapshot
Towards a tableau based high performance automated theorem prover
inferred← citeshttps://doi.org/10.1109/icpads.1996.517599openalex-snapshot
On parallelism of hyper-linking theorem proving: a preliminary report
inferred← citeshttps://doi.org/10.1109/is.2004.1344652openalex-snapshot
A parallelism-oriented prover with a meta-predicate
inferred← citeshttps://doi.org/10.1145/143365.143523openalex-snapshot
Fast mutual exclusion for uniprocessors
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.4304/jcp.7.3.597-607openalex-snapshot
A Tableau Based Automated Theorem Prover Using High Performance Computing
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.