Incoporating negation into visual logics: a case study using Euler diagrams

STAPLETON, GEM and Masthoff, Judith (2007) Incoporating negation into visual logics: a case study using Euler diagrams In: Proceedings of the 13th International Conference on Distributed Multimedia Systems, DMS 2007, San Francisco Bay, USA, 6-8 September, 2007.

Full text not available from this repository.

Official URL: http://www.ksi.edu/seke/Proceedings/dms/DMS2007_Pr...

Abstract

Many diagrammatic logics based on Euler diagrams have been defined with the aim of making precise reasoning easier for people. In such logics it is unusual to find the negation operator (¬) included. This is likely to impact the usability of the logics when users try to make statements that are naturally phrased using the ¬ operator. Furthermore, if one wishes to use semantic tableaux methods for the purposes of establishing entailment then including ¬ is essential. Thus, there are good reasons for extending existing diagrammatic logics to include ¬ explicitly. In this paper, we take Euler diagrams and extend the notation to include the ¬ operator, as well as 'or' and 'and'. Various expressiveness results for the logic are established. We present a sound and complete set of reasoning rules for the logic, drawing parallels with existing completeness proof strategies and highlighting differences that arise due to including negation.

Item Type:Contribution to conference proceedings in the public domain ( Full Paper)
Uncontrolled Keywords:Diagrammatic logics; Euler diagrams
Subjects:G000 Computing and Mathematical Sciences > G600 Software Engineering
Faculties:Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling
ID Code:2991
Deposited By:Converis
Deposited On:26 Nov 2007
Last Modified:30 Jul 2013 04:01

Repository Staff Only: item control page