On the public citation graph
The case for using equality axioms in automatic demonstration
0 signed · 24 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_13openalex-snapshot
Semantic Trees in Automatic Theorem-Proving
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_17openalex-snapshot
E-Resolution: Extension of Resolution to Include the Equality Relation
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.1016/0004-3702(70)90010-xopenalex-snapshot
Renamable paramodulation for automatic theorem proving with equality
inferredcites →https://doi.org/10.1090/psapm/019/0241195openalex-snapshot
A review of automatic theorem-proving
inferredcites →https://doi.org/10.1093/comjnl/8.4.341openalex-snapshot
Theorem-Proving for Computers: Some Results on Resolution and Renaming
inferredcites →https://doi.org/10.1145/321420.321428openalex-snapshot
Automatic Theorem Proving With Renamable and Semantic Resolution
inferredcites →https://doi.org/10.1145/321420.321429openalex-snapshot
The Concept of Demodulation in Theorem Proving
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-52885-7_107openalex-snapshot
Hyper resolution and equality axioms without function substitutions
inferred← citeshttps://doi.org/10.1007/3-540-60688-2_50openalex-snapshot
The equivalence of the subsumption theorem and the refutation-completeness for unconstrained resolution
inferred← citeshttps://doi.org/10.1007/3-540-63494-0_61openalex-snapshot
Least generalizations under implication
inferred← citeshttps://doi.org/10.1007/3540635149_53openalex-snapshot
Learning Horn definitions with equivalence and membership queries
inferred← citeshttps://doi.org/10.1007/3540635149_58openalex-snapshot
Which hypotheses can be found with inverse entailment?
inferred← citeshttps://doi.org/10.1007/978-3-642-81955-1_1openalex-snapshot
Automated Theorem Proving 1965–1970
inferred← citeshttps://doi.org/10.1007/978-3-7091-8389-2_2openalex-snapshot
Vorbemerkungen zu einer Theorie der Effizienz von Beweisverfahren
inferred← citeshttps://doi.org/10.1007/bf01068444openalex-snapshot
A brief review and bibliography of investigations into automation of search of theorem proofs in formal theories
inferred← citeshttps://doi.org/10.1007/bf03037583openalex-snapshot
Learning Horn definitions: Theory and an application to planning
inferred← citeshttps://doi.org/10.1007/bf03037584openalex-snapshot
An inference method for the complete inverse of relative subsumption
inferred← citeshttps://doi.org/10.1007/s10992-006-9038-7openalex-snapshot
Steps Toward a Computational Metaphysics
inferred← citeshttps://doi.org/10.1016/0004-3702(81)90015-1openalex-snapshot
Theorem proving with abstraction
inferred← citeshttps://doi.org/10.1016/0743-1066(87)90006-9openalex-snapshot
Logic programming with equations
inferred← citeshttps://doi.org/10.1016/b978-0-08-091728-3.50013-8openalex-snapshot
The Equality Relation
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.