In this paper, we introduce Speedith which is a diagrammatic theorem prover for the language of spider diagrams. Spider diagrams are a well-known logic for which there is a sound and complete set of inference rules. Speedith provides a way to input diagrams, transform them via the diagrammatic inference rules, and prove diagrammatic theorems. It is designed as a program that plugs into existing general purpose theorem provers. This allows for seamless formal verification of diagrammatic proof steps within established proof assistants such as Isabelle. We describe the general structure of Speedith, the diagrammatic language, the automatic mechanism that draws the diagrams when inference rules are applied on them, and how formal diagrammatic proofs are constructed. © 2012 Springer-Verlag.
CITATION STYLE
Urbas, M., Jamnik, M., Stapleton, G., & Flower, J. (2012). Speedith: A diagrammatic reasoner for spider diagrams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7352 LNAI, pp. 163–177). https://doi.org/10.1007/978-3-642-31223-6_19
Mendeley helps you to discover research relevant for your work.