Automated theorem proving: the resolution method
Ronald Peikert
Abstract
Open-access reader
Ronald Peikert
Abstract
Open-access reader
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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)