At the ISSA laboratory seminar Prof. Mark Reynolds gave a talk entitled: "A new rule for LTL tableaux"
Prof. Mark Reynolds is the Head of the School of Computer Science and Software Engineering at The University of Western Australia
Title: "A new rule for LTL tableaux"
Speaker: Mark Reynolds, Head of the School of Computer Science and Software Engineering at The University of Western Australia.
Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s. However, the tableaux for this logic do not look like traditional tree-shaped tableau systems and their processing is often quite complicated.
In this talk, we introduce a novel style of tableau rule
which supports a new simple traditional-style tree-shaped tableau for LTL. We prove that it is sound and complete. As well as being simple to understand, to introduce to students and to use, it is also simple to implement and is competitive against state of the art systems. It is particularly suitable for parallel implementations.