SAT Techniques for Lexicographic Path Orders
符号计算
2007-05-23 v1
摘要
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.
引用
@article{arxiv.cs/0605021,
title = {SAT Techniques for Lexicographic Path Orders},
author = {Harald Zankl},
journal= {arXiv preprint arXiv:cs/0605021},
year = {2007}
}
备注
29 pages, Seminar Report