2006/05/05 by Harald Zankl, Zankl, Harald
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Symbolic Computation (cs.SC)
paper · pdf · doi:10.48550/arxiv.cs/0605021
openalex publication_date 2006/05/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This 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.