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)
Automatic Theorem Proving With Renamable and Semantic Resolution
Journal of the ACM (JACM)
The Concept of Demodulation in Theorem Proving
Journal of the ACM (JACM)
Journal of the ACM (JACM)
The Concept of Weak Substitution in Theorem-Proving
Journal of the ACM (JACM)
An Implementation of the Model Elimination Proof Procedure
Journal of the ACM (JACM)
Experiments with a resolution-based deductive question-answering system and a proposed clause representation for parallel search.
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
From PLANNER to CONNIVER: a genetic approach
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
Recent developments in SAIL: an ALGOL-based language for artificial intelligence
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
Procedural embedding of knowledge in planner
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
The Q* algorithm: a search strategy for a deductive question-answering system
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Introduction Tutorial on Resolution
IEEE Transactions on Computers
Subsumption and connection graphs
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
The Markgraf Karl refutation procedure
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
The efficacy of rue resolution experimental results and heuristic theory
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
A structured set of higher-order problems
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Hi-index | 14.98 |
This paper describes a comparative study of six binary inference systems and two search strategies employed in resolution-based problem solving systems. A total of 152 problems, most of which were taken from the recent literature, were employed. Each of these problems was attempted under a standard set of conditions using each inference system and each search strategy, for a total of twelve attempts for each problem. Using a variety of performance measures, a large number of hypotheses were examined in an effort to provide insight into the behavior of each inference system/search strategy combination. Whenever possible, the authors employed distribution-free statistical tests to minimize the subjectivity of the comparisons and hypothesis testing. Conclusions are presented concerning the effectiveness of the binary inference systems and search strategies, some effects of employing different problem representations, and certain characteristics of problems found to be significant in the overall system performance. Suggestions are made as to additional techniques that might enable theorem provers to solve practical problems.