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


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

Book Announcement - Finite Model Theory and Its Applications

Finite Model Theory and Its Applications
Erich Graedel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx,
Joel Spencer, Moshe Y. Vardi, Yde Venema, and Scott Weinstein

Springer, 2007, 437 pages, hardcover,
ISBN: 978-3-540-00428-8.
(Series: Texts in Theoretical Computer Science. An EATCS Series)

From the back cover: This book gives a comprehensive overview of central
topics in finite model theory - expressive power of logics, descriptive
complexity, and zero-one laws - together with selected applications
relating to database theory and artificial intelligence, especially
constraint databases and constraint satisfaction problems. The final
chapter provides a concise modern introduction to modal logic,
emphasizing the interaction with finite model theory. The underlying
theme of the book is the use of  first-order, second-order, fixed-point,
and infinitary logic, as well as various fragments of and hierarchies
within these logics, to gain insight into phenomena and problems in
complexity theory and combinatorics.

The book emphasizes the use of combinatorial games, such as extensions
and refinements of the Ehrenfeucht-Fraissi games, as a powerful way to
analyze the expressive power of logics, and illustrates how sophisticated
notions from model theory and combinatorics, such as o-minimality and
treewidth, arise naturally in the applications of finite model theory
to database theory and artificial intelligence.

Students of logic and computer science will find here the tools
necessary to embark on research into finite model theory, and all
readers will experience the excitement of a vibrant area of the
applications of logic to computer science.

Table of contents:
1.Unifying Themes in Finite Model Theory
2.On the Expressive Power of Logics on Finite Models
3.Finite Model Theory and Descriptive Complexity
4.Logic and Random Structures
5.Embedded Finite Models and Constraint Databases
6.A Logical Approach to Constraint Satisfaction
7.Local Variations on a Loose Theme: Modal Logic and Decidability

To order, see