On the public citation graph

Automated deduction with associative-commutative operators

https://doi.org/10.1007/bf01270929
0 signed · 50 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/inco.1994.1037openalex-snapshot
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
inferredcites →https://doi.org/10.1007/3-540-15976-2_11openalex-snapshot
Associative path orderings
inferredcites →https://doi.org/10.1007/3-540-51081-8_109openalex-snapshot
On how to move mountains ‘associatively and commutatively’
inferredcites →https://doi.org/10.1007/3-540-51081-8_131openalex-snapshot
SbReve2: A term rewriting laboratory with (AC)-unfailing completion
inferredcites →https://doi.org/10.1007/3-540-52885-7_105openalex-snapshot
On restrictions of ordered paramodulation with simplification
inferredcites →https://doi.org/10.1007/3-540-53904-2_112openalex-snapshot
Simulating Buchberger's algorithm by Knuth-Bendix completion
inferredcites →https://doi.org/10.1007/3-540-53904-2_115openalex-snapshot
Any ground associative-commutative theory has a finite canonical system
inferredcites →https://doi.org/10.1007/3-540-54507-7_13openalex-snapshot
Building in equational theories into the connection method
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_15openalex-snapshot
A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering that x 3 = x Implies Ring Commutativity
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/bf00297251openalex-snapshot
Opening the AC-unification race
inferredcites →https://doi.org/10.1016/0167-6423(87)90030-xopenalex-snapshot
Termination of rewriting systems by polynomial interpretations and its implementation
inferredcites →https://doi.org/10.1016/0304-3975(82)90026-3openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1016/0304-3975(89)90003-0openalex-snapshot
Completion for rewriting modulo a congruence
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50028-xopenalex-snapshot
Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
inferredcites →https://doi.org/10.1016/s0747-7171(08)80130-7openalex-snapshot
Using forcing to prove completeness of resolution and paramodulation
inferredcites →https://doi.org/10.1016/s0747-7171(19)80002-0openalex-snapshot
On the Choice of Pencils in the Parametrization of Curves
inferredcites →https://doi.org/10.1016/s0747-7171(19)80003-2openalex-snapshot
A General Refutational Completeness Result for an Inference Procedure Based on Associative-Commutative Unification
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0204036openalex-snapshot
Proving Theorems with the Modification Method
inferredcites →https://doi.org/10.1137/0212006openalex-snapshot
A Technique for Establishing Completeness Results in Theorem Proving with Equality
inferredcites →https://doi.org/10.1137/0215084openalex-snapshot
Completion of a Set of Rules Modulo a Set of Equations
inferredcites →https://doi.org/10.1142/9789812709431_0002openalex-snapshot
Automatic theorem proving
inferredcites →https://doi.org/10.1145/116825.116833openalex-snapshot
Proving refutational completeness of theorem-proving strategies
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.1145/322261.322262openalex-snapshot
A Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.2307/2217468openalex-snapshot
Automatic 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.1996.0074openalex-snapshot
Paramodulation with Built-in AC-Theories and Symbolic Constraints
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.1006/jsco.2002.0537openalex-snapshot
Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)
inferred← citeshttps://doi.org/10.1007/11532231_25openalex-snapshot
On the Complexity of Equational Horn Clauses
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_10openalex-snapshot
Compiling and Verifying Security Protocols
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_16openalex-snapshot
Beyond Parameterized Verification
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/3-540-48660-7_28openalex-snapshot
Invited Talk: Rewrite-Based Deduction and Symbolic Constraints
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_27openalex-snapshot
Algebraic Specifications, Higher-Order Types and Set-Theoretic Models
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_40openalex-snapshot
AC-superposition with constraints: No AC-unifiers needed
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_1openalex-snapshot
Associative-commutative superposition
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_54openalex-snapshot
Positive deduction modulo regular theories
inferred← citeshttps://doi.org/10.1007/bfb0054257openalex-snapshot
Superposition for divisible torsion-free abelian groups
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50009-6openalex-snapshot
Paramodulation-Based Theorem Proving
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00358-9openalex-snapshot
ELAN from a rewriting logic point of view
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00189-6openalex-snapshot
An Assertional Language for the Verification of Systems Parametric in Several Dimensions
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80786-2openalex-snapshot
An Overview of MSR( )
inferred← citeshttps://doi.org/10.1023/b:ause.0000017741.10347.9bopenalex-snapshot
Strategy for Verifying Security Protocols with Unbounded Message Size
inferred← citeshttps://doi.org/10.1093/logcom/exn073openalex-snapshot
Paramodulation with Well-founded Orderings
inferred← citeshttps://doi.org/10.1109/ase.2001.989832openalex-snapshot
A tool for lazy verification of security protocols
inferred← citeshttps://doi.org/10.3233/fi-1998-33105openalex-snapshot
Automated Deduction Techniques for Studying Rough Algebras
inferred← citeshttps://doi.org/10.5281/zenodo.209764openalex-snapshot
FIGURE 5. Mesocoelium burti—NHMUK 1980.11.12 4 in A reevaluation of specimens of Mesocoelium monas (Platyhelminthes: Digenea: Mesocoeliidae) from the Natural History Museum, UK and the United States National Parasite Collection, USA
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93980openalex-snapshot
Automated deduction with built-in theories: completeness results and constraint solving techniques
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.