First-order logic and automated theorem proving
First-order logic and automated theorem proving
Goal directed strategies for paramodulation
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
Simple LPO constraint solving methods
Information Processing Letters
Information and Computation
Paramodulation with built-in AC-theories and symbolic constraints
Journal of Symbolic Computation
Shostak's Congruence Closure as Completion
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Theorem Proving modulo Associativity
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Abstract Congruence Closure and Specializations
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Complexity Analysis Based on Ordered Resolution
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Towards unconditional soundness: computationally complete symbolic attacker
POST'12 Proceedings of the First international conference on Principles of Security and Trust
| Hi-index | 0.00 |