Graph Saturation

Sebastiaan Jozef Christiaan Joosten

    Research output: Contribution to journalArticleAcademicpeer-review


    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.
    Original languageEnglish
    Number of pages89
    JournalArchive of Formal Proofs
    Publication statusPublished - 23 Nov 2018

    Cite this