### Abstract

Original language | English |
---|---|

Pages (from-to) | 431-470 |

Number of pages | 40 |

Journal | Journal of Automated Reasoning |

Volume | 39 |

Issue number | 4 |

DOIs | |

Publication status | Published - 1 Jun 2007 |

### Fingerprint

### Keywords

- Visual languages
- Euler diagrams
- Diagrammatic reasoning
- Heuristics

### Cite this

*Journal of Automated Reasoning*,

*39*(4), 431-470. https://doi.org/10.1007/s10817-007-9069-y

}

*Journal of Automated Reasoning*, vol. 39, no. 4, pp. 431-470. https://doi.org/10.1007/s10817-007-9069-y

**Automated theorem proving in Euler diagram systems.** / Stapleton, Gem; Masthoff, Judith; Flower, Jean; Fish, Andrew; Southern, Jane.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Automated theorem proving in Euler diagram systems

AU - Stapleton, Gem

AU - Masthoff, Judith

AU - Flower, Jean

AU - Fish, Andrew

AU - Southern, Jane

PY - 2007/6/1

Y1 - 2007/6/1

N2 - Diagrammatic reasoning has the potential to be important in numerous application areas. This paper focuses on the simple, but widely used, Euler diagrams that form the basis of many more expressive logics. We have implemented a diagrammatic theorem prover, called Edith, which has access to four sound and complete sets of reasoning rules for Euler diagrams. Furthermore, for each rule set we develop a sophisticated heuristic to guide the search for a proof. This paper is about understanding how the choice of reasoning rule set affects the time taken to find proofs. Such an understanding will influence reasoning rule design in other logics. Moreover, this work specific to Euler diagrams directly benefits the many logics based on Euler diagrams. We investigate how the time taken to find a proof depends not only on the proof task but also on the reasoning system used. Our evaluation allows us to predict the best choice of reasoning system, given a proof task, in terms of time taken, and we extract a guide for defining reasoning rules for other logics in order to minimize time requirements.

AB - Diagrammatic reasoning has the potential to be important in numerous application areas. This paper focuses on the simple, but widely used, Euler diagrams that form the basis of many more expressive logics. We have implemented a diagrammatic theorem prover, called Edith, which has access to four sound and complete sets of reasoning rules for Euler diagrams. Furthermore, for each rule set we develop a sophisticated heuristic to guide the search for a proof. This paper is about understanding how the choice of reasoning rule set affects the time taken to find proofs. Such an understanding will influence reasoning rule design in other logics. Moreover, this work specific to Euler diagrams directly benefits the many logics based on Euler diagrams. We investigate how the time taken to find a proof depends not only on the proof task but also on the reasoning system used. Our evaluation allows us to predict the best choice of reasoning system, given a proof task, in terms of time taken, and we extract a guide for defining reasoning rules for other logics in order to minimize time requirements.

KW - Visual languages

KW - Euler diagrams

KW - Diagrammatic reasoning

KW - Heuristics

U2 - 10.1007/s10817-007-9069-y

DO - 10.1007/s10817-007-9069-y

M3 - Article

VL - 39

SP - 431

EP - 470

JO - Journal of Automated Reasoning

JF - Journal of Automated Reasoning

SN - 0168-7433

IS - 4

ER -