Algebraic simplification
From MaRDI portal
canonical simplificationChurch-Rosser propertycomputer algebraGröbner-basesKnuth-Bendix algorithmreduction systemsterm algebras
Software, source code, etc. for problems pertaining to commutative algebra (13-04) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Specification and verification (program logics, model checking, etc.) (68Q60) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)
Cited in
(42)- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
- n-level rewriting systems
- Computer algebra: Past and future
- History and basic features of the critical-pair/completion procedure
- 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)
- 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
- An approach to the zero recognition problem by Buchberger algorithm
- Superposition theorem proving for abelian groups represented as integer modules
- A computational method for determining strong stabilizability of \(n\)-D systems
- Buchberger's algorithm: The term rewriter's point of view
- Some categories associated with bases of the Kalman algebra
- On the descriptive power of term rewriting systems
- Ideal basis and primary decompositions: case of two variables
- Computations in differential and difference modules
- A general framework for Noetherian well ordered polynomial reductions
- The replenishment algorithm in algebras of sets
- Dickson's lemma, Higman's theorem and beyond: a survey of some basic results in order theory
- A separation bound for real algebraic expressions
- Automated simplification of large symbolic expressions
- Algebraic simplification and cryptographic motives.
- Forward analysis for WSTS, part I: completions
- Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems
- Zero-Equivalence in Function Fields Defined by Algebraic Differential Equations
- Term algebras, canonical representations and difference ring theory for symbolic summation
- Simulating Buchberger's algorithm by Knuth-Bendix completion
- AC-complete unification and its application to theorem proving
- Applying term rewriting methods to finite groups
- Buchberger's algorithm: a constraint-based completion procedure
- On pot, pans and pudding or how to discover generalised critical pairs
- A categorical formulation for critical-pair/completion procedures
- A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)
- Comparing generic state machines
- A FAIR file format for mathematical software
- Using geometric rewrite rules for solving geometric problems symbolically
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
- Finite complete rewriting systems and the complexity of word problem
- Compatibility of systems of super differential equations
This page was built for publication: Algebraic simplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3957939)
