… by a finite set of ground axioms plus the associativity and commutativity of any number of
operators must be finite. As a corollary, we show that ground AC-completion, when using a total …

… In this paper, we present a modular extension of ground AC-completion for … way ground
AC-completion with the canonizer and solver present for the theory X. This integration rests on …

… Then, we give the usual set of inference rules for ground AC-completion procedure and we
… A well-founded quasiordering [6] on terms is a reduction quasi-ordering if s ≼ t implies sσ ≼ …

… We revisit AC completion for left-linear term rewrite systems … AC completion can be simulated
by general AC completion. … ] is a ground ES which causes left-linear AC completion to suffer …

… ordering k is total on ground terms and the initial equations are ground, this prevents … AC
completion. Our implementation is not as optimised as RRL and REVEAL hence AC completion …

… In this paper, we present a modular extension of ground AC-completion for deciding for…
, ground AC-completion requires a well-founded reduction quasi-ordering ≼ total on ground …

… Intuitively, UKB imposes a wellfounded ordering on the (ground) term structure rather
than on … UKB, on the other hand, is a refutational method targeted on proving a given (equational) …

… The theories to which we apply extended completion are congruence relations on ground
terms induced by the set PUBU AC plus polynomial equations. We design derived inference …

… ground equations, partly due to the existence of reduction orderings which are total on ground
… Remark: If we compare with the general AC-completion procedure, the critical p~firs we …

… In this paper, we present a modular extension of ground AC-completion for deciding for…
, ground AC-completion requires a well-founded reduction quasi-ordering ≼ total on ground …