Splitting and reduction heuristics in automatic theorem proving

Artificial Intelligence 2 (1):55-77 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,334,194)

6 months
5 (#837,449)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Non-resolution theorem proving.W. W. Bledsoe - 1977 - Artificial Intelligence 9 (1):1-35.
Computer proofs of limit theorems.W. W. Bledsoe, R. S. Boyer & W. H. Henneman - 1972 - Artificial Intelligence 3 (C):27-60.
Towards the automation of set theory and its logic.Frank Malloy Brown - 1978 - Artificial Intelligence 10 (3):281-316.
A man-machine theorem-proving system.W. W. Bledsoe & Peter Bruell - 1974 - Artificial Intelligence 5 (1):51-72.

View all 10 citations / Add more citations

References found in this work

Resolution in type theory.Peter B. Andrews - 1971 - Journal of Symbolic Logic 36 (3):414-432.

Add more references