Pages that link to "Item:Q2467560"
From MaRDI portal
The following pages link to Automated theorem proving in Euler diagram systems (Q2467560):
Displaying 9 items.
- Efficient on-line algorithms for Euler diagram region computation (Q709068) (← links)
- A graph theoretic approach to general Euler diagram drawing (Q1041227) (← links)
- Automated theorem proving in Euler diagram systems (Q2467560) (← links)
- Speedith: a reasoner for spider diagrams (Q2629222) (← links)
- Equivalences in Euler-based diagram systems through normal forms (Q2827282) (← links)
- On the Completeness of Spider Diagrams Augmented with Constants (Q2948608) (← links)
- Heterogeneous Proofs: Spider Diagrams Meet Higher-Order Provers (Q3088023) (← links)
- Visual Mathematics: Diagrammatic Formalization and Proof (Q5505526) (← links)
- Investigating Diagrammatic Reasoning with Deep Neural Networks (Q5878880) (← links)
