Student Projects—Automated Reasoning

Dynamic Proof Search Visualisation

An automatic theorem prover such as Vampire, can generate millions of clauses when searching for a proof of a conjecture. The proof search process is usually documented by an output log, which however often becomes difficult to understand and analyze due to its sheer size. The aim of this project is to develop a visualisation tool for turning the output log into a graphical summary of the search with the ability to track the development in time. This will consist in devising various metrics for characterising the generated clauses thus mapping them to an Euclidean space, combined with a visualisation of the space using methods from computer graphics (2D, 3D).

[Contact Martin Suda]

Latest News


We had great talks at FRIDA’15 workshop in Grenoble. The slides of some of the talks are available online.

Continue reading

FRIDA’15 Program

Check the program of the 2nd workshop on Formal Reasoning in Distributed Algorithms at FORTE. We have a nice program this year.

Continue reading

Full news archive