On the public citation graph

METEOR: Exploring model elimination theorem proving

https://doi.org/10.1007/bf00881946
0 signed · 45 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_122openalex-snapshot
A prolog technology theorem prover: Implementation by an extended prolog compiler
inferredcites →https://doi.org/10.1007/3-540-52885-7_131openalex-snapshot
Otter 2.0
inferredcites →https://doi.org/10.1007/3-540-52885-7_78openalex-snapshot
Partheo: A high-performance parallel theorem prover
inferredcites →https://doi.org/10.1007/3-540-55602-8_168openalex-snapshot
Caching and lemmaizing in model elimination theorem provers
inferredcites →https://doi.org/10.1007/3-540-55602-8_213openalex-snapshot
ROO: A parallel theorem prover
inferredcites →https://doi.org/10.1007/978-94-011-3488-0_2openalex-snapshot
METEORs: High Performance Theorem Provers using Model Elimination
inferredcites →https://doi.org/10.1007/bf00244281openalex-snapshot
Parthenon: A parallel theorem prover for non-horn clauses
inferredcites →https://doi.org/10.1007/bf00244282openalex-snapshot
SETHEO: A high-performance theorem prover
inferredcites →https://doi.org/10.1007/bf00244493openalex-snapshot
Challenge problems in elementary calculus
inferredcites →https://doi.org/10.1007/bf00244944openalex-snapshot
Non-Horn clause logic programming without contrapositives
inferredcites →https://doi.org/10.1007/bf00263447openalex-snapshot
Exploitation of parallel processing for implementing high-performance deduction systems
inferredcites →https://doi.org/10.1007/bf00263762openalex-snapshot
Concurrency of operations on B-trees
inferredcites →https://doi.org/10.1007/bf00289064openalex-snapshot
Concurrent search and insertion in 2?3 trees
inferredcites →https://doi.org/10.1007/bf00297245openalex-snapshot
A prolog technology theorem prover: Implementation by an extended prolog compiler
inferredcites →https://doi.org/10.1007/bf00381144openalex-snapshot
Hierarchical deduction
inferredcites →https://doi.org/10.1007/bf03037328openalex-snapshot
A Prolog technology theorem prover
inferredcites →https://doi.org/10.1007/bfb0013183openalex-snapshot
Distributed deduction by Clause-Diffusion: the aquarius prover
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0304-3975(82)90026-3openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1109/icdcs.1989.37968openalex-snapshot
Evaluation of concurrent pools
inferredcites →https://doi.org/10.1109/lics.1989.39161openalex-snapshot
PARTHENON: a parallel theorem prover for nonHorn clauses
inferredcites →https://doi.org/10.1109/tc.1976.1674697openalex-snapshot
Resolution, Refinements, and Search Strategies: A Comparative Study
inferredcites →https://doi.org/10.1137/0215082openalex-snapshot
On Maintaining Dynamic Information in a Concurrent Environment
inferredcites →https://doi.org/10.1142/9789812813411_0041openalex-snapshot
Subsumption, a Sometimes Undervalued Procedure
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
inferredcites →https://doi.org/10.1145/321796.321807openalex-snapshot
An Implementation of the Model Elimination Proof Procedure
inferredcites →https://doi.org/10.1145/359863.359878openalex-snapshot
Concurrent reading and writing
inferredcites →https://doi.org/10.1145/378570.378600openalex-snapshot
Unix network 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.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.1007/3-540-45744-5_25openalex-snapshot
Conditional Pure Literal Graphs
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_15openalex-snapshot
Lemma Generalization and Non-unit Lemma Matching for Model Elimination
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_18openalex-snapshot
The TPTP problem library
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_16openalex-snapshot
Lemma matching for a PTTP-based top-down theorem prover
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_11openalex-snapshot
A Bibliography on Analytic Tableaux Theorem Proving
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.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:1005806324129openalex-snapshot
The TPTP Problem Library
inferred← citeshttps://doi.org/10.1023/a:1006291616338openalex-snapshot
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
inferred← citeshttps://doi.org/10.1609/aimag.v20i1.1442openalex-snapshot
Automated Deduction: Looking Ahead
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.