SAT Techniques for Lexicographic Path Orders
<|reference_start|>SAT Techniques for Lexicographic Path Orders: 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.<|reference_end|>
@article{zankl2006sat,
    title={SAT Techniques for Lexicographic Path Orders},
    author={Harald Zankl},
    journal={arXiv preprint arXiv:cs/0605021},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0605021},
    primaryClass={cs.SC}
}