References

  1. A. Atkin (2015): Peirce (The Routledge Philosophers). Routledge.
  2. D. Barker-Plummer, J. Etchemendy, A. Liu, M. Murray & N. Swoboda (2008): Openproof - A Flexible Framework for Heterogeneous Reasoning. In: Diagrammatic Representation and Inference, LNAI 5223. Springer, pp. 347–349, doi:10.1007/978-3-540-87730-1_32.
  3. J. Barwise & J. Etchemendy (1994): Hyperproof. CSLI Press.
  4. C. Gurr (1999): Effective Diagrammatic Communication: Syntactic, Semantic and Pragmatic Issues. Journal of Visual Languages & Computing 10(4), pp. 317–342, doi:10.1006/jvlc.1999.0130.
  5. P. E. Hart, N. J. Nilsson & B. Raphael (1968): A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics 4(2), pp. 100–107, doi:10.1109/TSSC.1968.300136.
  6. J. Howse, G. Stapleton, J. Flower & J. Taylor (2002): Corresponding Regions in Euler Diagrams. In: Diagrammatic Representation and Inference, LNAI 2317. Springer, pp. 76–90, doi:10.1007/3-540-46037-3_7.
  7. J. Howse, G. Stapleton & Taylor (2005): Spider Diagrams. LMS Journal of Computation and Mathematics 8, pp. 145–194, doi:10.1112/S1461157000000942.
  8. M. Jamnik (2001): Mathematical Reasoning with Diagrams. CSLI Press.
  9. A. Kissinger & V. Zamdzhiev (2015): Quantomatic: A Proof Assistant for Diagrammatic Reasoning. In: Automated Deduction - CADE, LNCS 9195. Springer, pp. 326–336, doi:10.1007/978-3-319-21401-6_22.
  10. S. Linker, J. Burton & A. Blake (2016): Measuring User Comprehension of Inference Rules in Euler Diagrams. In: Diagrammatic Representation and Inference, LNAI 9781. Springer, pp. 32–39, doi:10.1007/978-3-319-42333-3_3.
  11. R. Milner, M. Tofte & D. Macqueen (1997): The Definition of Standard ML. MIT Press, Cambridge, USA.
  12. K. Mineshima, Y. Sato, R. Takemura & M. Okada (2014): Towards explaining the cognitive efficacy of Euler diagrams in syllogistic reasoning: A relational perspective. Journal of Visual Languages & Computing 25(3), pp. 156–169, doi:10.1016/j.jvlc.2013.08.007.
  13. M. Odersky, P. Altherr, V. Cremet, B. Emir, S. Maneth, S. Micheloud, N. Mihaylov, M. Schinz, E. Stenman & M. Zenger (2004): An Overview of the Scala Programming Language. Technical Report IC/2004/64. EPFL.
  14. L. C. Paulson (1994): Isabelle - A Generic Theorem Prover. LNCS 828. Springer.
  15. A. Shimojima (2004): Inferential and Expressive Capacities of Graphical Representations: Survey and Some Generalizations. In: Diagrammatic Representation and Inference, LNAI 2980. Springer, pp. 18–21, doi:10.1007/978-3-540-25931-2_3.
  16. G. Stapleton, J. Masthoff, J. Flower, A. Fish & J. Southern (2007): Automated Theorem Proving in Euler Diagrams Systems. Journal of Automated Reasoning 39(4), pp. 431–470, doi:10.1007/s10817-007-9069-y.
  17. G. Stapleton, L. Zhang, J. Howse & P. Rodgers (2011): Drawing Euler Diagrams with Circles: The Theory of Piercings.. IEEE Transactions on Visualization and Computer Graphics 17(7), pp. 1020–1032, doi:10.1109/TVCG.2010.119.
  18. M. Urbas & M. Jamnik (2012): Diabelli: A Heterogeneous Proof System. In: B. Gramlich, D. Miller & U. Sattler: IJCAR, LNAI 7364. Springer, pp. 559–566, doi:10.1007/978-3-642-31365-3_44.
  19. M. Urbas & M. Jamnik (2014): A Framework for Heterogeneous Reasoning in Formal and Informal Domains. In: T. Dwyer, H.C. Purchase & A. Delaney: Diagrams, LNCS 8578. Springer, pp. 277–292, doi:10.1007/978-3-662-44043-8_28.
  20. M. Urbas, M. Jamnik & G. Stapleton (2015): Speedith: A Reasoner for Spider Diagrams. Journal of Logic, Language and Information, pp. 1–54, doi:10.1007/s10849-015-9229-0.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org