1987ACM SIGSAM BulletinOpen access

Automated theorem proving: the resolution method

Ronald Peikert

Open full text 0 citations

Abstract

The goal of this project is to learn the basic notions of predicate logic and of automated theorem proving. A small theorem prover written in LISP has been taken from [1] and can be used for this project. Knowledge of the programming language LISP is required only for the optional part of the project.

Open-access reader

About this research paper

What this paper is about

The goal of this project is to learn the basic notions of predicate logic and of automated theorem proving. A small theorem prover written in LISP has been taken from [1] and can be used for this project. Knowledge of the programming language LISP is required only for the optional part of the project.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The goal of this project is to learn the basic notions of predicate logic and of automated theorem proving. A small theorem prover written in LISP has been taken from [1] and can be used for this project. Knowledge of the programming language LISP is required only for the optional part of the project.

Key concepts: Lisp, Automated theorem proving, Programming language, Computer science, Automated proof checking, Resolution (logic), Logic programming, Calculus (dental)

Related papers

Back to paper searchBrowse research topicsOriginal source
Automated theorem proving: the resolution method — Research Paper | ScholarLens