Book Chapter
Learning domain knowledge to improve theorem proving
Jörg Denzinger and Stephan Schulz
Lecture Notes in Computer Science, 1996, Volume 1104, Automated Deduction — Cade-13, Pages 62-76
Book Chapter
Paramodulation, superposition, and simplification
Leo Bachmair
Lecture Notes in Computer Science, 1997, Volume 1289, Computational Logic and Proof Theory, Pages 1-3
Journal Article
Automatic program verification I: A logical basis and its implementation
Shigeru Igarashi, Ralph L. London and David C. Luckham
Acta Informatica, 1974, Volume 4, Number 2, Pages 145-182
Book Chapter
Fundamental data structures and algorithms
L. P. Deutsch
Lecture Notes in Computer Science, 1995, Volume 1053, Term Indexing, Pages 27-41
Book Chapter
Flexible proof-replay with heuristics
Marc Fuchs
Lecture Notes in Computer Science, 1997, Volume 1323, Progress in Artificial Intelligence, Pages 1-12
Book Chapter
A master-slave approach to parallel term rewriting on a hierarchical multiprocessor
Reinhard Bündgen, Manfred Göbel and Wolfgang Küchlin
Lecture Notes in Computer Science, 1996, Volume 1128, Design and Implementation of Symbolic Computation Systems, Pages 183-194
Book Chapter
A mizar mode for HOL
John Harrison
Lecture Notes in Computer Science, 1996, Volume 1125, Theorem Proving in Higher Order Logics, Pages 203-220
Book Chapter
Presenting intuitive deductions via symmetric simplification
Frank Pfenning and Dan Nesmith
Lecture Notes in Computer Science, 1990, Volume 449, 10th International Conference on Automated Deduction, Pages 336-350
Book Chapter
Simulation of SOS definitions with term rewriting systems
Karl-Heinz Buth
Lecture Notes in Computer Science, 1994, Volume 788, Programming Languages and Systems — ESOP '94, Pages 150-164
Book Chapter
Living Books, Automated Deduction and Other Strange Things
Peter Baumgartner and Ulrich Furbach
Lecture Notes in Computer Science, 2005, Volume 2605, Mechanizing Mathematical Reasoning, Pages 249-267