Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
# | Year | Title | Type | |||||
---|---|---|---|---|---|---|---|---|
1 |
| |||||||
1 |
| |||||||
6 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
8 |
| |||||||
1994 | A Refined Version of General E-Unification In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 665-677 | Proceedings Article | ||||||
1993 | Unification in Order-Sorted Logic with Term Declarations In: Proceedings of the 4th Conference on Logic Programming and Automated Reasoning (LPAR-93), 301-308 | Proceedings Article | ||||||
1992 | A Goal Oriented Strategy Based on Completion In: Proc.~3rd Intern.~Conference on Algebraic and Logic Programming, 435-445 | Proceedings Article | ||||||
1992 | How to Avoid the Derivation of Redundant Clauses in Reasoning Systems In: Journal of Automated Reasoning [9], 325-336 | Journal Article | ||||||
1991 | Boolean Algebra Admits no Convergent Term Rewriting System In: Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA-91), 264-274 | Proceedings Article | ||||||
1991 | On the Church-Rosser Property in Left-Linear Systems | Report | ||||||
1991 | On the Relation Between Completion Based and Resolution Based Theorem Proving In: Journal of Symbolic Computation [11], 129-148 | Journal Article | ||||||
1991 | Optimizing the Clausal Normal Form Transformation In: Journal of Automated Reasoning [7], 325-336 | Journal Article | ||||||
14 |
| |||||||
1 |
|