On the public citation graph

A complete connection calculus with rigid E-unification

https://doi.org/10.1007/bfb0021970
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-53904-2_93openalex-snapshot
Goal directed strategies for paramodulation
inferredcites →https://doi.org/10.1007/3-540-55602-8_188openalex-snapshot
An improved method for adding equality to free variable semantic tableaux
inferredcites →https://doi.org/10.1007/3-540-56868-9_8openalex-snapshot
Improving transformation systems for general E-unification
inferredcites →https://doi.org/10.1007/3-540-58156-1_60openalex-snapshot
KoMeT
inferredcites →https://doi.org/10.1007/3-540-58467-6_28openalex-snapshot
Rigid unification by completion and rigid paramodulation
inferredcites →https://doi.org/10.1007/978-3-322-90100-2openalex-snapshot
Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-322-90102-6openalex-snapshot
Automated Theorem Proving
inferredcites →https://doi.org/10.1007/bf00244282openalex-snapshot
SETHEO: A high-performance theorem prover
inferredcites →https://doi.org/10.1007/bfb0022569openalex-snapshot
A rule-based algorithm for rigid E-unification
inferredcites →https://doi.org/10.1007/bfb0022576openalex-snapshot
Completeness of the pool calculus with an open built-in theory
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.1137/0204036openalex-snapshot
Proving Theorems with the Modification Method
inferredcites →https://doi.org/10.1145/128749.128754openalex-snapshot
Theorem proving using equational matings and rigid E -unification
inferredcites →https://doi.org/10.1145/321450.321456openalex-snapshot
Mechanical Theorem-Proving by Model Elimination
inferredcites →https://doi.org/10.1145/322248.322249openalex-snapshot
Theorem Proving via General Matings
inferredcites →https://doi.org/10.1515/9783112573426openalex-snapshot
Initial Computability, Algebraic Specifications, and Partial Algebras

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-59338-1_36openalex-snapshot
Specifications of inference rules and their automatic translation
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/3-540-61697-7_4openalex-snapshot
Equality elimination for the tableau method
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/s002000050001openalex-snapshot
Special Cases and Substitutes for Rigid E -Unification
inferred← citeshttps://doi.org/10.1007/s10817-006-9050-1openalex-snapshot
Superposition-based Equality Handling for Analytic Tableaux
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/50012-6openalex-snapshot
Equality Reasoning in Sequent-Based Calculi
inferred← citeshttps://doi.org/10.1023/a:1005934721802openalex-snapshot
Proof Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification
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:1023260415982openalex-snapshot
Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification
inferred← citeshttps://doi.org/10.1109/lics.1996.561466openalex-snapshot
Simultaneous rigid E-unification and related algorithmic problems
inferred← citeshttps://doi.org/10.1109/lics.1998.705663openalex-snapshot
The relation between second-order unification and simultaneous rigid E-unification
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.