On the public citation graph
A model elimination calculus with built-in theories
0 signed · 36 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.1006/jsco.1993.1058openalex-snapshot
Consolution as a Framework for Comparing Calculi
inferredcites →https://doi.org/10.1007/978-1-4612-2360-3openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-1-4684-0357-2openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-642-71385-9_23openalex-snapshot
The Semantic Clause Graph Procedure — A First Overview
inferredcites →https://doi.org/10.1007/bf00244275openalex-snapshot
Automated deduction by theory resolution
inferredcites →https://doi.org/10.1007/bf00244282openalex-snapshot
SETHEO: A high-performance theorem prover
inferredcites →https://doi.org/10.1007/bf00248322openalex-snapshot
Horn equational theories and paramodulation
inferredcites →https://doi.org/10.1007/bf00381143openalex-snapshot
Link inheritance in abstract clause graphs
inferredcites →https://doi.org/10.1007/bfb0013054openalex-snapshot
An ordered theory resolution calculus
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/b978-0-934613-53-8.50024-8openalex-snapshot
AN ESSENTIAL HYBRID REASONING SYSTEM: KNOWLEDGE AND SYMBOL LEVEL ACCOUNTS OF KRYPTON
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)80064-0openalex-snapshot
Theory links: Applications to automated theorem proving
inferredcites →https://doi.org/10.1145/321450.321456openalex-snapshot
Mechanical Theorem-Proving by Model Elimination
inferredcites →https://doi.org/10.1145/321592.321603openalex-snapshot
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness
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-57802-1_8openalex-snapshot
Theory reasoning in first order calculi
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_57openalex-snapshot
Protein: A PROver with a Theory Extension INterface
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_7openalex-snapshot
Model elimination without contrapositives
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_7openalex-snapshot
Incremental theory reasoning methods for semantic tableaux
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/978-94-017-1754-0_4openalex-snapshot
Equality and Other Theories
inferred← citeshttps://doi.org/10.1007/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bf00881948openalex-snapshot
Model elimination without contrapositives and its application to PTTP
inferred← citeshttps://doi.org/10.1007/bfb0013054openalex-snapshot
An ordered theory resolution calculus
inferred← citeshttps://doi.org/10.1007/bfb0027413openalex-snapshot
Ordered tableaux: Extensions and applications
inferred← citeshttps://doi.org/10.1007/bfb0027424openalex-snapshot
A framework for using knowledge in tableau proofs
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/s0004-3702(96)00042-2openalex-snapshot
Computing answers with model elimination
inferred← citeshttps://doi.org/10.1023/a:1006170514174openalex-snapshot
T-Resolution: Refinements and Model Elimination
inferred← citeshttps://doi.org/10.25561/95244openalex-snapshot
A unified compilation style labelled deductive system for modal and substructural logic using natural deduction
inferred← citeshttps://doi.org/10.70675/b8a908cfzea79z4efdza9dezd3589d30dd25openalex-snapshot
Designing an Automated Concurrent Tableau-Based Theorem Prover for First-Order Logic
showing the first 16 of 17 · page through all 17
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.