Automated deduction by theory resolution
Journal of Automated Reasoning
Associative-commutative unification
Journal of Symbolic Computation
A many-sorted calculus based on resolution and paramodulation
A many-sorted calculus based on resolution and paramodulation
Automated reasoning: 33 BASIC research problems
Automated reasoning: 33 BASIC research problems
A Prolog technology theorem prover: implementation by an extended Prolog computer
Journal of Automated Reasoning
The substitutional framework for sorted deduction: fundamental results on hybrid reasoning
Artificial Intelligence - Special issue on knowledge representation
A Prolog technology theorem prover: a new exposition and implementation in Prolog
Theoretical Computer Science - Selected papers on theoretical issues of design and implementation of symbolic computation systems
Empirical explorations with the logic theory machine: a case study in heuristics
Computers & thought
Term rewriting and all that
A Simplified Format for the Model Elimination Theorem-Proving Procedure
Journal of the ACM (JACM)
Z-Resolution: Theorem-Proving with Compiled Axioms
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)
A Deductive Approach to Program Synthesis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Experiments with a deductive question-answering program
Communications of the ACM
Term Indexing
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Solution of the Robbins Problem
Journal of Automated Reasoning
A Milestone Reached and a Secret Revealed
Journal of Automated Reasoning
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Goal Directed Strategies for Paramodulation
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Experiments in Automated Deduction with Condensed Detachment
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Deductive Composition of Astronomical Software from Subroutine Libraries
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Handbook of automated reasoning
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Knowledge Representation and Reasoning
Knowledge Representation and Reasoning
Logic-based subsumption architecture
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Connection Tableaux with Lazy Paramodulation
Journal of Automated Reasoning
Iterative-deepening-A: an optimal admissible tree search
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
An analysis of consecutively bounded depth-first search with applications in automated deduction
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Whatever happened to deductive question answering?
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
| Hi-index | 0.00 |
This talk discusses some of the challenges of building a usable theorem prover. These include the chasm between theory and code, conflicting requirements, feature interaction, and competitive performance. The talk draws on the speaker's experiences with devising extensions of resolution and building theorem provers that have been used as embedded reasoners in various systems.