Submissions (15 pages) can address any programming paradigm, including concurrent, constraint, functional, imperative, logic and object-oriented programming. The proceedings will be published by Springer in the Lecture Notes in Computer Science series. The submission deadline is September 14, 2007.

Guest editors Yaroslav Shramko and Heinrich Wansing have announced a special issue of Studia Logica on truth values. The deadline for submission of manuscripts is October 31, 2008.

The notion of a truth value is among the most important notions of modern symbolic logic and analytic philosophy. It was explicitly introduced by Gottlob Frege, who considered exactly two classical truth values--the True (das Wahre) and the False (das Falsche), which played in his theory the role of references (Bedeutungen) for sentences. In this connection Frege characterized logic as the discipline that should investigate the "most general laws of being true." In modern logic there is an influential tradition of representing logical calculi as systems of truth values (valuational systems). On can mention in this respect Lukasiewicz, Alfred Tarski, and other representatives of the "Polish School."

The purpose of this special issue of Studia Logica is to concentrate on various interrelated aspects of truth-values: philosophical, logical, and algebraic among them. Papers are welcome on the following:

• philosophically elucidate and theoretically explicate the notion of a truth value;
• elaborate general formal tools for a uniform treatment of various logical, mathematical and philosophical aspects of truth values and valuational systems within a joint theoretical framework;
• interpret various logical calculi as valuational systems, develop general methods of formalizing (in axiomatic, sequent, tableau, etc. style) logical theories on the basis of a given system of truth values and examine their syntactic and semantic properties;
• investigate topical problems of many-valued logics, such as Suszko's Thesis, truth value gaps, logical and semantic paradoxes etc.;
• consider possible applications of generalized truth values and generalized truth value functions in various areas of philosophical and mathematical interest.

A workshop will be devoted to the same topic. Selected papers from this workshop will be considered for inclusion in the special issue.

One fully funded Ph.D. studentship is available in the School of Computer Science at the University of Manchester. The anticipated start date is October 2007.

The project forms part of a EPSRC research project on the topic of "Consequence Relations for Logics in AI," conducted in collaboration with the Manchester Metropolitan University and involving Dr Renate Schmidt, Dr Dmitry Tishkovsky and Prof Vladimir Rybakov. The goal of the project is to develop mathematical and computational techniques for studying various aspects of logical consequence relations in logics originating in AI and CS. Primary attention will be on finding general techniques for modeling and studying logical consequence by inference rules and on implementing them with the aim of constructing effective proof systems. While MMU will explore linear temporal logic, multi-modal logics, and logics combining knowledge and time, the PhD project at Manchester will focus on modal and description logics. More specifically, the aim will be to study and develop KE and free-variable tableau decision procedures, to implement the developed tableau approaches and to evaluate them empirically.

The successful applicant is expected to conduct independent research leading to original contributions to the project culminating in a Ph.D. thesis.

The following are the expected qualifications, knowledge, skills, and experience:

• A first class or good upper second class BSc(Hons), strong MSc degree, or equivalent, in an appropriate discipline;
• Background in computer science and/or mathematics, preferably with good working knowledge of logic and/or automated reasoning;
• Programming experience;
• Good communication skills in English, both oral and written.

The studentship is available from October 1, 2007, or a later date by negotiation, for up to three years with a grant of 12,600 pounds per annum (tax free) and fees plus travel money for attending conferences.

To apply for the studentship, please send a detailed CV, copies of transcripts, names of at least two referees (email addresses preferred) and covering letter to

Email submission of PDF and/or plain text are acceptable. The deadline for applications is August 3, 2007. Late applications may be considered.

We call the ANU Logic Summer School "two weeks of wall-to-wall logic." The Logic and Computation group at ANU believe that logic is not just about computers or computer scientists. We say that anything that makes sense can be subjected to logical analysis, which means that this School is attractive to any IT professionals, educators in logic and undergraduate students planning to do research in logic-related fields.

One Summer Scholar had this to say:

"The Summer School did a very fine job of painting a coherent picture of logic as a field, and how it all hangs together. I never read a text book yet that did that for me, and this is one of the things I valued most about the Summer School.'" (Stijn de Saeger, Japan Advanced Institute of Science and Technology, Summer Scholar in 2007)

This is a unique opportunity to learn more about the field of logic from some of the worlds best logicians with state-of-the-art computational science facilities at the ANU. Courses comprise a blend practical and theoretical short courses on aspects of pure and applied logic.

Presenters:

Applications are invited for researcher positions at the Centre for Artificial Intelligence, Universidade Nova de Lisboa, Portugal. Candidates should have at least three years of postdoctoral experience.

The following five-year positions are of particular interest to AAR members:

COGNOMA - Candidates must be knowledgeable in one or more of the following areas: semantic Web; knowledge and reasoning representation; autonomous agents and multiagent systems; machine learning; logic programming; computation and cognitive sciences; epistemological foundations.

BIOINFOBio - Candidates must be knowledgeable in one or more of the following areas and in their application to bioinformatics applications: machine learning and data mining; constraint programming and optimization, simulation (including artificial life), or other artificial intelligence areas.

Please send a curriculum vitae and two letters of reference to

The deadline for application is August 31, 2007.

Dear Member of the Association for Automated Reasoning,

Nominations for four CADE trustee positions are being sought, in preparation for the elections to be held after CADE 2007.

The board of trustees currently comprises the following (in alphabetical order):

Wolfgang Ahrendt (Secretary)
Franz Baader (President, elected 10/2003, reelected 10/2006)
David Basin (elected 10/2004)
Peter Baumgartner (elected 10/2003, reelected 10/2006)
Maria Paola Bonacina (elected 10/2004)
Rajeev Gore (elected 10/2004)
Reiner Haehnle (Vice President, elected 10/2005)
Neil Murray (Treasurer)
Frank Pfenning (CADE-21 Program Chair)
Geoff Sutcliffe (elected 10/2004)
Aaron Stump (elected 10/2006)
Cesare Tinelli (elected 10/2005)

The terms of David Basin, Maria Paola Bonacina, Rajeev Gore, and Geoff Sutcliffe expire. All four are eligible to be nominated for a second term.

The term of office of Frank Pfenning as program chair of CADE-21 also ends. As outgoing ex-officio trustee, he is eligible to be nominated as an elected trustee.