On the public citation graph
Completeness of the pool calculus with an open built-in theory
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/3-540-52885-7_87openalex-snapshot
A resolution principle for clauses with constraints
inferredcites →https://doi.org/10.1007/3-540-53162-9_30openalex-snapshot
Multi-modal logic programming using equational and order-sorted logic
inferredcites →https://doi.org/10.1007/bf00244275openalex-snapshot
Automated deduction by theory resolution
inferredcites →https://doi.org/10.1016/0004-3702(91)90009-9openalex-snapshot
The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning
inferredcites →https://doi.org/10.1016/0304-3975(92)90290-vopenalex-snapshot
Multimodal logic programming using equational and order-sorted logic
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/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/128749.128754openalex-snapshot
Theorem proving using equational matings and rigid E -unification
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.1006/jsco.1999.0365openalex-snapshot
Connection Calculus Theorem Proving with Multiple Built-in Theories
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_16openalex-snapshot
A Confluent Theory Connection Calculus
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-59338-1_36openalex-snapshot
Specifications of inference rules and their automatic translation
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_7openalex-snapshot
Specifications of Inference Rules: Extensions of the PTTP Technique
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/bfb0021970openalex-snapshot
A complete connection calculus with rigid E-unification
inferred← citeshttps://doi.org/10.1023/a:1006170514174openalex-snapshot
T-Resolution: Refinements and Model Elimination
inferred← citeshttps://doi.org/10.12775/llp.1998.005openalex-snapshot
Theorem proving with built-in hybrid theories
inferred← citeshttps://doi.org/10.12775/llp.2000.009openalex-snapshot
On the practical value of Herbrand disjunctions
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.