Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Year | Title | BibTeX cite key | |||||
---|---|---|---|---|---|---|---|
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
2005 | Knuth-Bendix constraint solving is NP-complete In: ACM Transactions on Computational Logic [6], 361-388 | KorovinVoronkov:TOCL:2004 | |||||
2003 | AC-compatible Knuth-Bendix Order In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 47-59 | KorovinVoronkov:CADE03:ACKBO | |||||
2003 | Orienting Equalities with the Knuth-Bendix Order In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 75-84 | KorovinVoronkov:LICS03:EqOrientability | |||||
2003 | Orienting rewrite rules with the Knuth-Bendix order In: Information and Computation [183], 165-186 | KorovinVoronkov:IC:2003 | |||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
|