Equivalences in Euler-based diagram systems through normal forms
From MaRDI portal
Publication:2827282
DOI10.1112/S1461157014000114zbMath1348.03029OpenAlexW2008864608MaRDI QIDQ2827282
Publication date: 13 October 2016
Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s1461157014000114
Logic in artificial intelligence (68T27) Logic in computer science (03B70) Abstract deductive systems (03B22)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- A graph theoretic approach to general Euler diagram drawing
- Simple, reducible Venn diagrams on five curves and Hamiltonian cycles
- Generating simple convex Venn diagrams
- Automated theorem proving in Euler diagram systems
- Euler’s visual logic
- The Construction of Venn Diagrams
- On the construction of venn diagrams
- Hypergraph planarity and the complexity of drawing venn diagrams
- The Expressiveness of Spider Diagrams
- Spider Diagrams
This page was built for publication: Equivalences in Euler-based diagram systems through normal forms