On the public citation graph

An ordered theory resolution calculus

https://doi.org/10.1007/bfb0013054
0 signed · 31 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_86openalex-snapshot
A new method for establishing refutational completeness in theorem proving
inferredcites →https://doi.org/10.1007/3-540-54317-1_89openalex-snapshot
Completion of first-order clauses with equality by strict superposition
inferredcites →https://doi.org/10.1007/bf00244275openalex-snapshot
Automated deduction by theory resolution
inferredcites →https://doi.org/10.1007/bfb0012820openalex-snapshot
First-order theorem proving using conditional rewrite rules
inferredcites →https://doi.org/10.1007/bfb0018458openalex-snapshot
Towards a connection procedure with built in theories
inferredcites →https://doi.org/10.1007/bfb0018990openalex-snapshot
A model elimination calculus with built-in theories
inferredcites →https://doi.org/10.1016/0890-5401(90)90061-lopenalex-snapshot
Rigid E-unification: NP-completeness and applications to equational matings
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1016/s0747-7171(87)80064-0openalex-snapshot
Theory links: Applications to automated theorem proving
inferredcites →https://doi.org/10.1109/mc.1983.1654200openalex-snapshot
Krypton: A Functional Approach to Knowledge Representation
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321592.321603openalex-snapshot
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness
inferredcites →https://doi.org/10.1145/322248.322249openalex-snapshot
Theorem Proving via General Matings
inferredcites →https://doi.org/10.22028/d291-40498openalex-snapshot
The Markgraf Karl Refutation Procedure

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11916277_34openalex-snapshot
Theory Instantiation
inferred← citeshttps://doi.org/10.1007/3-540-45470-5_27openalex-snapshot
Combining Generic and Domain Specific Reasoning by Using Contexts
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_38openalex-snapshot
Simultaneous rigid E-unification is undecidable
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_4openalex-snapshot
What you always wanted to know about rigid E-unification
inferred← citeshttps://doi.org/10.1007/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bfb0018990openalex-snapshot
A model elimination calculus with built-in theories
inferred← citeshttps://doi.org/10.1007/bfb0021974openalex-snapshot
A unification of ordering refinements of resolution in classical logic
inferred← citeshttps://doi.org/10.1007/s002000050001openalex-snapshot
Special Cases and Substitutes for Rigid E -Unification
inferred← citeshttps://doi.org/10.1007/s10817-019-09533-zopenalex-snapshot
First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00092-8openalex-snapshot
The undecidability of simultaneous rigid E-unification
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50004-7openalex-snapshot
Resolution Theorem Proving
inferred← citeshttps://doi.org/10.1023/a:1005996623714openalex-snapshot
What You Always Wanted to Know about Rigid E-Unification
inferred← citeshttps://doi.org/10.1023/a:1006170514174openalex-snapshot
T-Resolution: Refinements and Model Elimination
inferred← citeshttps://doi.org/10.1023/a:1022587501759openalex-snapshot
Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing
inferred← citeshttps://doi.org/10.1109/lics.1996.561466openalex-snapshot
Simultaneous rigid E-unification and related algorithmic problems
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.