The expressiveness of spider diagrams

Journal of Logic and Computation

Volumn 14, Issue 6, 2004, Pages 857-880

  Stapleton, Gem ^a   Howse, John ^a   Taylor, John ^a   Thompson, Simon ^b  

^a UNIVERSITY OF BRIGHTON   (United Kingdom)

^b UNIVERSITY OF KENT   (United Kingdom)

Author keywords

Expressiveness; Model theory; Monadic logic; Spider diagrams

Indexed keywords

ALGORITHMS; FUNCTIONS; HEURISTIC METHODS; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

EXPRESSIVENESS; MODEL THEORY; MONADIC LOGIC; SPIDER DIAGRAMS;

FORMAL LOGIC;

EID: 10944229026     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/14.6.857     Document Type: Article

References (18)

1. S. N. Burris. Logic for Mathematics and Computer Science. Prentice Hall, 1998.
2. R. Dechter and J. Pearl. Generalised best first search strategies and the optimality of a*, Journal of the Association for Computing Machinery, 32, 505-536, 1985.
3. B. Dreben and D. Goldforb. The Decision Problem. Solvable Classes of Quantificational Formulas. Addison Wesley, 1979.
4. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1991.
5. L. Euler. Lettres a une princesse d'allemagne. Sur divers sujets de physique et de philosophie, 1761. Letters No. 102-108 vol 2 Basel, Birkhauser.
6. J. Flower, J. Masthoff, and G. Stapleton. Generating readable proofs: A heuristic approach to theorem proving with spider diagrams. In Proceedings of International Conference on the Theory and Application of Diagrams, pp. 166-181, Cambridge, UK, March 2004. Springer-Verlag.
7. J. Flower and G. Stapleton. Automated theorem proving with spider diagrams. In Proceedings of CATS'04, Computing: The Australasian Theory Symposium, Electronic Note in Theoretical Computer Science, pp. 116-132, Dunedin, New Zealand, January 2004. Science Direct.
8. W. Hodges. Logic. Penguin Books, 1977.
9. J. Howse, F. Molina, S-J. Shin, and J. Taylor. On diagram tokens and types. In Proceedings of International Conference on the Theory and Application of Diagrams, Callaway Gardens, Georgia, USA, April 2002. Lecture Notes in Artificial Intelligence, pp. 76-90, Springer-Verlag.
10. J. Howse, F. Molina, J. Taylor, S. Kent, and J. Gil. Spider diagrams: A diagrammatic reasoning system. Journal of Visual Languages and Computing, 12, 299-324, June 2001.
11. J. Howse, G. Stapleton, and J. Taylor. Spider Diagrams. Technical report, University of Brighton, 2004. Available from www.cmis.brighton.ac.uk/research/ vmg.
12. P. T. Johnstone. Notes on Logic and Set Theory. Cambridge University Press, 1987.
13. F. Molina. Reasoning with Extended Venn-Peirce Diagrammatic Systems. PhD thesis, University of Brighton, 2001.
14. C. Peirce. Collected papers, vol 4. C. Hartshorne and P. Weiss, eds. Harvard University Press, 1933.
15. S.-J. Shin. The Logical Status of Diagrams. Cambridge University Press, 1994.
16. N. Swoboda and G. Allwein. Using DAG transformations to verify Euler/Venn homogeneous and Euler/Venn FOL heterogeneous rules of inference. In International Workshop on Graph Transformation and Visual Modeling Techniques. Elsevier Science, Barcelona, October 2002.
17. J. Venn. On the diagrammatic and mechanical representation of propositions and reasonings. The London, Edinburgh and Dublin Philosophical Magazine and Journal of Science, 1880.
18. The visual modelling group web site, www.cmis.brighton.ac.uk/research/ vmg. Last accessed November, 2004.