On the public citation graph

Unification in a combination of equational theories with shared constants and its application to primal algebras

https://doi.org/10.1007/bfb0013067
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-16780-3_110openalex-snapshot
Unification in combinations of collapse-free theories with disjoint sets of function symbols
inferredcites →https://doi.org/10.1007/3-540-16780-3_111openalex-snapshot
Combination of unification algorithms
inferredcites →https://doi.org/10.1007/3-540-52885-7_95openalex-snapshot
Unification in a combination of equational theories: an efficient algorithm
inferredcites →https://doi.org/10.1007/3-540-55602-8_155openalex-snapshot
Unification in the union of disjoint equational theories: Combining decision procedures
inferredcites →https://doi.org/10.1007/bf01810294openalex-snapshot
Symbolic constraint handling through unification in finite algebras
inferredcites →https://doi.org/10.1007/bfb0012844openalex-snapshot
Unification in finite algebras is unitary(?)
inferredcites →https://doi.org/10.1007/bfb0013067openalex-snapshot
Unification in a combination of equational theories with shared constants and its application to primal algebras
inferredcites →https://doi.org/10.1016/s0747-7171(87)80025-1openalex-snapshot
Unification in combinations of collapse-free regular theories
inferredcites →https://doi.org/10.1016/s0747-7171(89)80013-6openalex-snapshot
Boolean unification — The story so far
inferredcites →https://doi.org/10.1016/s0747-7171(89)80022-7openalex-snapshot
Unification in a combination of arbitrary disjoint equational theories
inferredcites →https://doi.org/10.1145/96559.96569openalex-snapshot
Unification in primal algebras, their powers and their varieties

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1996.0042openalex-snapshot
Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_3openalex-snapshot
Combining Constraint Solving
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_22openalex-snapshot
A Tableau Calculus for Combining Non-disjoint Theories
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_14openalex-snapshot
Deciding the Word Problem in the Union of Equational Theories Sharing Constructors
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_39openalex-snapshot
More problems in rewriting
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_141openalex-snapshot
Combination of matching algorithms
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_19openalex-snapshot
Combination techniques for non-disjoint equational theories
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_69openalex-snapshot
Combination of constraint solving techniques: An algebraic point of view
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_82openalex-snapshot
Problems in rewriting III
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_23openalex-snapshot
On the combination of symbolic constraints, solution domains, and constraint solvers
inferred← citeshttps://doi.org/10.1007/978-3-030-86205-3_2openalex-snapshot
Non-disjoint Combined Unification and Closure by Equational Paramodulation
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_17openalex-snapshot
Matching in a Class of Combined Non-disjoint Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-38574-2_17openalex-snapshot
Hierarchical Combination
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_5openalex-snapshot
A New Correctness Proof of the Nelson-Oppen Combination Procedure
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_6openalex-snapshot
Cooperation of Decision Procedures for the Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/bfb0052380openalex-snapshot
An on-line problem database
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00332-2openalex-snapshot
Unions of non-disjoint theories and combinations of satisfiability procedures
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00147-3openalex-snapshot
Combination of constraint solvers for free and quasi-free structures
inferred← citeshttps://doi.org/10.29007/vb87openalex-snapshot
Hierarchical Combination of Unication Algorithms (Extended Abstract)
showing the first 19 of 20 · page through all 20
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.