We generalize a termination theorem in term rewriting, based on an abstract commutation technique, to rewriting modulo equations. This result is applied in the setting of process algebra with iteration
Rewriting with associativity, commutativity and identity has been an open problem for a long time. I...
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noet...
Prex iteration x is added to Basic Process Algebra with deadlock and empty process. We present a ni...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
AbstractWe generalize a termination theorem in term rewriting, based on an abstract commutation tech...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, ...
AbstractWe generalize a termination theorem in term rewriting, based on an abstract commutation tech...
Five algebraic notions of termination are formalised, analysed and compared: well-foundedness or Noe...
Five algebraic notions of termination are formalised, analysed and compared: well-foundedness or Noe...
Rewriting with rules R modulo axioms E is a widely used technique in both rule-based programming lan...
AbstractTermination is a non-modular property of rewriting systems, thus it is a difficult task to d...
Rewriting with associativity, commutativity and identity has been an open problem for a long time. I...
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noet...
Prex iteration x is added to Basic Process Algebra with deadlock and empty process. We present a ni...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, t...
AbstractWe generalize a termination theorem in term rewriting, based on an abstract commutation tech...
We generalize a termination theorem in term rewriting, based on an abstract commutation technique, ...
AbstractWe generalize a termination theorem in term rewriting, based on an abstract commutation tech...
Five algebraic notions of termination are formalised, analysed and compared: well-foundedness or Noe...
Five algebraic notions of termination are formalised, analysed and compared: well-foundedness or Noe...
Rewriting with rules R modulo axioms E is a widely used technique in both rule-based programming lan...
AbstractTermination is a non-modular property of rewriting systems, thus it is a difficult task to d...
Rewriting with associativity, commutativity and identity has been an open problem for a long time. I...
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noet...
Prex iteration x is added to Basic Process Algebra with deadlock and empty process. We present a ni...
DOI
Add to ORKG