Proof by consistency

Only prime superpositions need be considered in the Knuth-Bendix completion procedure

Journal of Symbolic Computation

Inductive methods for reasoning about abstract data types

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

A Specifier's Introduction to Formal Methods

Computer

Automating inductionless induction using test sets

Journal of Symbolic Computation

Deductive and inductive synthesis of equational programs

Journal of Symbolic Computation - Special issue on automatic programming

Equational inference, canonical proofs, and proof orderings

Journal of the ACM (JACM)

Formal methods: state of the art and future directions

ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research

Coloring Terms to Control Equational Reasoning

Journal of Automated Reasoning

Induction Proofs with Partial Functions

Journal of Automated Reasoning

Deciding the confluence of ordered term rewrite systems

ACM Transactions on Computational Logic (TOCL)

Model building with ordered resolution: extracting models from saturated clause sets

Journal of Symbolic Computation - Special issue: First order theorem proving

Computing with features as formulae

Computational Linguistics

Abstract canonical presentations

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics

Abstract canonical inference

ACM Transactions on Computational Logic (TOCL)

Termination Analysis by Dependency Pairs and Inductive Theorem Proving

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction

Strategic Issues, Problems and Challenges in Inductive Theorem Proving

Electronic Notes in Theoretical Computer Science (ENTCS)

Finite models for formal security proofs

Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)

Proving Termination by Dependency Pairs and Inductive Theorem Proving

Journal of Automated Reasoning

Inductive decidability using implicit induction

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Reasoning about incompletely defined programs

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Coverset induction with partiality and subsorts: a powerlist case study

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving

Reasoning on schemata of formulæ

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics

Completeness and decidability results for first-order clauses with indices

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Finite Reasons for Safety

Journal of Automated Reasoning