Graph Saturation

Sebastiaan J. C. Joosten

November 23, 2018

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This is an Isabelle/HOL formalisation of graph saturation, closely following a paper by the author on graph saturation. Nine out of ten lemmas of the original paper are proven in this formalisation. The formalisation additionally includes two theorems that show the main premise of the paper: that consistency and entailment are decided through graph saturation. This formalisation does not give executable code, and it did not implement any of the optimisations suggested in the paper.


BSD License


Session Graph_Saturation