Document type
Bachelor thesisPublication date
Publication license
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/109943
Automated theorem proving
Journal Title
Authors
Director/Tutor
Journal ISSN
Volume Title
Related resource
Abstract
Automated Theorem Proving is an area in mathematical logic and computer science dedicated to the production of theorem proofs by algorithmical means, and is of great use in many fields such as some areas of mathematics, artificial intelligence, software verification, hardware verification or declarative programming.
The aim of the first part of this work is to present Herbrand’s theory and the Resolution Method for the first order logic. In the second part we show one of the many applications of the Resolution Method: the Prolog programming language, which is a useful tool for the resolution of problems in the NP class.
Description
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2016, Director: Juan Carlos Martínez Alonso
Subject (English)
Citation
Collections
Citation
MONTSERRAT ARMSTRONG, Miquel. Automated theorem proving. [consulted: 16 of August of 2026]. Available at: https://hdl.handle.net/2445/109943