On the public citation graph

Combination problems for commutative/monoidal theories or how algebra can help in equational unification

https://doi.org/10.1007/bf01195536
0 signed · 39 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.1006/jsco.1996.0009openalex-snapshot
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures
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_118openalex-snapshot
Unification in monoidal theories
inferredcites →https://doi.org/10.1007/3-540-53904-2_91openalex-snapshot
Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unification
inferredcites →https://doi.org/10.1007/978-1-4684-7118-2openalex-snapshot
Canonical Equational Proofs
inferredcites →https://doi.org/10.1007/bf00244275openalex-snapshot
Automated deduction by theory resolution
inferredcites →https://doi.org/10.1007/bf00249020openalex-snapshot
The unification hierarchy is undecidable
inferredcites →https://doi.org/10.1007/bfb0018357openalex-snapshot
Unification properties of commutative theories: A categorical treatment
inferredcites →https://doi.org/10.1016/0304-3975(89)90004-2openalex-snapshot
Complete sets of transformations for general E-unification
inferredcites →https://doi.org/10.1016/0743-1066(84)90010-4openalex-snapshot
A theory of complete logic programs with equality
inferredcites →https://doi.org/10.1016/s0747-7171(89)80014-8openalex-snapshot
Basic narrowing revisited
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.1016/s0747-7171(89)80055-0openalex-snapshot
Unification in commutative theories
inferredcites →https://doi.org/10.1093/oso/9780198537458.001.0001openalex-snapshot
Handbook of Logic in Artificial Intelligence and Logic Programming
inferredcites →https://doi.org/10.1109/lics.1990.113753openalex-snapshot
Syntactic theories and unification
inferredcites →https://doi.org/10.1109/lics.1992.185538openalex-snapshot
Decidable problems in shallow equational theories
inferredcites →https://doi.org/10.1109/lics.1993.287606openalex-snapshot
Proceedings of 8th Annual IEEE Symposium on Logic in Computer Science
inferredcites →https://doi.org/10.1109/lics.1996openalex-snapshot
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
inferredcites →https://doi.org/10.1137/0215084openalex-snapshot
Completion of a Set of Rules Modulo a Set of Equations
inferredcites →https://doi.org/10.1145/174130.174133openalex-snapshot
Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
inferredcites →https://doi.org/10.1145/321850.321858openalex-snapshot
A Human Oriented Logic for Automatic Theorem-Proving
inferredcites →https://doi.org/10.1145/321850.321859openalex-snapshot
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.22028/d291-24991openalex-snapshot
Unification in monoidal theories is solving linear equations over semirings
inferredcites →https://doi.org/10.2307/2269810openalex-snapshot
Algebraic semantics for modal logics II
inferredcites →https://doi.org/10.2307/2270619openalex-snapshot
Algebraic semantics for modal logics I

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.2000.0426openalex-snapshot
Unification of Concept Terms in Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-030-22102-7_1openalex-snapshot
A Tour of Franz Baader’s Contributions to Knowledge Representation and Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-030-22102-7_23openalex-snapshot
Asymmetric Unification and Disunification
inferred← citeshttps://doi.org/10.1007/978-3-030-86205-3_5openalex-snapshot
Restricted Unification in the DL $$\mathcal {FL}_0$$
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_7openalex-snapshot
Deciding Knowledge in Security Protocols Under Equational Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_16openalex-snapshot
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
inferred← citeshttps://doi.org/10.1007/s10817-010-9208-8openalex-snapshot
Decidability and Combination Results for Two Notions of Knowledge in Security Protocols
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50010-2openalex-snapshot
Unification Theory
inferred← citeshttps://doi.org/10.1016/j.ic.2007.07.005openalex-snapshot
Symbolic protocol analysis for monoidal equational theories
inferred← citeshttps://doi.org/10.1109/ifcsta.2009.206openalex-snapshot
A New Algorithm for Solving the Intruder Deduction Problem
inferred← citeshttps://doi.org/10.1145/3776644openalex-snapshot
Let Generalization, Polymorphic Recursion, and Variable Minimization in Boolean-Kinded Type Systems
inferred← citeshttps://doi.org/10.2178/jsl/1096901773openalex-snapshot
Filtering unification and most general unifiers in modal 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.