On the public citation graph

Unification in Boolean rings

https://doi.org/10.1007/bf00297246
0 signed · 37 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_111openalex-snapshot
Combination of unification algorithms
inferredcites →https://doi.org/10.1007/3-540-16780-3_115openalex-snapshot
Unification in boolean rings
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_1openalex-snapshot
Universal Unification
inferredcites →https://doi.org/10.1007/978-1-4684-9452-5openalex-snapshot
Mathematical Logic
inferredcites →https://doi.org/10.1007/978-94-010-3072-4openalex-snapshot
Logical Writings
inferredcites →https://doi.org/10.1007/bfb0036919openalex-snapshot
Rewrite methods for clausal and non-clausal theorem proving
inferredcites →https://doi.org/10.1016/0004-3702(85)90074-8openalex-snapshot
Refutational theorem proving using term-rewriting systems
inferredcites →https://doi.org/10.1016/s0747-7171(87)80065-2openalex-snapshot
Embedding boolean expressions into logic programming
inferredcites →https://doi.org/10.1080/00029890.1980.11995092openalex-snapshot
Computer-Implemented Set Theory
inferredcites →https://doi.org/10.1109/tc.1986.1676783openalex-snapshot
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
inferredcites →https://doi.org/10.1112/blms/2.2.242openalex-snapshot
NON COMMUTATIVE RINGS (CARUS MATHEMATICAL MONOGRAPHS NO. 15)
inferredcites →https://doi.org/10.1145/1012497.1012521openalex-snapshot
An equational approach to theorem proving in first-order predicate calculus
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.5948/upo9781614440154openalex-snapshot
Noncommutative Rings

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.1999.2855openalex-snapshot
Unification Algorithms Cannot Be Combined in Polynomial Time
inferred← citeshttps://doi.org/10.1007/3-540-16780-3openalex-snapshot
8th International Conference on Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-319-66167-4_19openalex-snapshot
The Boolean Solution Problem from the Perspective of Predicate Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_8openalex-snapshot
A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-94-017-0437-3_12openalex-snapshot
Rewrite Based Hardware Verification with Redux
inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_10openalex-snapshot
Hyperidentities
inferred← citeshttps://doi.org/10.1007/bf01057655openalex-snapshot
Hybrid terms and sentences
inferred← citeshttps://doi.org/10.1007/bf02733227openalex-snapshot
Unification problem in equational theories
inferred← citeshttps://doi.org/10.1007/s10817-018-9465-5openalex-snapshot
Introduction to Milestones in Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90011-6openalex-snapshot
Unification in free distributive lattices
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50010-2openalex-snapshot
Unification Theory
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00106-9openalex-snapshot
On the complexity of Boolean unification
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80013-6openalex-snapshot
Boolean unification — The story so far
inferred← citeshttps://doi.org/10.1017/s1471068406002730openalex-snapshot
Set unification
inferred← citeshttps://doi.org/10.1093/jigpal/jzr026openalex-snapshot
Unification and projectivity in Fregean varieties
inferred← citeshttps://doi.org/10.1093/logcom/exv059openalex-snapshot
Boolean unification with predicates
inferred← citeshttps://doi.org/10.1093/logcom/exz033openalex-snapshot
Decidability of affine solution problems
inferred← citeshttps://doi.org/10.1109/eurdac.1993.410660openalex-snapshot
Boolean matching based on Boolean unification
inferred← citeshttps://doi.org/10.1109/iccad.1991.185175openalex-snapshot
A cell-replicating approach to minicut-based circuit partitioning
inferred← citeshttps://doi.org/10.1109/iccad.1991.185318openalex-snapshot
Application of Boolean unification to combinational logic synthesis
inferred← citeshttps://doi.org/10.1145/298514.298582openalex-snapshot
Constraint query languages (preliminary report)
inferred← citeshttps://doi.org/10.1145/3779416openalex-snapshot
An Abstract Fixed-Point Theorem for Horn Formula Equations
inferred← citeshttps://doi.org/10.1145/96559.96569openalex-snapshot
Unification in primal algebras, their powers and their varieties
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.