On the public citation graph

Strict basic superposition

0 signed · 20 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_105openalex-snapshot

On restrictions of ordered paramodulation with simplification

inferredcites →https://doi.org/10.1007/3-540-55253-7_22openalex-snapshot

Basic superposition is complete

inferredcites →https://doi.org/10.1007/3-540-55602-8_185openalex-snapshot

Basic paramodulation and superposition

inferredcites →https://doi.org/10.1007/3-540-55602-8_186openalex-snapshot

Theorem proving with ordering constrained clauses

inferredcites →https://doi.org/10.1007/bfb0012820openalex-snapshot

First-order theorem proving using conditional rewrite rules

inferredcites →https://doi.org/10.1016/s0747-7171(08)80130-7openalex-snapshot

Using forcing to prove completeness of resolution and paramodulation

inferredcites →https://doi.org/10.1093/logcom/4.3.217openalex-snapshot

Rewrite-based Equational Theorem Proving with Selection and Simplification

inferredcites →https://doi.org/10.1137/0204036openalex-snapshot

Proving Theorems with the Modification Method

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10720084_13openalex-snapshot

Modular Redundancy for Theorem Proving

inferred← citeshttps://doi.org/10.1007/3-540-45127-7_22openalex-snapshot

Deriving Focused Calculi for Transitive Relations

inferred← citeshttps://doi.org/10.1007/3-540-48660-7_9openalex-snapshot

A Framework for the Flexible Integration of a Class of Decision Procedures into Theorem Provers

inferred← citeshttps://doi.org/10.1007/978-0-387-09695-7_38openalex-snapshot

Efficient Two-Phase Data Reasoning for Description Logics

inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_7openalex-snapshot

A Strict Constrained Superposition Calculus for Graphs

inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_1openalex-snapshot

Tao’s Equational Proof Challenge Accepted

inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_1openalex-snapshot

Harald Ganzinger’s Legacy: Contributions to Logics and Programming

inferred← citeshttps://doi.org/10.1007/s10115-019-01345-2openalex-snapshot

Resolution-based rewriting for Horn-$$\mathcal {SHIQ}$$SHIQ ontologies

inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50012-6openalex-snapshot

Equality Reasoning in Sequent-Based Calculi

inferred← citeshttps://doi.org/10.1023/a:1015707001763openalex-snapshot

A General Setting for Flexibly Combining and Augmenting Decision Procedures

inferred← citeshttps://doi.org/10.22028/d291-25703openalex-snapshot

Resolution-based decision procedures for subclasses of first-order logic

inferred← citeshttps://doi.org/10.5445/ir/1000003797openalex-snapshot

Reasoning in description logics using resolution and deductive databases

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.