Self-adjusting binary search trees
Journal of the ACM (JACM)
Automatic acquisition of search control knowledge from multiple proof attempts
Information and Computation
Otter - The CADE-13 Competition Incarnations
Journal of Automated Reasoning
Solution of the Robbins Problem
Journal of Automated Reasoning
Validation of Cryptographic Protocols by Efficient Automated Testing
Proceedings of the Thirteenth International Florida Artificial Intelligence Research Society Conference
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Learning Domain Knowledge to Improve Theorem Proving
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Experiments in the Heuristic Use of Past Proof Experience
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Automatic Verification of Cryptographic Protocols with SETHEO
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Integration of Automated and Interactive Theorem Proving in ILP
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
SETHEO Goes Software Engineering: Application of ATP to Software Reuse
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Towards an Automatic Analysis of Security Protocols in First-Order Logic
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
System Description: Spass Version 1.0.0
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Deductive Composition of Astronomical Software from Subroutine Libraries
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Explaining Synthesized Software
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
MPTP -- Motivation, Implementation, First Experiments
Journal of Automated Reasoning
AI Communications - CASC
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
Hi-index | 0.00 |
One of the major problems in clausal theorem proving is the control of the proof search. In the presence of equality, this problem is particularly hard, since nearly all state-of-the-art systems perform the proof search by saturating a mostly unstructured set of clauses. We describe an approach that enables a superposition-based prover to pick good clauses for generating inferences based on experiences from previous successful proof searches for other problems. Information about good and bad search decisions (useful and superfluous clauses) is automatically collected from search protocols and represented in the form of annotated clause patterns. At run time, new clauses are compared with stored patterns and evaluated according to the associated information found. We describe our implementation of the system. Experimental results demonstrate that a learned heuristic significantly outperforms the conventional base strategy, especially in domains where enough training examples are available.