Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
# | Year | Title | Type | |||||
---|---|---|---|---|---|---|---|---|
1 |
| |||||||
3 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
9 |
| |||||||
2 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
2 |
| |||||||
4 |
| |||||||
2 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
2 |
| |||||||
1 |
| |||||||
2 |
| |||||||
3 |
| |||||||
2 |
| |||||||
1996 | Theorem Proving in Cancellative Abelian Monoids (Extended Abstract) In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 388-402 | Proceedings Article | ||||||
1992 | Termination Proofs of Well-Moded Logic Programs Via Conditional Rewrite Systems In: Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems '92, 430-437 | Proceedings Article | ||||||
3 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
|