Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Author/Editor | Title | Type | |||||
---|---|---|---|---|---|---|---|
| |||||||
[1] | J. Avenhaus, T. Hillenbrand and B. Löchner | On Using Ground Joinable Equations in Equational Theorem Proving In: Journal of Symbolic Computation [36], 217-233 | Journal Article | ||||
[2] | K. Korovin and A. Voronkov | Knuth-Bendix constraint solving is NP-complete In: ACM Transactions on Computational Logic [6], 361-388 | Journal Article | ||||
[3] | K. Korovin and A. Voronkov | Orienting rewrite rules with the Knuth-Bendix order In: Information and Computation [183], 165-186 | Journal Article | ||||
[4] | B. Löchner and T. Hillenbrand | A Phytography of WALDMEISTER In: AI Communications [15], 127-133 | Journal Article | ||||
| |||||||
| |||||||
|