On a uniform logical framework for diagrammatic reasoning

We present a formalization of diagrammatic systems and transformations in a linear logic framework. We start by showing how to embed Constraint Multiset Grammars, a well-known method for the specification of diagram languages, into a fragment of linear logic in a provably sound and complete way. We then show how this same fragment can express several forms of visual transformations that are commonly used in reasoning with diagrams. By using formal logic as the basis of our framework we gain the significant advantage of an integrated treatment of syntactic and semantic features of diagram languages. Furthermore, since the logic fragment we are using is implemented in linear logic programming languages, the proposed framework is not only formally well-defined, but also allows the verification of the specification via direct execution