Z-module reasoning: an equality-oriented proving method with built-in ring axioms

Associative path orderings

Proc. of the first international conference on Rewriting techniques and applications

Equality-based binary resolution

Journal of the ACM (JACM)

Automated deduction by theory resolution

Journal of Automated Reasoning

Some experiments in nonassociative ring theory with an automated theorem prover

Journal of Automated Reasoning

History and basic features of the critical-pair/completion procedure

Journal of Symbolic Computation

Termination of rewriting

Journal of Symbolic Computation

Case studies of Z-module reasoning: Proving benchmark theorems from ring theory

Journal of Automated Reasoning

Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Automated reasoning: 33 BASIC research problems

Automated reasoning: 33 BASIC research problems

Horn equational theories and paramodulation

Journal of Automated Reasoning

Solving open problems in right alternative rings with Z-module reasoning

Journal of Automated Reasoning

Consider only general superpositions in completion procedures

RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)

The Concept of Demodulation in Theorem Proving

Journal of the ACM (JACM)

Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets

Journal of the ACM (JACM)

Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)

Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)

Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)

A Unification Algorithm for Associative-Commutative Functions

Journal of the ACM (JACM)

Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving

Rewrite Methods for Clausal and Non-Clausal Theorem Proving

Proceedings of the 10th Colloquium on Automata, Languages and Programming

Variable Elimination and Chaining in a Resolution-based Prover for Inequalities

Proceedings of the 5th Conference on Automated Deduction

Universal Unification

Proceedings of the 7th International Conference on Automated Deduction

A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity

Proceedings of the 7th International Conference on Automated Deduction

RRL: A Rewrite Rule Laboratory

Proceedings of the 8th International Conference on Automated Deduction

Elements of Z-Module Reasoning

Proceedings of the 9th International Conference on Automated Deduction