On the public citation graph

Unification in finite algebras is unitary(?)

https://doi.org/10.1007/bfb0012844
0 signed · 13 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/bf02328451openalex-snapshot
The theory of idempotent semigroups is of unification type zero
inferredcites →https://doi.org/10.1016/s0747-7171(87)80065-2openalex-snapshot
Embedding boolean expressions into logic programming
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation

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-60045-0_44openalex-snapshot
Toupie=μ-calculus+constraints
inferred← citeshttps://doi.org/10.1007/bf01810294openalex-snapshot
Symbolic constraint handling through unification in finite algebras
inferred← citeshttps://doi.org/10.1007/bfb0013067openalex-snapshot
Unification in a combination of equational theories with shared constants and its application to primal algebras
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50010-2openalex-snapshot
Unification Theory
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80013-6openalex-snapshot
Boolean unification — The story so far
inferred← citeshttps://doi.org/10.1023/a:1005732517165openalex-snapshot
Toupie: The µ-calculus over Finite Domains as a Constraint Language
inferred← citeshttps://doi.org/10.1109/easic.1990.207990openalex-snapshot
Verifying ASICs by symbolic simulation
inferred← citeshttps://doi.org/10.1109/ismvl.2002.1011062openalex-snapshot
Equations in the algebra of logic
inferred← citeshttps://doi.org/10.1609/aimag.v11i1.822openalex-snapshot
Directions in AI research and applications at Siemens corporate research and development
inferred← citeshttps://doi.org/10.3233/fi-2013-870openalex-snapshot
On Language Equations with One-sided Concatenation
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.