AISB convention 2017

  In the run up to AISB2017 convention, I've asked Joanna Bryson, from the organising team, to answer few questions about the convention and what comes with it. Mohammad Majid al-Rifaie ( Tu...


Harold Cohen

Harold Cohen, tireless computer art pioneer dies at 87   Harold Cohen at the Tate (1983) Aaron image in background   Harold Cohen died at 87 in his studio on 27th April 2016 in Encintias California, USA.The first time I hear...


Dancing with Pixies?...

At TEDx Tottenham, London Mark Bishop (the former chair of the Society) demonstrates that if the ongoing EU flagship science project - the 1.6 billion dollar "Human Brain Project” - ultimately succeeds in understanding all as...


Computerised Minds. ...

A video sponsored by the society discusses Searle's Chinese Room Argument (CRA) and the heated debates surrounding it. In this video, which is accessible to the general public and those with interest in AI, Olly's Philosophy Tube ...


Connection Science

All individual members of The Society for the Study of Artificial Intelligence and Simulation of Behaviour have a personal subscription to the Taylor Francis journal Connection Science as part of their membership. How to Acce...



AISB event Bulletin Item

CALL FOR PAPERS: Rewriting Techniques and Applications, 24-26 June 2013, Eindhoven, THE NETHERLANDS

RTA 2013

The 24th International Conference on Rewriting Techniques and Applications (RTA 2013) is organized 
as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2013), together 
with the 11th International Conference on Typed Lambda Calculi and Applications (TLCA 2013), and 
several workshops. RDP 2013 will be held at the Eindhoven University of Technology in the 


RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas 
of interest include (but are not limited to):

Applications: case studies; analysis of cryptographic protocols; rule-based
   (functional and logic) programming; symbolic and algebraic computation;
   SMT solving; theorem proving; system synthesis and verification; proof
   checking; reasoning about programming languages and logics; program
   transformation; XML queries and transformations; systems biology;
   homotopy theory; implicit computational complexity;

Foundations: equational logic; universal algebra; rewriting logic;
   rewriting models of programs; matching and unification; narrowing;
   completion techniques; strategies; rewriting calculi; constraint solving;
   tree automata; termination; complexity; modularity;

Frameworks: string, term, and graph rewriting; lambda-calculus and
   higher-order rewriting; constrained rewriting/deduction; categorical and
   infinitary rewriting; stochastic rewriting; net rewriting; binding
   techniques; Petri nets; higher-dimensional rewriting;

Implementation: implementation techniques; parallel execution; rewrite and
   completion tools; certification of rewriting properties; abstract
   machines; explicit substitutions; automated (non)termination and
   confluence provers; automated complexity analysis.


The proceedings of RTA 2013 will be published by LIPIcs (Leibniz International Proceedings in 
Informatics). LIPIcs is open access, meaning that publications will be available online and free 
of charge, and authors keep the copyright for their papers. LIPIcs publications are indexed in 
For more information about LIPIcs please consult:


Submissions must be
- original and not submitted for publication elsewhere,
- written in English,
- a research paper, or a problem set, or a system description,
- in pdf prepared with pdflatex using the LIPIcs stylefile:
- at most 10 pages for system description,
   at most 15 pages for the other two types of submissions
- submitted electronically through the EasyChair system at:

The page limit and the deadline for submission are strict.

Additional material for instance proof details, may be given in an appendix which is not subject to
the page limit. However, submissions must be self-contained within the respective page limit; 
reading the appendix should not be necessary to assess the merits of a submission.


Femke van Raamsdonk (VU University Amsterdam, The Netherlands)


Eduardo Bonelli, National University of Quilmes Byron Cook, Microsoft Research Cambridge Stephanie 
Delaune, ENS Cachan Gilles Dowek, Inria Paris-Rocquencourt Maribel Fernandez, King's College 
London Nao Hirokawa, JAIST Ishikawa Delia Kesner, University Paris-Diderot Helene Kirchner, Inria 
Paris-Rocquencourt Barbara Koenig, University Duisburg Essen Temur Kutsia, Johannes Kepler 
University Linz Aart Middeldorp, University of Innsbruck Vincent van Oostrom, Utrecht University 
Femke van Raamsdonk, VU University Amsterdam Kristoffer Rose, IBM Research New York Manfred 
Schmidt-Schauss, Goethe University Frankfurt Peter Selinger, Dalhousie University Paula Severi, 
University of Leicester Aaron Stump, The University of Iowa Tarmo Uustalu, Institute of 
Cybernetics Tallinn Roel de Vrijer, VU University Amsterdam Johannes Waldmann, HTWK Leipzig Hans 
Zantema, Eindhoven University of Technology


Hans Zantema (Eindhoven University of Technology, The Netherlands)


Mauricio Ayala-Rincon, Brasilia University Frederic Blanqui, INRIA Tsinghua University Beijing 
Salvador Lucas, Technical University of Valencia Georg Moser, University of Innsbruck Masahiko 
Sakai, Nagoya University Sophie Tison, University of Lille


Questions related to submission, reviewing, and programme should be sent to the programme 
committee chair Femke van Raamsdonk, email femke at