Seventy-five problems for testing automatic theorem provers
Journal of Automated Reasoning
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs
Journal of the ACM (JACM)
Completeness, Confluence, and Related Properties of Clause Graph Resolution
Completeness, Confluence, and Related Properties of Clause Graph Resolution
Solution of the Robbins Problem
Journal of Automated Reasoning
Ordered Semantic Hyper-Linking
Journal of Automated Reasoning
Towards Semantic Goal-Directed Forward Reasoning in Resolution
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
The Markgraf Karl Refutation Procedure (MKRP)
Proceedings of the 8th International Conference on Automated Deduction
SCOTT: Semantically Constrained Otter System Description
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Semantically Guided First-Order Theorem Proving using Hyper-Linking
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
FINDER: Finite Domain Enumerator - System Description
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
KEIM: A Toolkit for Automated Deduction
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Vampire 1.1 (System Description)
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Hi-index | 0.00 |
In this contribution we present a variant of a resolution theorem prover which selects resolution steps based on the proportion of models a newly generated clause satisfies compared to all models given in a reference class. This reference class is generated from a subset of the initial clause set. Since the empty clause does not satisfy any models, preference is given to such clauses which satisfy few models only. Because computing the number of models is computationally expensive on the one hand, but will remain almost unchanged after the application of one single resolution step on the other hand, we adapt Kowalski's connection graph method to store the number of models at each link.