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


Erden in AI roundtab...

On Friday 4th September, philosopher and AISB member Dr Yasemin J Erden, participated in an AI roundtable at Second Home, hosted by Index Ventures and SwiftKey.   Joining her on the panel were colleagues from academia and indu...


AISB Convention 2016

The AISB Convention is an annual conference covering the range of AI and Cognitive Science, organised by the Society for the Study of Artificial Intelligence and Simulation of Behaviour. The 2016 Convention will be held at the Uni...


Bishop and AI news

Stephen Hawking thinks computers may surpass human intelligence and take over the world. This view is based on the ideology that all aspects of human mentality will eventually be realised by a program running on a suitable compu...


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


Al-Rifaie on BBC

AISB Committee member and Research Fellow at Goldsmiths, University of London, Dr Mohammad Majid al-Rifaie was interviewed by the BBC (in Farsi) along with his colleague Mohammad Ali Javaheri Javid on the 6 November 2014. He was a...


AISB YouTube Channel

The AISB has launched a YouTube channel: http://www.youtube.com/user/AISBTube (http://www.youtube.com/user/AISBTube). The channel currently holds a number of videos from the AISB 2010 Convention. Videos include the AISB round t...



AISB event Bulletin Item

CfP: Automated Deduction, 31 Jul - 5 Aug 2011, Poland


23nd International Conference on Automated Deduction(CADE-23), Wroclaw, Poland

CADE is the major forum for the presentation of research in all aspects of automated deduction. The conference programme will include invited talks, paper presentations, system descriptions, workshops, tutorials, and system competitions.

We invite high-quality submissions on the general topic of automated deduction, including foundations, applications, implementations and practical experiences.

Logics of interest include, but are not limited to:
    o propositional, first-order, equational, higher-order,
      classical, description, modal, temporal, many-valued,
      intuitionistic, other non-classical, meta-logics,
      logical frameworks, type theory and set theory.

Methods of interest include, but are not limited to
    o saturation, resolution, instance-based, tableaux, sequent
      calculi, natural deduction, term rewriting, decision
      procedures, model generation, model checking, constraint
      solving, induction, unification, proof planning, proof
      checking, proof presentation and explanation.

Applications of interest include, but are not limited to
    o program analysis and verification, hardware verification,
      systematic software and hardware testing, mathematics,
      natural language processing, computational
      linguistics, knowledge representation, ontology reasoning,
      deductive databases, functional and logic programming,
      robotics, planning, synthesis, and other areas of AI.

* Koen Claessen, Chalmers University of Technology, Sweden
* Byron Cook, Microsoft Research, Cambridge and Queen Mary, Univ. of London
* Xavier Leroy, INRIA Paris-Rocquencourt, France
* Aarne Ranta, University of Gothenburg, Sweden

Travel awards will be available to enable selected students to attend the conference. Details will be published on the conference website.

The proceedings of the conference will be published by Springer Verlag in the LNCS/LNAI series.

Submissions can be made in the categories
    o 'regular papers' and
    o 'short system descriptions'.
The page limit in Springer LNCS style is
    o 15 pages for regular papers and
    o 5 pages for short system descriptions.

Full system descriptions that provide in-depth presentation of original ideas in an implemented system can be submitted as regular papers.
For the benefit of reviewers, additional material may be provided by a clearly marked appendix or a reference to a manuscript on a website.
It is at the discretion of the reviewers whether such supplements will be considered.

All regular papers will be evaluated according to the highest standards in terms of originality, significance, technical quality, and readability.

Submissions must be in English and standard conforming pdf format.
Submissions must be unpublished and not submitted for publication elsewhere.
Authors are strongly encouraged to produce their papers in LaTeX.

Formatting instructions and the LNCS style files can be obtained via http://www.springer.de/comp/lncs/authors.html.

To submit your paper please use the EasyChair submission system at this address:  http://www.easychair.org/conferences/?conf=cade2011

Submission Deadlines
    * Abstracts:   1 February 2011
    * Full Papers: 7 February 2011

Other Dates
    * Notification:  20 March 2011
    * Final Version: 20 April 2011
    * Workshops/Tutorials: 31 July-1 August 2011
    * Conference: 2-5 August 2011

* Alessandro Armando, Universit di Genova and FBK-irst, Italy
* Franz Baader, Technische Universitt Dresden, Germany
* Peter Baumgartner, NICTA Canberra, Australia
* Bernhard Beckert, Karlsruhe Institute of Technology, Germany
* Nikolaj Bjrner, Microsoft Research, USA (PC co-chair)
* Maria Paola Bonacina, Universit degli Studi di Verona, Italy
* Alessandro Cimatti, FBK-irst, Italy
* Stephanie Delaune, CNRS, LSV, France
* Bruno Dutertre, SRI International, USA
* Ulrich Furbach, University of Koblenz, Germany
* Silvio Ghilardi, Universit degli Studi di Milano, Italy
* Jrgen Giesl, RWTH Aachen, Germany
* Rajeev Gor, The Australian National University, Australia
* John Harrison, Intel Corporation, USA
* Ullrich Hustadt, University of Liverpool, United Kingdom
* Reiner Hhnle, Chalmers University of Technology, Sweden
* Deepak Kapur, University of New Mexico, USA
* Viktor Kuncak, EPFL, Switzerland
* Alexander Leitsch, Technische Universitt Wien, Austria
* Christopher Lynch, Clarkson University, USA
* Claude March, INRIA Saclay, France
* Aart Middeldorp, Universitt Innsbruck, Austria
* Leonardo de Moura, Microsoft Research, USA
* Tobias Nipkow, TU Mnchen, Germany
* Hans de Nivelle, University of Wroclaw, Poland
* Albert Oliveras, Universitat Politcnica de Catalunya, Spain
* Lawrence Paulson, University of Cambridge, United Kindgom
* Frank Pfenning, Carnegie Mellon University, USA
* Brigitte Pientka, McGill University, Canada
* David Plaisted, University of North Carolina-Chapel Hill, USA
* Michael Rusinowitch, INRIA Nancy Grand Est, France
* Renate A. Schmidt, The University of Manchester, United Kingdom
* Carsten Schrmann, IT University of Copenhagen, Denmark
* Roberto Sebastiani, DISI, University of Trento, Italy
* Gert Smolka, Saarland University, Germany
* Viorica Sofronie-Stokkermans, Max Planck Institute for Informatics,
   Saarbrcken, Germany (PC co-chair)
* Aaron Stump, University of Iowa, USA
* Geoff Sutcliffe, University of Miami, USA
* Cesare Tinelli, The University of Iowa, USA
* Andrei Voronkov, The University of Manchester, United Kingdom
* Christoph Weidenbach, Max Planck Institute for Informatics,
   Saarbrcken, Germany
* Frank Wolter, University of Liverpool, United Kingdom

* Hans de Nivelle, University of Wroclaw, Poland

* Nikolaj Bjrner, Microsoft Research, USA
* Viorica Sofronie-Stokkermans, Max-Planck Institute for Informatics,

* Aaron Stump, University of Iowa, USA

* Carsten Schrmann, IT University of Copenhagen, Denmark

* Hans de Nivelle
* Katarzyna Wodzynska