Rewrite Closure for Ground and Cancellative AC Theories
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Proving Associative-Communicative Termination Using RPO-Compatible Orderings
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Journal of Automated Reasoning
Canonized rewriting and ground AC completion modulo shostak theories
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Automated Deduction Techniques for Studying Rough Algebras
Fundamenta Informaticae
Integrating linear arithmetic into superposition calculus
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Simplification Orderings: History Of Results
Fundamenta Informaticae
| Hi-index | 0.04 |