On the public citation graph
Superposition for divisible torsion-free abelian groups
0 signed · 21 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.1996.0011openalex-snapshot
Normalized Rewriting: an Alternative to Rewriting modulo a Set of Equations
inferredcites →https://doi.org/10.1007/3-540-60381-6_1openalex-snapshot
Associative-commutative superposition
inferredcites →https://doi.org/10.1007/3-540-61511-3_102openalex-snapshot
Theorem proving in cancellative abelian monoids (extended abstract)
inferredcites →https://doi.org/10.1007/bf01270929openalex-snapshot
Automated deduction with associative-commutative operators
inferredcites →https://doi.org/10.1016/s0020-0190(98)00084-2openalex-snapshot
Extending reduction orderings to ACU-compatible reduction orderings
inferredcites →https://doi.org/10.1016/s0304-3975(98)00082-6openalex-snapshot
Superposition theorem proving for abelian groups represented as integer modules
inferredcites →https://doi.org/10.1093/logcom/4.3.217openalex-snapshot
Rewrite-based Equational Theorem Proving with Selection and Simplification
inferredcites →https://doi.org/10.22028/d291-25751openalex-snapshot
Cancellative abelian monoids in refutational theorem proving
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.2002.0536openalex-snapshot
Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)
inferred← citeshttps://doi.org/10.1007/10721975_16openalex-snapshot
Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_17openalex-snapshot
Superposition and Chaining for Totally Ordered Divisible Abelian Groups
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_9openalex-snapshot
Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_33openalex-snapshot
ALASCA: Reasoning in Quantified Linear Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-23165-5_8openalex-snapshot
On First-Order Model-Based Reasoning
inferred← citeshttps://doi.org/10.1007/s10817-022-09628-0openalex-snapshot
Set of Support, Demodulation, Paramodulation: A Historical Perspective
inferred← citeshttps://doi.org/10.1016/j.ic.2011.03.005openalex-snapshot
Automatic decidability and combinability
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00084-2openalex-snapshot
Extending reduction orderings to ACU-compatible reduction orderings
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00070-1openalex-snapshot
Superposition with completely built-in Abelian groups
inferred← citeshttps://doi.org/10.1109/lics.2000.855788openalex-snapshot
Paramodulation with built-in abelian groups
inferred← citeshttps://doi.org/10.1145/293347.293352openalex-snapshot
Ordered chaining calculi for first-order theories of transitive relations
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.