Journal of automated reasoning. 1995;14(2):293-316. doi: 10.1007/bf00881859 Q40.72025
A path ordering for proving termination of AC rewrite systems
一种用于证明带有序对的重写系统终止性的路径排序方法
DOI: 10.1007/bf00881859
摘要 查看摘要
Journal of automated reasoning. 1995;14(2):293-316. doi: 10.1007/bf00881859 Q40.72025
DOI: 10.1007/bf00881859
摘要 查看摘要