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 miscellaneous Bulletin Item

2nd CfP: JSC Special Issue on Symbolic Computation in Software Science

    Special Issue on Symbolic Computation in Software Science

This special issue is related to the topics of the workshop SCSS'08
( Symbolic
Computation in Software Science, which took place in Hagenberg,
Austria, on July 12-13, 2008. Both participants of the workshop and
other authors are invited to submit contributions.

Symbolic Computation is the science of computing with symbolic objects
(terms, formulae, programs, representations of algebraic objects etc.).
Powerful symbolic algorithms have been developed during the past decades
like resolution, model checking, proving methods for various inductive
domains, rewriting techniques, cylindric algebraic decomposition,
Groebner bases, characteristic sets, telescoping for recurrence
relations, etc. In this special issue, we concentrate on the application
of symbolic algorithms to software science. Topics include but are not
limited to the application of symbolic techniques to:

   * algorithm (program) synthesis
   * algorithm (program) verification
   * termination analysis of algorithms (programs)
   * complexity analysis of algorithms (programs)
   * extraction of specifications from algorithms (programs)
   * generation of inductive assertions for algorithms (programs)
   * algorithm (program) transformations
   * component-based programming
   * querying (e.g. XML)
   * semantic web
   * ...

We expect original articles (typically 15-30 pages; submission of larger
papers will be evaluated depending on editorial constraints) that
present high-quality contributions that have not been previously
published and that must not be simultaneously submitted for publication

Submissions must comply with JSC's author guidelines. They must be
written in English and should be prepared in LaTeX using the "Elsevier
Article Class (elsart.cls)" with "JSC add-on style (yjsco.sty)" and
"Harvard style references (elsart-harv.bst)". The package  "JSC LaTex"
(that contains all the necessary style files and a template) can be
obtained from

The introduction of the paper MUST explicitly address the following
questions in succinct and informal manner:

   * What is the problem?
   * Why is the problem important?
   * What has been done so far on the problem?
   * What is the main contribution of the paper on the problem?
   * Is the contribution original? Explain why.
   * Is the contribution non-trivial? Explain why.

All the main definitions, theorems and algorithms must be illustrated by
simple but meaningful examples.

Without these, the paper will not be considered.

We also encourage tutorials/surveys. They will be reviewed for

  - Quality of Presentation
  - Fair/complete crediting of the people
    who worked on the subject.

It must contain:

  - List of the main problems/questions
  - Motivation/importance
  - Description of main ideas/algorithms/improvements so far
  - List of important open problems
  - Complete bib

The target audience should be "non-expert" on the subject.
(starting PhD students or experts on other subjects).

The problems, ideas, algorithms, etc should be illustrated by
well-chosen examples.

If you plan to submit a tutorial or a survey, make sure that the title
contains a phrase, such as "tutorial on ......."  or "survey of .....", etc.

Submissions to this special issue are hereby encouraged via the
EasyChair submission system:

   * Submission of papers: March 23, 2009.
   * Notification of acceptance/rejection: July 27, 2009.
   * Final version: September 14, 2009.

   * Temur Kutsia (RISC, Johannes Kepler University Linz, Austria)