2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/111070This seminar report is concerned with expressing LPO-termination of term rewrite systems as a satisfiability problem in propositional logic. After relevant algorithms are explained, experimental results are reported.29 pages, Seminar ReportSymbolic Computationtext