25,223 research outputs found
On the Completeness of Spider Diagrams Augmented with Constants
Diagrammatic reasoning can be described formally by a number of diagrammatic logics; spider diagrams are one of these, and are used for expressing logical statements about set membership and containment. Here, existing work on spider diagrams is extended to include constant spiders that represent specific individuals. We give a formal syntax and semantics for the extended diagram language before introducing a collection of reasoning rules encapsulating logical equivalence and logical consequence. We prove that the resulting logic is sound, complete and decidable
Encoding !-tensors as !-graphs with neighbourhood orders
Diagrammatic reasoning using string diagrams provides an intuitive language
for reasoning about morphisms in a symmetric monoidal category. To allow
working with infinite families of string diagrams, !-graphs were introduced as
a method to mark repeated structure inside a diagram. This led to !-graphs
being implemented in the diagrammatic proof assistant Quantomatic. Having a
partially automated program for rewriting diagrams has proven very useful, but
being based on !-graphs, only commutative theories are allowed. An enriched
abstract tensor notation, called !-tensors, has been used to formalise the
notion of !-boxes in non-commutative structures. This work-in-progress paper
presents a method to encode !-tensors as !-graphs with some additional
structure. This will allow us to leverage the existing code from Quantomatic
and quickly provide various tools for non-commutative diagrammatic reasoning.Comment: In Proceedings QPL 2015, arXiv:1511.0118
PyZX: Large Scale Automated Diagrammatic Reasoning
The ZX-calculus is a graphical language for reasoning about ZX-diagrams, a
type of tensor networks that can represent arbitrary linear maps between
qubits. Using the ZX-calculus, we can intuitively reason about quantum theory,
and optimise and validate quantum circuits. In this paper we introduce PyZX, an
open source library for automated reasoning with large ZX-diagrams. We give a
brief introduction to the ZX-calculus, then show how PyZX implements methods
for circuit optimisation, equality validation, and visualisation and how it can
be used in tandem with other software. We end with a set of challenges that
when solved would enhance the utility of automated diagrammatic reasoning.Comment: In Proceedings QPL 2019, arXiv:2004.1475
Generalised Compositional Theories and Diagrammatic Reasoning
This chapter provides an introduction to the use of diagrammatic language, or
perhaps more accurately, diagrammatic calculus, in quantum information and
quantum foundations. We illustrate the use of diagrammatic calculus in one
particular case, namely the study of complementarity and non-locality, two
fundamental concepts of quantum theory whose relationship we explore in later
part of this chapter.
The diagrammatic calculus that we are concerned with here is not merely an
illustrative tool, but it has both (i) a conceptual physical backbone, which
allows it to act as a foundation for diverse physical theories, and (ii) a
genuine mathematical underpinning, permitting one to relate it to standard
mathematical structures.Comment: To appear as a Springer book chapter chapter, edited by G.
Chirabella, R. Spekken
Recommended from our members
Neural Diagrammatic Reasoning
Diagrams have been shown to be effective tools for humans to represent and reason about
complex concepts. They have been widely used to represent concepts in science teaching, to
communicate workflow in industries and to measure human fluid intelligence. Mechanised
reasoning systems typically encode diagrams into symbolic representations that can be
easily processed with rule-based expert systems. This relies on human experts to define the
framework of diagram-to-symbol mapping and the set of rules to reason with the symbols.
This means the reasoning systems cannot be easily adapted to other diagrams without
a new set of human-defined representation mapping and reasoning rules. Moreover such
systems are not able to cope with diagram inputs as raw and possibly noisy images. The
need for human input and the lack of robustness to noise significantly limit the applications
of mechanised diagrammatic reasoning systems.
A key research question then arises: can we develop human-like reasoning systems that
learn to reason robustly without predefined reasoning rules? To answer this question, I
propose Neural Diagrammatic Reasoning, a new family of diagrammatic reasoning
systems which does not have the drawbacks of mechanised reasoning systems. The new
systems are based on deep neural networks, a recently popular machine learning method
that achieved human-level performance on a range of perception tasks such as object
detection, speech recognition and natural language processing. The proposed systems are
able to learn both diagram to symbol mapping and implicit reasoning rules only from data,
with no prior human input about symbols and rules in the reasoning tasks. Specifically I
developed EulerNet, a novel neural network model that solves Euler diagram syllogism
tasks with 99.5% accuracy. Experiments show that EulerNet learns useful representations
of the diagrams and tasks, and is robust to noise and deformation in the input data. I
also developed MXGNet, a novel multiplex graph neural architecture that solves Raven
Progressive Matrices (RPM) tasks. MXGNet achieves state-of-the-art accuracies on two
popular RPM datasets. In addition, I developed Discrete-AIR, an unsupervised learning
architecture that learns semi-symbolic representations of diagrams without any labels.
Lastly I designed a novel inductive bias module that can be readily used in today’s deep
neural networks to improve their generalisation capability on relational reasoning tasks.EPSRC Studentship and Cambridge Trust Scholarshi
Tactical diagrammatic reasoning
Although automated reasoning with diagrams has been possible for some years,
tools for diagrammatic reasoning are generally much less sophisticated than
their sentential cousins. The tasks of exploring levels of automation and
abstraction in the construction of proofs and of providing explanations of
solutions expressed in the proofs remain to be addressed. In this paper we take
an interactive proof assistant for Euler diagrams, Speedith, and add tactics to
its reasoning engine, providing a level of automation in the construction of
proofs. By adding tactics to Speedith's repertoire of inferences, we ease the
interaction between the user and the system and capture a higher level
explanation of the essence of the proof. We analysed the design options for
tactics by using metrics which relate to human readability, such as the number
of inferences and the amount of clutter present in diagrams. Thus, in contrast
to the normal case with sentential tactics, our tactics are designed to not
only prove the theorem, but also to support explanation
Characteristics of diagrammatic reasoning
International audienceDiagrammatic, analogical or iconic representations are often contrasted with linguistic or logical representations, in which the shape of the symbols is arbitrary. Although commonly used, diagrams have long suffered from their reputation as mere tools, as mere support for intuition. We list here the main characteristics of diagrammatic inferential systems, and defend the idea that heterogeneous representation systems, including both linguistic and diagrammatic representations, offer real computational perspectives in knowledge modeling and reasoning
What is Diagrammatic Reasoning in Mathematics?
In recent years, epistemological issues connected with the use of diagrams and visualization in mathematics have been a subject of increasing interest. In particular, it is open to dispute what role diagrams play in justifying mathematical statements. One of the issues that may appear in this context is: what is the character of reasoning that relies in some way on a diagram or visualization and in what way is it distinct from other types of reasoning in mathematics? In this paper it is proposed to distinguish between several ways of using visualization or diagrams in mathematics, each of which could be connected with a different concept of diagrammatic/visual reasoning. Main differences between those types of reasoning are also hinted at. A distinction between visual (diagrammatic) reasoning and visual (diagrammatic) thinking is also considered
- …