Linear resolution with selection function

Artificial Intelligence

Volumn 2, Issue 3-4, 1971, Pages 227-260

  Kowalski, Robert ^a   Kuehner, Donald ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008267175     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(71)90012-9     Document Type: Article

References (23)

1. A linear format for resolution with merging and a new technique for establishing completeness
2. Resolution with merging
3. A formal basis for the heuristic determination of minimum cost paths
4. Semantic trees in automatic theorem proving
5. Lecture notes on automatic theorem-proving
6. Search strategies for theorem-proving
7. Studies in the completeness and efficiency of theorem-proving by resolution
8. A note on the relation between resolution and Maslov's inverse method
9. Strategies for improving the efficiency of automatic theorem-proving
10. Linear resolution with selection function
11. A simplified format for the model-elimination theorem-proving procedure
12. A linear format for resolution
13. Refinement theorems in resolution theory
14. Proof-search strategies for methods of the resolution type
15. Prolegomena to a theory of efficiency of proof procedures
16. Advances and problems in mechanical proof procedures
17. A review of automatic theorem-proving
18. Efficiency and completeness of the set of support strategy in theorem-proving
19. Resolution Graphs
20. On a class of strategies which can be used to established decidability by the resolution principle