scientific article
From MaRDI portal
Publication:3957939
zbMath0494.68045MaRDI QIDQ3957939
No author found.
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computer algebraKnuth-Bendix algorithmcanonical simplificationChurch-Rosser propertyreduction systemsterm algebrasGröbner-bases
Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Specification and verification (program logics, model checking, etc.) (68Q60) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Algorithms in computer science (68W99)
Related Items
A categorical formulation for critical-pair/completion procedures, n-level rewriting systems, Algebraic simplification and cryptographic motives., Simulating Buchberger's algorithm by Knuth-Bendix completion, AC-complete unification and its application to theorem proving, Buchberger's algorithm: The term rewriter's point of view, Computer algebra: Past and future, History and basic features of the critical-pair/completion procedure, A separation bound for real algebraic expressions, Computing a Gröbner basis of a polynomial ideal over a Euclidean domain, Unsolvable algorithmic problems for semigroups, groups and rings, Lifting canonical algorithms from a ring R to the ring R[x], Shirshov composition techniques in Lie superalgebras (noncommutative Gröbner bases), Applying term rewriting methods to finite groups, Buchberger's algorithm: A constraint-based completion procedure, A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs), Automated simplification of large symbolic expressions, Compatibility of systems of super differential equations, Dickson's lemma, Higman's theorem and beyond: a survey of some basic results in order theory, When is an extension of a specification consistent? Decidable and undecidable cases, Normal forms for a class of formulas, An algorithm for solving parametric linear systems, Using geometric rewrite rules for solving geometric problems symbolically, An approach to the zero recognition problem by Buchberger algorithm, A general framework for Noetherian well ordered polynomial reductions, Some categories associated with bases of the Kalman algebra, Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems, Zero-Equivalence in Function Fields Defined by Algebraic Differential Equations, On pot, pans and pudding or how to discover generalised critical Pairs, Forward analysis for WSTS, part I: completions, The replenishment algorithm in algebras of sets, On the descriptive power of term rewriting systems, Superposition theorem proving for abelian groups represented as integer modules, Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group, Ideal basis and primary decompositions: case of two variables, Computations in differential and difference modules, A computational method for determining strong stabilizability of \(n\)-D systems, Finite complete rewriting systems and the complexity of word problem, Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation, Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
