Equivalences in Euler-based diagram systems through normal forms
From MaRDI portal
Publication:2827282
Recommendations
Cites work
- scientific article; zbMATH DE number 3852463 (Why is no real title available?)
- scientific article; zbMATH DE number 1237648 (Why is no real title available?)
- scientific article; zbMATH DE number 794693 (Why is no real title available?)
- scientific article; zbMATH DE number 918108 (Why is no real title available?)
- A graph theoretic approach to general Euler diagram drawing
- Automated theorem proving in Euler diagram systems
- Euler’s visual logic
- Generating simple convex Venn diagrams
- Hypergraph planarity and the complexity of drawing venn diagrams
- Maintaining knowledge about temporal intervals
- On the construction of venn diagrams
- Simple, reducible Venn diagrams on five curves and Hamiltonian cycles
- Spider Diagrams
- The Construction of Venn Diagrams
- The Expressiveness of Spider Diagrams
Cited in
(1)
This page was built for publication: Equivalences in Euler-based diagram systems through normal forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827282)