Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
# | Year | Title | Type | |||||
---|---|---|---|---|---|---|---|---|
1 |
| |||||||
3 |
| |||||||
2 |
| |||||||
1 |
| |||||||
1 |
| |||||||
4 |
| |||||||
2005 | Knuth-Bendix constraint solving is NP-complete In: ACM Transactions on Computational Logic [6], 361-388 | Journal Article | ||||||
2003 | AC-compatible Knuth-Bendix Order In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 47-59 | Proceedings Article | ||||||
2003 | Orienting Equalities with the Knuth-Bendix Order In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 75-84 | Proceedings Article | ||||||
2003 | Orienting rewrite rules with the Knuth-Bendix order In: Information and Computation [183], 165-186 | Journal Article | ||||||
4 |
| |||||||
1 |
| |||||||
14 |
| |||||||
1 |
| |||||||
1 |
| |||||||
2 |
| |||||||
2 |
| |||||||
2 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
3 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
6 |
|