The implementation of a theorem prover in functional language and the use of the Rasch Model combined with Condorcet-List Theorem

Abstract

This thesis proposes the implementation of a theorem prover using a functional programing language. The implementation was based on the Warren Abstract Machine (WAM). The objective behind implementing the WAM is to achieve robustness and while running remain constant in both time and space. The inference engine was implemented using Common Lisp, due to its mathematical roots. The Theorem prover syntax approaches that of the language Prolog. Besides the theorem prover, it was demonstrated that the Rasch Model and the Condorcet-List can be brought together and used for the processing of natural language.