On the Completeness of Arbitrary Selection Strategies for Paramodulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Invited Talk: Rewrite-based Deduction and Symbolic Constraints
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Paramodulation with Built-In Abelian Groups
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Superposition with completely built-in Abelian groups
Journal of Symbolic Computation
Classes of term rewrite systems with polynomial confluence problems
ACM Transactions on Computational Logic (TOCL)
Permutative rewriting and unification
Information and Computation
Determining unify-stable presentations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Faster basic syntactic mutation with sorts for some separable equational theories
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Solving first order formulae of pseudo-regular theory
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |