On the public citation graph
Unnecessary inferences in associative-commutative completion procedures
0 signed · 42 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-09519-5_52openalex-snapshot
A criterion for detecting unnecessary reductions in the construction of Gröbner-bases
inferredcites →https://doi.org/10.1007/3-540-15984-3_293openalex-snapshot
Reducing the complexity of the Knuth-Bendix completion algorithm: A "unification" of different approaches
inferredcites →https://doi.org/10.1007/3-540-15984-3_294openalex-snapshot
A confluence criterion based on the generalised Newman Lemma
inferredcites →https://doi.org/10.1007/3-540-16780-3_140openalex-snapshot
RRL: A rewrite rule laboratory
inferredcites →https://doi.org/10.1007/3-540-51081-8_129openalex-snapshot
Consider only general superpositions in completion procedures
inferredcites →https://doi.org/10.1007/3-540-51081-8_98openalex-snapshot
Complete sets of reductions modulo associativity, commutativity and identity
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/bf00247439openalex-snapshot
Case studies of Z-module reasoning: Proving benchmark theorems from ring theory
inferredcites →https://doi.org/10.1016/0004-3702(77)90012-1openalex-snapshot
Non-resolution theorem proving
inferredcites →https://doi.org/10.1016/0022-0000(81)90002-7openalex-snapshot
A complete proof of correctness of the Knuth-Bendix completion algorithm
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/b978-0-12-046371-8.50013-4openalex-snapshot
Inductive Completion by Ground Proof Transformation
inferredcites →https://doi.org/10.1016/s0019-9958(74)80007-0openalex-snapshot
Machine Intelligence. Vol. 7.
inferredcites →https://doi.org/10.1016/s0747-7171(08)80020-xopenalex-snapshot
Automated proof of ring commutativity problems by algebraic methods
inferredcites →https://doi.org/10.1016/s0747-7171(87)80027-5openalex-snapshot
Complexity of matching problems
inferredcites →https://doi.org/10.1016/s0747-7171(88)80019-1openalex-snapshot
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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/1089338.1089341openalex-snapshot
A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm
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.1145/322261.322262openalex-snapshot
A Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.1145/32439.32481openalex-snapshot
Critical-pair criteria for the Knuth-Bendix completion procedure
inferredcites →https://doi.org/10.21236/ada015846openalex-snapshot
A Complete Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.21236/ada087641openalex-snapshot
A Catalogue of Canonical Term Rewriting Systems.
inferredcites →https://doi.org/10.2307/1969205openalex-snapshot
Structure Theory for Algebraic Algebras of Bounded Degree
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_8openalex-snapshot
Reducibility Constraints in Superposition
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_28openalex-snapshot
Partial Redundancy in Saturation
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_1openalex-snapshot
Harald Ganzinger’s Legacy: Contributions to Logics and Programming
inferred← citeshttps://doi.org/10.1007/bf00881859openalex-snapshot
A path ordering for proving termination of AC rewrite systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00274-6openalex-snapshot
Redundancy criteria for constrained completion
inferred← citeshttps://doi.org/10.1016/0747-7171(92)90007-qopenalex-snapshot
Some experiments with a completion theorem prover
inferred← citeshttps://doi.org/10.1016/0898-1221(94)00218-aopenalex-snapshot
An overview of Rewrite Rule Laboratory (RRL)
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.