Finding resolution proofs and using duplicate goals in and/or trees
- 1 October 1971
- journal article
- Published by Elsevier in Information Sciences
- Vol. 3 (4), 315-342
- https://doi.org/10.1016/s0020-0255(71)80013-0
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Experiments in automatic learning for a multipurpose hueristic programCommunications of the ACM, 1971
- Experiments With a Multipurpose, Theorem-Proving Heuristic ProgramJournal of the ACM, 1968
- Automatic Theorem Proving With Renamable and Semantic ResolutionJournal of the ACM, 1967
- Theorem-Proving for Computers: Some Results on Resolution and RenamingThe Computer Journal, 1966
- A chess mating combinations programPublished by Association for Computing Machinery (ACM) ,1966
- Experiments with a deductive question-answering programCommunications of the ACM, 1965
- Efficiency and Completeness of the Set of Support Strategy in Theorem ProvingJournal of the ACM, 1965
- Assembly Line Balancing Using Probabilistic Combinations of HeuristicsManagement Science, 1965
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- A Heuristic Program that Solves Symbolic Integration Problems in Freshman CalculusJournal of the ACM, 1963