New decision algorithms for finitely presented commutative semigroups
From MaRDI portal
Publication:1147232
Cites work
- scientific article; zbMATH DE number 3672279 (Why is no real title available?)
- scientific article; zbMATH DE number 3672369 (Why is no real title available?)
- scientific article; zbMATH DE number 3704013 (Why is no real title available?)
- scientific article; zbMATH DE number 3582425 (Why is no real title available?)
- scientific article; zbMATH DE number 3216273 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- scientific article; zbMATH DE number 3065870 (Why is no real title available?)
- A Decision Problem for Transformations of Trees
- Constructions in Algebra
- New decision algorithms for finitely presented commutative semigroups
- On theories with a combinatorial definition of 'equivalence'
- Some algorithmic problems for finitely defined commutative semigroups
- The Isomorphism Problem for Some Classes of Multiplicative Systems
Cited in
(37)- On equational theories, unification, and (un)decidability
- Refutational theorem proving using term-rewriting systems
- New decision algorithms for finitely presented commutative semigroups
- Any ground associative-commutative theory has a finite canonical system
- Conditional congruence closure over uninterpreted and interpreted symbols
- Termination and completion modulo associativity, commutativity and identity
- A Noetherian and confluent rewrite system for idempotent semigroups
- Complexity of matching problems
- Cancellativity in finitely presented semigroups
- Generalized Gröbner bases: Theory and applications. A condensation
- Free products with amalgamation of monoids
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- Complete semi-Thue systems for abelian groups
- Complete sets of unifiers and matchers in equational theories
- Completion for rewriting modulo a congruence
- Equational completion in order-sorted algebras
- scientific article; zbMATH DE number 3861446 (Why is no real title available?)
- Word problems over traces which are solvable in linear time
- Commutative monoids have complete presentations by free (non-commutative) monoids
- Efficient solution of the word problem in slim varieties
- Reductions in tree replacement systems
- Orderings for term-rewriting systems
- Buchberger's algorithm: The term rewriter's point of view
- Hilbert's tenth problem is of unification type zero
- Unification in permutative equational theories is undecidable
- On the Knuth-Bendix completion for concurrent processes
- History and basic features of the critical-pair/completion procedure
- Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties
- Automatic inductive theorem proving using Prolog
- Paramodulated connection graphs
- Identities common to four Abelian group operations with zero
- Residual finiteness in permutation varieties of semigroups
- Termination of rewriting
- Proofs by induction in equational theories with constructors
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- On deciding confluence of finite string-rewriting systems modulo partial commutativity
- Unification in a combination of arbitrary disjoint equational theories
This page was built for publication: New decision algorithms for finitely presented commutative semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1147232)
