SAT Techniques for Lexicographic Path Orders
classification
💻 cs.SC
keywords
algorithmsconcernedexperimentalexplainedexpressinglexicographiclogiclpo-termination
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.