On the public citation graph

Towards efficient subsumption

https://doi.org/10.1007/bfb0054276
0 signed · 34 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-56732-1openalex-snapshot
Resolution Methods for the Decision Problem
inferredcites →https://doi.org/10.1007/3-540-58085-9_78openalex-snapshot
The Alf proof editor and its proof engine
inferredcites →https://doi.org/10.1007/3-540-61040-5openalex-snapshot
Term Indexing
inferredcites →https://doi.org/10.1007/3-540-61511-3_65openalex-snapshot
A resolution theorem prover for intuitionistic logic
inferredcites →https://doi.org/10.1007/3-540-61780-9_75openalex-snapshot
Optimized encodings of fragments of type theory in first order logic
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/bf01051768openalex-snapshot
Resolution calculus for the first order linear logic
inferredcites →https://doi.org/10.1023/a:1005887414560openalex-snapshot
Gandalf
inferredcites →https://doi.org/10.1093/logcom/5.4.449openalex-snapshot
Completeness of Resolution for Definite Answers
inferredcites →https://doi.org/10.1145/3149.214118openalex-snapshot
On the efficiency of subsumption algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11532231_6openalex-snapshot
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic
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-48256-3_21openalex-snapshot
Integrating Gandalf and HOL
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_32openalex-snapshot
GKC: A Reasoning System for Large Knowledge Bases
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_10openalex-snapshot
An Efficient Subsumption Test Pipeline for BS(LRA) Clauses
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_11openalex-snapshot
SAT-Based Subsumption Resolution
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_12openalex-snapshot
Regularization in Spider-Style Strategy Discovery and Schedule Construction
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_13openalex-snapshot
Lemma Discovery and Strategies for Automated Induction
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_5openalex-snapshot
A Higher-Order Vampire (Short Paper)
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_14openalex-snapshot
Incremental Forward Reasoning for White-Box Proof Search
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_21openalex-snapshot
Chain Resolution for the Semantic Web
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_36openalex-snapshot
The CADE ATP System Competition
inferred← citeshttps://doi.org/10.1007/978-3-540-39715-1_10openalex-snapshot
Combining an Inference Engine with Databases: A Rule Server
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_3openalex-snapshot
Simple and Efficient Clause Subsumption with Feature Vector Indexing
inferred← citeshttps://doi.org/10.1007/s10703-024-00454-1openalex-snapshot
SAT solving for variants of first-order subsumption
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50029-1openalex-snapshot
Combining Superposition, Sorts and Splitting
inferred← citeshttps://doi.org/10.1023/a:1006285423991openalex-snapshot
The CADE-15 ATP System Competition
inferred← citeshttps://doi.org/10.1023/a:1006393501098openalex-snapshot
The CADE-16 ATP System Competition
inferred← citeshttps://doi.org/10.1023/a:1011917032470openalex-snapshot
An Algorithm for Dual Transformation in First-Order Logic
inferred← citeshttps://doi.org/10.1023/a:1027302123309openalex-snapshot
The CADE-18 ATP System Competition
inferred← citeshttps://doi.org/10.1142/s0218213006003119openalex-snapshot
SEMANTIC DERIVATION VERIFICATION: TECHNIQUES AND IMPLEMENTATION
inferred← citeshttps://doi.org/10.1609/aimag.v37i2.2620openalex-snapshot
The CADE ATP System Competition — CASC
inferred← citeshttps://doi.org/10.29007/fs4bopenalex-snapshot
Waste Reduction: Experiments in Sharing Clauses between Runs of a Portfolio of Strategies (Experimental Paper)
inferred← citeshttps://doi.org/10.48456/tr-601openalex-snapshot
Combining model checking and theorem proving
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.