CFProposal AISB2018

  The Society for the Study of Artificial Intelligence and Simulation for Behaviour (AISB) is soliciting proposals for symposia to be held at the AISB 2018 convention.The longest running convention on Artificial Intelligence, A...


Insurance AI Analy...

Insurance AI Analytics Summit, October 9-10, London Join us for Europe’s only AI event dedicated to insurance where 300 attendees will unite from analytics, pricing, marketing, claims and underwriting. You’ll find out how advan...


AISB 2018 Convention

  The longest running convention on Artificial Intelligence, AISB 2018 will be held at the University of Liverpool, chaired by Floriana Grasso and Louise Dennis. As in the past years, AISB 2018 will provide a unique forum for p...


AI Summit London

     The AI Summit London: The World’s Number One AI Event for Business  Date: 9-10 May 2017 Venue: Business Design Centre, London. The AI Summit is the world’s first and largest/number one conference exhibition dedicated to t...


AISB Wired Health

    AISB and WIRED events have partnered to bring together inspirational high-profile speakers. Join hundreds of healthcare, pharmaceutical and technology influencers and leaders at the 4th Annual WIRED Health event, taking pl...


Hugh Gene Loebner

  The AISB were sad to learn last week of the passing of philanthropist and inventor Hugh Gene Loebner PhD, who died peacefully in his home in New York at the age of 74.  Hugh was founder and sponsor of The Loebner Prize, an an...


AI Europe 2016

  Partnership between AISB and AI Europe 2016: Next December 5th and 6th in London, AI Europe will bring together the European AI eco-system by gathering new tools and future technologies appearing in professional fields for th...


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...


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...



AISB event Bulletin Item

CFP: Workshop on Reachability Problems, Brno

Call for Papers 

(August 27-29, 2010, Masaryk University, Brno, Czech Republic)
          co-located with MFCS & CSL 2010

==== Deadline for submissions: April 21, 2010  ====
==== Proceedings will be published in the      ====
====       Springer LNCS series                ====

The Workshop on Reachability Problems will be hosted
by the Faculty of Informatics, Masaryk University,
Brno, Czech Republic and will be co-located with
Joint MFCS and CSL 2010. RP'10 is the fourth in
the series of workshops following three successful
meetings at Ecole Polytechnique, France in 2009
at University of Liverpool, UK in 2008 and at
Turku University, Finland in 2007.

Scope: The Reachability Workshop is specifically
aimed at gathering together scholars from diverse
disciplines and backgrounds interested in
reachability problems that appear in
- Algebraic structures
- Computational models
- Hybrid systems
- Logic and Verification

Invited Speakers:
- Markus Holzer (Giessen University, Germany)
- Kim Guldstrand Larsen (Aalborg University, Denmark)
- Alexander Rabinovich (Tel Aviv University, Israel)
- Philippe Schnoebelen (ENS Cachan, France)

Important dates:
Submission: April 21, 2010
Notification: June 3, 2010
Final version: June 10, 2010
Conference dates:  Aug. 27-29, 2010

Topics of interest:

Papers presenting original contributions related to reachability problems in different computational models and systems are being sought. Topics of interest include (but are not limited to): Reachability for infinite state systems, rewriting systems; Reachability analysis in counter/ timed/ cellular/ communicating automata; Petri-Nets; computational aspects of semigroups, groups and rings; Reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps and new computational paradigms

The reachability problems are in the core of many questions of computer science and mathematics. This topic covers many aspects about the analysis of computational traces/paths in classical and unconventional computational models, logic, algebraic structures as well as in mathematical systems and control theory. The classical reachability can be formulated as follows: Given a computational system or model with a set of allowed transformations (functions). Decide whether a certain state of a system is reachable from a given initial state by a set of allowed transformations. The same questions can be asked not only about reachability of exact states of the system but also about a set of states expressed in term of some property as a parameterized reachability problem.  Another set of predictability questions can be seen in terms of reachability of eligible traces of computations, their equivalence; unavoidability of some dynamics and a possibility to avoid undesirable dynamic using a limited control.


The Conference Proceedings will be published as the volume of the Springer Verlag Lecture Notes in Computer Science (LNCS) series and distributed at the Conference. We plan also to publish selected papers in a special issue of a high quality journal following the regular referee procedure.


Authors are invited to submit a draft of a full paper with at most 12 pages (in LaTeX, formatted according to LNCS guidelines) via the conference web page. Proofs omitted due to space constraints must be put into an appendix to be read by the program committee members at their discretion. Submissions deviating from these guidelines risk rejection. Electronic submissions should be formatted in postscript or pdf. Simultaneous submission to other conferences or workshops with published proceedings is not allowed.

Program Committee:
- Parosh Aziz Abdulla, Uppsala
- Eugene Asarin, Paris
- Christel Baier, Bonn
- Bernard Boigelot, Liege
- Olivier Bournez, Palaiseau
- Cristian S. Calude, Auckland
- Stephane Demri, Cachan
- Javier Esparza, Munich
- Laurent Fribourg, Cachan
- Vesa Halava, Turku
- Oscar Ibarra, Santa Barbara
- Franjo Ivancic, Princeton
- Juhani Karhumaki, Turku
- Joost-Pieter Katoen, Aachen
- Antonin Kucera, Brno
- Michal Kunc, Brno
- Alexander Kurz, Leicester
- Slawomir Lasota, Warsaw
- Alexei Lisitsa, Liverpool
- Luke Ong, Oxford
- Igor Potapov, Liverpool
- Wolfgang Thomas, Aachen
- Hsu-Chun Yen, Taipei

Organizing Committee:
- Antonin Kucera (Masaryk University)
- Igor Potapov (University of Liverpool)

Contact details:
Faculty of Informatics, Masaryk University,

Antonin Kucera
Igor Potapov