Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-31223-6_19 | Diagrams |
Keywords | Field | DocType |
diagrammatic theorem prover,formal diagrammatic proof,general purpose theorem provers,diagrammatic theorem,diagrammatic language,diagrammatic reasoner,diagrammatic inference rule,diagrammatic proof step,spider diagram,inference rule,established proof assistant | Discrete mathematics,Semantic reasoner,Logical connective,Diagrammatic reasoning,Automated theorem proving,Mathematical proof,Rule of inference,Mathematics,Calculus,Proof assistant,Formal verification | Conference |
Citations | PageRank | References |
10 | 0.72 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matej Urbas | 1 | 18 | 2.69 |
| Mateja Jamnik | 2 | 158 | 30.79 |
| Gem Stapleton | 3 | 482 | 56.25 |
| Jean Flower | 4 | 310 | 22.96 |