On the public citation graph
Buchberger's algorithm: A constraint-based completion procedure
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.
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.1006/jsco.1994.1011openalex-snapshot
A New Method for the Boolean Ring Based Theorem Proving
inferredcites →https://doi.org/10.1007/3-540-50939-9_136openalex-snapshot
Order-sorted completion: The many-sorted way
inferredcites →https://doi.org/10.1007/978-1-4612-0913-3openalex-snapshot
Gröbner Bases: A Computational Approach to Commutative Algebra
inferredcites →https://doi.org/10.1007/978-1-4684-7118-2openalex-snapshot
Canonical Equational Proofs
inferredcites →https://doi.org/10.1007/978-3-662-02328-0_20openalex-snapshot
Term Reduction Systems and Algebraic Algorithms
inferredcites →https://doi.org/10.1007/978-94-009-5225-6_6openalex-snapshot
Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory
inferredcites →https://doi.org/10.1007/bf01190829openalex-snapshot
Refutational theorem proving for hierarchic first-order theories
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(85)80019-5openalex-snapshot
Termination orderings for associative-commutative rewriting systems
inferredcites →https://doi.org/10.1016/s0747-7171(87)80020-2openalex-snapshot
History and basic features of the critical-pair/completion procedure
inferredcites →https://doi.org/10.1016/s0747-7171(88)80020-8openalex-snapshot
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
inferredcites →https://doi.org/10.1093/logcom/4.3.217openalex-snapshot
Rewrite-based Equational Theorem Proving with Selection and Simplification
inferredcites →https://doi.org/10.1109/lics.1994.316050openalex-snapshot
Normalised rewriting and normalised completion
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/1012497.1012521openalex-snapshot
An equational approach to theorem proving in first-order predicate calculus
inferredcites →https://doi.org/10.1145/174652.174655openalex-snapshot
Equational inference, canonical proofs, and proof orderings
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
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.0469openalex-snapshot
A General Framework to Build Contextual Cover Set Induction Provers
inferred← citeshttps://doi.org/10.1007/10721975_16openalex-snapshot
Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/11538363_18openalex-snapshot
An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_64openalex-snapshot
Rewrite systems for natural, integral, and rational arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_65openalex-snapshot
D-bases for polynomial ideals over commutative noetherian rings
inferred← citeshttps://doi.org/10.1007/978-3-0348-8800-4_1openalex-snapshot
Parallel Completion Techniques
inferred← citeshttps://doi.org/10.1007/978-3-0348-8800-4_7openalex-snapshot
String Rewriting and Gröbner Bases — A General Approach to Monoid and Group Rings
inferred← citeshttps://doi.org/10.1007/978-3-0348-8800-4_9openalex-snapshot
Normalized Rewriting: A Unified View of Knuth-Bendix Completion and Gröbner Bases Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-00966-7_1openalex-snapshot
Foundations of Mathematics from the Perspective of Computer Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_48openalex-snapshot
A Nonlinear Real Arithmetic Fragment
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_4openalex-snapshot
Combining Equational Reasoning
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/bfb0014420openalex-snapshot
Combining algebra and universal algebra in first-order theorem proving: The case of commutative rings
inferred← citeshttps://doi.org/10.1007/s10703-016-0245-8openalex-snapshot
A search-based procedure for nonlinear real arithmetic
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00061-5openalex-snapshot
Buchberger's algorithm: The term rewriter's point of view
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.09.004openalex-snapshot
A new symbolic method for solving linear two-point boundary value problems on the level of operators
inferred← citeshttps://doi.org/10.1063/5.0170813openalex-snapshot
Evaluation of memristor behaviour with global logic gates
inferred← citeshttps://doi.org/10.1080/0003681031000118981openalex-snapshot
Solving Linear Boundary Value Problems Via Non-commutative Gröbner Bases
inferred← citeshttps://doi.org/10.1098/rsta.2005.1650openalex-snapshot
The challenge of computer mathematics
inferred← citeshttps://doi.org/10.1109/icicta.2009.835openalex-snapshot
A Numerical Method for Solving Linear Two-Point Boundary Value Problems
inferred← citeshttps://doi.org/10.1109/synasc.2009.59openalex-snapshot
Superfluous S-polynomials in Strategy-Independent Groebner Bases
inferred← citeshttps://doi.org/10.1142/s021819679800034xopenalex-snapshot
Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I
inferred← citeshttps://doi.org/10.1145/1670412.1670418openalex-snapshot
On locally minimal Nullstellensatz proofs
inferred← citeshttps://doi.org/10.4213/dm141openalex-snapshot
Решение системы полиномиальных уравнений над кольцом Галуа - Эйзенштейна с помощью канонической системы образующих полиномиального идеала
inferred← citeshttps://doi.org/10.4230/dagsemproc.10161.3openalex-snapshot
Gröbner Basis Construction Algorithms Based on Theorem Proving Saturation Loops
inferred← citeshttps://doi.org/10.48550/arxiv.2009.12198openalex-snapshot
An Algebraic Approach to Fourier Transformation
inferred← citeshttps://doi.org/10.53846/goediss-2505openalex-snapshot
Reduktionssysteme zur Berechnung einer Auflösung der orthogonalen freien Quantengruppen Ao(n)
inferred← citeshttps://doi.org/10.5802/ccirm.28openalex-snapshot
Formal methods for systems of partial differential equations
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.