On the public citation graph
Elimination of equality via transformation with ordering constraints
0 signed · 23 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-58156-1_57openalex-snapshot
Protein: A PROver with a Theory Extension INterface
inferredcites →https://doi.org/10.1007/3-540-61630-6_4openalex-snapshot
What you always wanted to know about rigid E-unification
inferredcites →https://doi.org/10.1007/3-540-61697-7_4openalex-snapshot
Equality elimination for the tableau method
inferredcites →https://doi.org/10.1007/bf00881952openalex-snapshot
Tableau-based theorem provers: Systems and implementations
inferredcites →https://doi.org/10.1007/bfb0027415openalex-snapshot
Subgoal alternation in model elimination
inferredcites →https://doi.org/10.1137/0204036openalex-snapshot
Proving Theorems with the Modification Method
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11853107_2openalex-snapshot
Automated Reasoning Support for First-Order Ontologies
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-48660-7_9openalex-snapshot
A Framework for the Flexible Integration of a Class of Decision Procedures into Theorem Provers
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_14openalex-snapshot
SCL(EQ): SCL for First-Order Logic with Equality
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_2openalex-snapshot
Superposition with Delayed Unification
inferred← citeshttps://doi.org/10.1007/978-3-642-27503-6_64openalex-snapshot
Research of Semantic Web Model and Reasoning Based on F-Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_1openalex-snapshot
Harald Ganzinger’s Legacy: Contributions to Logics and Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_15openalex-snapshot
Non-cyclic Sorts for First-Order Satisfiability
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_4openalex-snapshot
Equality and Other Theories
inferred← citeshttps://doi.org/10.1007/s10817-007-9089-7openalex-snapshot
Connection Tableaux with Lazy Paramodulation
inferred← citeshttps://doi.org/10.1007/s10817-021-09590-3openalex-snapshot
Craig Interpolation with Clausal First-Order Tableaux
inferred← citeshttps://doi.org/10.1007/s10817-023-09673-3openalex-snapshot
SCL(EQ): SCL for First-Order Logic with Equality
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03001-5openalex-snapshot
Chapter 1 Knowledge Representation and Classical Logic
inferred← citeshttps://doi.org/10.1023/a:1006376231563openalex-snapshot
Ordered Semantic Hyper-Linking
inferred← citeshttps://doi.org/10.1109/lics.1998.705662openalex-snapshot
Herbrand's theorem, automated reasoning and semantic tableaux
inferred← citeshttps://doi.org/10.70675/b8a908cfzea79z4efdza9dezd3589d30dd25openalex-snapshot
Designing an Automated Concurrent Tableau-Based Theorem Prover for First-Order Logic
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.