• Aucun résultat trouvé

Preface

N/A
N/A
Protected

Academic year: 2022

Partager "Preface"

Copied!
1
0
0

Texte intégral

(1)

Diagrams, Logic and Cognition 2013 Preface to the proceedings

Our world is increasingly visual, and diagrams are an essential aspect of many of the fields that try to make sense of it. These fields include demography, cartography, medical imaging, aviation, and so on. In particular, diagrammatic logic is gaining ground in logic and mathematics as an alternative to or when used in parallel with symbolic logics; recent years have seen the appearance of increasingly expressive diagrammatic systems.

The success of such systems depends not only on an understanding of their formal properties. Diagram- matic logics must appeal to their users and provide identifiable benefits over the use of traditional, symbolic alternatives. That is, the notations used must be designed so as to be easily understood and to exploit any potentially intuitive features they may have, without misleading the viewer by false intuitions. Furthermore, in order to encourage the uptake of diagrams, accessible software tools are required; the designers of these tools need to address open problems in information visualisation, graph theory and automated diagram generation.

Thus, research into diagrams brings together logicians, software engineers and computer scientists, artists and philosophers. This research community is well-established in many parts of the world, but is at an early stage in others. In particular, although Indian researchers have made important contributions to our knowledge of diagrams, research events on this topic are rare in that region.

It was in this context that the first international workshop on Diagrams, Logic and Cognition (DLAC) was held on the 28th and 29th of October 2013 in Kolkata, India. The scope of the workshop was broad, but can be summarised as focusing on original research related tothe history of diagrams, inference in diagrammatic logics, diagrams and cognition, and aesthetics and visual complexity. We were fortunate enough to attract submissions covering the majority of these topics. Each submission was reviewed by two members of the Program Committee, which was comprised of the following expert researchers:

• Dave Barker Plummer, Stanford University, US,

• Mihir Kumar Chakraborty, Jadavpur University, India,

• Mark Minas, Universit¨at der Bundeswehr M¨unchen, Germany,

• Kim Marriott, Monash University, Australia,

• Peter Rodgers, University of Kent, UK, and

• Ryo Takemura, Keio University, Japan.

We were also fortunate to have a keynote speech delivered by a leading researcher in our field, Gem Sta- pleton of the University of Brighton. Gem’s talk presented an overview of her research interests, including the formal properties of Euler-based visual logics, the design of new notations and automatic diagram generation.

We are indebted to the program committee and our keynote speaker for helping to make DLAC 2013 a successful and highly stimulating event. We must also thank the staff and students of Jadavpur University who made all visitors feel exceptionally welcome, not least by providing a fascinating Cultural Programme of entertainment which featured poetry, dance and music.

February 2014 Jim Burton

Lopamudra Choudhury

Références

Documents relatifs

(assert (distinct MM_Null MM_Num MM_Name MM_Bool MM_TypeDesignator MM_Assertion MM_SetDef MM_Mult MM_MSeq MM_MOne MM_MOpt MM_MMany MM_MRange MM_MOneToMany MM_UBound

Son utilisation est très réduite, tandis que les autres langues citées, sont presque inutilisées (anglais –berbère- arabe classique).. L'arabe dialectal et l'arabe classique

Are you? A male □ A female □ with an age < 30 years □ 30‐50 years old □ older than 50 □

As we shall remark, this argument actually produces more than one unknot diagram from D , but it gives a relatively small number: if D has n crossings, this idea yields at most 4

Can every finite diagram (indexed by a non necessarily dismantlable partially ordered set) of finite Boolean semilattices and h∨, 0i-homomorphisms be lifted by a diagram of

Adopting R.0 p , on the other hand, would result in admitting a sort of elementary construction step that, in pertaining to the construction of points, would differ from any one

A framing of a surface issued from the Veech construction Considering the corresponding moduli space H lab of labeled transla- tion surfaces ( i.e. translation surfaces with

Frame capture, 9 Evenings: Theatre and Engineering (Central Control Area), 1966, camera: Alfons Schilling and Bell Labs Engineers, produced by Billy Klüver, 16 mm black-and-white