On the public citation graph

Controlling redundancy in large search spaces: Argonne-style theorem proving through the years

https://doi.org/10.1007/bfb0013052
0 signed · 44 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-52885-7_109openalex-snapshot
Automated reasoning contributes to mathematics and logic
inferredcites →https://doi.org/10.1007/3-540-52885-7_77openalex-snapshot
Parallelizing the closure computation in automated deduction
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-55602-8_213openalex-snapshot
ROO: A parallel theorem prover
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_19openalex-snapshot
Paramodulation and Theorem-Proving in First-Order Theories with Equality
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/bf00245458openalex-snapshot
Experiments with discrimination-tree indexing and path indexing for term retrieval
inferredcites →https://doi.org/10.1007/bf00247824openalex-snapshot
Automated discovery of new axiomatizations of the left group and right group calculi
inferredcites →https://doi.org/10.1007/bf00263447openalex-snapshot
Exploitation of parallel processing for implementing high-performance deduction systems
inferredcites →https://doi.org/10.1007/bf02575007openalex-snapshot
Using automated reasoning tools: A study of the semigroupF 2 B 2
inferredcites →https://doi.org/10.1007/bfb0000052openalex-snapshot
Logic machine architecture: Kernel functions
inferredcites →https://doi.org/10.1007/bfb0000053openalex-snapshot
Logic machine architecture: Inference mechanisms
inferredcites →https://doi.org/10.1016/0004-3702(84)90054-7openalex-snapshot
A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domains
inferredcites →https://doi.org/10.1016/0304-3975(91)90034-yopenalex-snapshot
The absence and the presence of fixed point combinators
inferredcites →https://doi.org/10.1016/0898-1221(75)90019-xopenalex-snapshot
An implementation of hyper-resolution
inferredcites →https://doi.org/10.1016/0898-1221(82)90053-0openalex-snapshot
Experiments with resolution-based theorem-proving algorithms
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications
inferredcites →https://doi.org/10.1080/00029890.1985.11971545openalex-snapshot
AUTOMATED REASONING
inferredcites →https://doi.org/10.1090/s0025-5718-1981-0628714-5openalex-snapshot
Semigroups, antiautomorphisms, and involutions: a computer solution to an open problem. I
inferredcites →https://doi.org/10.1109/tc.1976.1674696openalex-snapshot
Problems and Experiments for and with Automated Theorem-Proving Programs
inferredcites →https://doi.org/10.1145/1464052.1464109openalex-snapshot
The unit preference strategy in theorem proving
inferredcites →https://doi.org/10.1145/1500412.1500517openalex-snapshot
An automated reasoning system
inferredcites →https://doi.org/10.1145/321296.321302openalex-snapshot
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
inferredcites →https://doi.org/10.1145/321812.321814openalex-snapshot
A New Class of Automated Theorem-Proving Algorithms
inferredcites →https://doi.org/10.1145/322307.322308openalex-snapshot
Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
inferredcites →https://doi.org/10.1305/ndjfl/1093634569openalex-snapshot
Single axioms for the left group and right group calculi.
inferredcites →https://doi.org/10.2172/6427100openalex-snapshot
FormEd: An X Window System application for managing first-order formulas
inferredcites →https://doi.org/10.2172/6569195openalex-snapshot
A tutorial on the construction of high-performance resolution/paramodulation systems

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-45575-2_11openalex-snapshot
Adaptive Saturation-Based Reasoning
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_3openalex-snapshot
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_26openalex-snapshot
Vampire
inferred← citeshttps://doi.org/10.1007/3-540-61697-7_4openalex-snapshot
Equality elimination for the tableau method
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_34openalex-snapshot
Merging relational database technology with constraint technology
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_2openalex-snapshot
The Strategy Challenge in SMT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_1openalex-snapshot
First-Order Theorem Proving and Vampire
inferred← citeshttps://doi.org/10.1007/bf00881918openalex-snapshot
The anatomy of vampire
inferred← citeshttps://doi.org/10.1007/s10817-022-09620-8openalex-snapshot
Larry Wos: Visions of Automated Reasoning
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50012-6openalex-snapshot
Equality Reasoning in Sequent-Based Calculi
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50028-xopenalex-snapshot
Term Indexing
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00040-3openalex-snapshot
Limited resource strategy in resolution theorem proving
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80649-2openalex-snapshot
Citius altius fortius
inferred← citeshttps://doi.org/10.1109/csci51800.2020.00332openalex-snapshot
Reasoning Heuristics for the Theorem-Proving Platform Rodin/Event-B
inferred← citeshttps://doi.org/10.48550/arxiv.0802.2127openalex-snapshot
New Implementation Framework for Saturation-Based Reasoning
inferred← citeshttps://doi.org/10.70675/a1cae518z180dz410dzba10zae44f8635761openalex-snapshot
Automated reasoning techniques for hybrid logics
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.