Abstract
Over the last two decades substantial advances have beenmade in our understanding of diagrammatic logics. Many of these logics have the expressiveness of monadic firstorder logic, sometimes with equality, and are equipped with sound and complete inference rules. Aparticular challenge is the representation of negated statements. This paper addresses the problem of how to represent negated statementsinvolving constants, thus asserting the absence of specific individuals, in the context of Eulerdiagrambased logics. Our first contribution is to explore the potential benefits of explicitly representing absence using constants, in terms of clutter reduction, and to highlight ontological issues that arise. We go on to define a measure of clutter arising from constants. By defining a set of semanticspreserving inference rules, we are able to algorithmically minimize diagram clutter, in part made possible by the inclusion of absence. Consequently, information about individuals can be represented in a minimally cluttered way.
Original language  English 

Title of host publication  International Conference on the Theory and Application of Diagrams 
Place of Publication  Germany 
Publisher  Springer 
Pages  107122 
Number of pages  16 
Volume  9781 
ISBN (Print)  9783319423326 
DOIs  
Publication status  Published  26 Jul 2016 
Event  International Conference on the Theory and Application of Diagrams  Philadelphia, USA, 710, 2016 Duration: 26 Jul 2016 → … 
Publication series
Name  Lecture Notes in Computer Science 

Conference
Conference  International Conference on the Theory and Application of Diagrams 

Period  26/07/16 → … 
Bibliographical note
© The Author(s) 2016 M. Jamnik et al.Fingerprint Dive into the research topics of 'Minimizing Clutter Using Absence in Venni e'. Together they form a unique fingerprint.
Profiles

James Burton
 School of Computing, Engineering & Maths  Senior Lecturer
 Centre for Secure, Intelligent and Usable Systems
Person: Academic