Automated theorem proving in Euler diagram systems
From MaRDI portal
Publication:2467560
DOI10.1007/s10817-007-9069-yzbMath1132.68683OpenAlexW2032680966MaRDI QIDQ2467560
Judith Masthoff, Gem Stapleton, Jean Flower, Andrew Fish, Jane Southern
Publication date: 22 January 2008
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-007-9069-y
Related Items (9)
Speedith: a reasoner for spider diagrams ⋮ On the Completeness of Spider Diagrams Augmented with Constants ⋮ Automated theorem proving in Euler diagram systems ⋮ Efficient on-line algorithms for Euler diagram region computation ⋮ Heterogeneous Proofs: Spider Diagrams Meet Higher-Order Provers ⋮ Equivalences in Euler-based diagram systems through normal forms ⋮ A graph theoretic approach to general Euler diagram drawing ⋮ Visual Mathematics: Diagrammatic Formalization and Proof ⋮ Investigating Diagrammatic Reasoning with Deep Neural Networks
Uses Software
Cites Work
- Automated theorem proving in Euler diagram systems
- A Decidable Constraint Diagram Reasoning System
- Generalized best-first search strategies and the optimality of A*
- The Expressiveness of Spider Diagrams
- Automated Reasoning
- Spider Diagrams
- Diagrammatic Representation and Inference
- Diagrammatic Representation and Inference
- Diagrammatic Representation and Inference
- Diagrammatic Representation and Inference
- Diagrammatic Representation and Inference
- Graph Drawing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Automated theorem proving in Euler diagram systems