Equivalences in Euler-based diagram systems through normal forms
From MaRDI portal
Publication:2827282
DOI10.1112/S1461157014000114zbMATH Open1348.03029OpenAlexW2008864608MaRDI QIDQ2827282FDOQ2827282
Authors: Andrew Fish, John Taylor
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
Recommendations
Logic in artificial intelligence (68T27) Abstract deductive systems (03B22) Logic in computer science (03B70)
Cites Work
- Maintaining knowledge about temporal intervals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spider Diagrams
- A graph theoretic approach to general Euler diagram drawing
- Title not available (Why is that?)
- Hypergraph planarity and the complexity of drawing venn diagrams
- Euler’s visual logic
- Automated theorem proving in Euler diagram systems
- Generating simple convex Venn diagrams
- The Expressiveness of Spider Diagrams
- Simple, reducible Venn diagrams on five curves and Hamiltonian cycles
- On the construction of venn diagrams
- The Construction of Venn Diagrams
Cited In (1)
Uses Software
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)