Experiments with a heuristic theorem-proving program for predicate calculus with equality

Artificial Intelligence 2 (3-4):261-284 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(71)90013-0

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

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

Through your library

My notes

Similar books and articles

Automatic proofs for theorems on predicate calculus.Sueli Mendes dos Santos - 1972 - [Rio de Janeiro,: Pontificia Universidade Católica do Rio de Janeiro]. Edited by Marilia Rosa Millan.
Experiments with a Multipurpose, Theorem-Proving Heuristic Program.James R. Slagle & Philip Bursky - 1970 - Journal of Symbolic Logic 35 (4):596-596.
Review: James R. Slagle, Philip Bursky, Experiments with a Multipurpose, Theorem-Proving Heuristic Program. [REVIEW]David C. Cooper - 1970 - Journal of Symbolic Logic 35 (4):596-596.
Symbolic logic and mechanical theorem proving.Chin-Liang Chang - 1973 - San Diego: Academic Press. Edited by Richard Char-Tung Lee.
Mechanical theorem proving in a certain class of formulae of the predicate calculus.Ewa Orłowska - 1969 - Studia Logica 25 (1):17 - 29.
Best-Path Theorem Proving: Compiling Derivations.Martin Frické Frické - 2012 - In James Maclaurin (ed.), Rationis Defensor.
Representability and program construction within fork algebras.M. Frias, A. Haeberer & G. Baum - 1998 - Logic Journal of the IGPL 6 (2):227-257.
A computer programme for the first order predicate calculus without identity.S. C. van Westrhenen - 1968 - In P. Braffort & F. van Scheepen (eds.), Automation in language translation and theorem proving. Brussels,: Commission of the European Communities, Directorate-General for Dissemination of Information.
Some remarks on the statistical estimation of probability in first-order predicate calculus.S. C. van Westrhenen - 1968 - In P. Braffort & F. van Scheepen (eds.), Automation in language translation and theorem proving. Brussels,: Commission of the European Communities, Directorate-General for Dissemination of Information.
Theorem Proving and Model Building with the Calculus KE.Jeremy Pitt & Jim Cunningham - 1996 - Logic Journal of the IGPL 4 (1):129-150.
Countable model theory and large cardinals.Harvey Friedman - manuscript
Identity in modal logic theorem proving.Francis J. Pelletier - 1993 - Studia Logica 52 (2):291 - 308.
A game-based formal system L.A. Adamson - 1979 - Studia Logica 38:49.
A Finitely Axiomatized Formalization of Predicate Calculus with Equality.Norman D. Megill - 1995 - Notre Dame Journal of Formal Logic 36 (3):435-453.
A Game-Based Formal System for Ł ${}_{\infty}$.Alan Adamson & Robin Giles - 1979 - Studia Logica 38 (1):49 - 73.

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,514,558)

6 months
5 (#638,139)

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.

Add more citations

References found in this work

No references found.

Add more references