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

CALL FOR PAPERS: "Satisfiability Modulo Theories", 14-15 July 2011, Utah, USA


SMT Workshop 2011 9th International Workshop on Satisfiability Modulo Theories (affiliated with CAV'11 Snowbird, Utah, USA)


Determining the satisfiability of first-order formulas modulo background theories, known as the Satisfiability Modulo Theories (SMT) problem, has proved to be an enabling technology for verification, synthesis, test generation, compiler optimization, scheduling, and other areas. The success of SMT techniques depends on the development of both domain-specific decision procedures for each background theory (e.g., linear arithmetic, the theory of arrays, or the theory of
bit-vectors) and combination methods that allow one to obtain more versatile SMT tools, usually leveraging Boolean satisfiability (SAT) solvers. These ingredients together make SMT techniques well-suited for use in larger automated reasoning and verification efforts.

Aims and Scope
The aim of the workshop is to bring together researchers and users of SMT tools and techniques. Relevant topics include but are not limited to:

* New decision procedures and new theories of interest
* Combinations of decision procedures
* Novel implementation techniques
* Benchmarks and evaluation methodologies
* Applications and case studies
* Theoretical results

Papers on pragmatic aspects of implementing and using SMT tools, as well as novel applications of SMT, are especially encouraged.

Important dates
* Submission deadline                  -  April 15, 2011
* Notification of acceptance/rejection -  May 20, 2011
* Final version due                    -  June 10, 2011
* Workshop:                            -  July 14-15, 2011

Paper submission and Proceedings

Three categories of submissions are invited:

* Original papers: contain original research (simultaneous submissions
   are not allowed) and sufficient detail to assess the merits and
   relevance of the submission. For papers reporting experimental
   results, authors are strongly encouraged to make their data
   available. Given the informal style of the workshop, papers describing
   work in progress, with sufficient detail to assess the contribution,
   are also welcome.

* Extended abstracts: contain preliminary reports of work in progress.
   These will be judged based on the expected level of interest for the
   SMT community.  They will be included in the informal proceedings.

* Presentation-only papers: describe work recently published or
   submitted and will not be included in the proceedings.  We see this
   as a way to provide additional access to important developments that
   SMT Workshop attendees may be unaware of.

Papers in all three categories will be peer-reviewed. Papers should not exceed 10 pages (Postscript or PDF) and should be written in LaTeX, 11pt, one column, letter-size paper, standard margins. Technical details may be included in an appendix to be read at the reviewers' discretion.

Workshop Chairs
* Shuvendu K. Lahiri   (Microsoft Research)
* Sanjit A. Seshia         (University of California, Berkeley)

Program Committee
* Clark Barrett                     (NYU)
* Maria Paola Bonacina   (Univ. of Verona)
* Alessandro Cimatti        (FBK Trento)
* Scott Cotton                    (Univ. College Dublin)
* Bruno Dutertre              (SRI International)
* Martin Frnzle                (Carl von Ossietzky Universitt Oldenburg)
* Vijay Ganesh                   (MIT)
* Amit Goel                         (Intel)
* Franjo Ivancic                 (NEC Labs)
* Daniel Kroening             (Oxford)
* Andreas Kuehlmann    (Coverity)
* Shuvendu K. Lahiri        (Microsoft Research)
* Leonardo de Moura    (Microsoft Research)
* Sanjit A. Seshia              (University of California, Berkeley)
* Ofer Strichman              (Technion)
* Cesare Tinelli                  (Iowa)