2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/31218We show the NP-completeness of the existential theory of term algebras with the Knuth-Bendix order by giving a nondeterministic polynomial-time algorithm for solving Knuth-Bendix ordering constraints.27 pagesLogic in Computer ScienceF.4.1text