[FOM] [CiE] Newsletter No.40, October 18, 2010

CiE cie at maths.leeds.ac.uk
Mon Oct 18 18:42:48 EDT 2010


CiE Newsletter No.40, October 18, 2010:

*** IMPORTANT INFORMATION: Olivier Bournez will 
be taking over production of the CiE Newsletter 
from the next issue - please send any items you would like included to:

Olivier Bournez <bournez at lix.polytechnique.fr>

DEADLINE: November 5th, 2010

*** COMPUTABILITY IN EUROPE 2011 "Models of 
Computation in Context", Sofia, Bulgaria, 27 June - 2 July:

For the latest news on CiE 2011 in Sofia, go to:
http://cie2011.fmi.uni-sofia.bg/

The list of plenary speakers can be found at:
http://cie2011.fmi.uni-sofia.bg/?q=node/19

And current details of the Special Sessions at:
http://cie2011.fmi.uni-sofia.bg/?q=node/16

For information on how to submit papers see:
http://cie2011.fmi.uni-sofia.bg/?q=node/20

The EasyChair submission page is at:
http://www.easychair.org/conferences/?conf=cie2011

And the CiE 2011 submission deadline is January 14, 2011

___________________________________________________________________________
CONTENTS:

1. International Conference, History and 
Philosophy of Computing, Gent University, Belgium - first announcement

2. Annals of Pure and Applied Logic - Special 
Issue on Classical Logic and Computation

3. Kurt Goedel Research Prize Fellowships Program

4. Ackermann Award 2011 - Call for Nominations

5. 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011)

6. Federated Conference on Rewriting, Deduction, 
and Programming (RDP 2011), Novi Sad, Serbia

7. 5th International Conference on Language and 
Automata Theory and Applications (LATA 2011), Tarragona, Spain

8. TABLEAUX 2011 - Automated Reasoning with 
Analytic Tableaux and Related Methods, Bern, Switzerland, 4 July - 8 July 2011

9. In memoriam 'Fractal' mathematician Benoit Mandelbrot


=========================================================================== 
=========================================================================== 
1. (from Liesbeth de Mol and Giuseppe Primero) 
International Conference, History and Philosophy 
of Computing, Gent University, Belgium - first announcement:

International Conference,
History and Philosophy of Computing
November 7 - 10, 2011
Gent University, Belgium
http://www.computing-conference.ugent.be

First announcement

 From 7-10 November 2011 the Centre for Logic and Philosophy of
Science organizes an International Conference on the History and
Philosophy of Computing.

Topics of the conference include:

  *  The birth, evolution and future of computation

  *  Philosophical, foundational and practical issues of computability
     in logic, mathematics and computer science

  *  Computation in the sciences

More details on deadlines and submissions can be found at:
http://www.computing-conference.ugent.be

INVITED SPEAKERS:
Bill Aspray (University of Texas)
Martin Davis (New York University)
Fairouz Kamareddine (Heriot-Watt University Edinburgh)
Sybille Kraemer (Freie Universitaet Berlin)
Giovanni Sambin (Universita' di Padova)
Raymond Turner (University of Essex)

CONFERENCE CHAIRS:
Liesbeth De Mol and Giuseppe Primiero

PROGRAMME COMMITTEE:
G. Alberts (Amsterdam)
S. Artemov (New York)
M. Campbell-Kelly (Warwick)
A. Eden (Essex)
L. Floridi (Oxford & Hertfordshire)
R. Kahle (Lisbon)
B. Loewe (Amsterdam)
J. Meheus (Ghent)
E. Myin (Antwerp)
S. Negri (Helsinki)
V. de Paiva (Palo Alto)
S. Smets (Groningen)
G. Sundholm (Leiden)
C. Toffalori (Camerino)
J.P. van Bendegem (Brussels)
M. van Dyck (Ghent)
B. van Kerkhove (Brussels & Hasselt)
E. Weber (Ghent)

SUPPORT
A number of Students Grants will be available through our Sponsor and
Supporting Associations. More details to come on the webpage of the
conference.


=========================================================================== 
===========================================================================
2. (from Ulrich Berger) Annals of Pure and 
Applied Logic - Special Issue on Classical Logic and Computation:

************************************************************

               ANNALS OF PURE AND APPLIED LOGIC
                   THIRD SPECIAL ISSUE ON
               CLASSICAL LOGIC AND COMPUTATION
                         CL&C 2010

************************************************************

                      CALL FOR PAPERS
                      ===============

     Contributions on the topic of Classical Logic and
     Computation are invited for a special issue of Annals of
     Pure and Applied Logic. On August 22, 2010, the third
     workshop on "Classical Logic and Computation" took place
     in Brno - Czech Republic, as a satellite meeting of
     MFCS/CSL 2010. The workshop covered a broad range of work
     aiming to explore computational aspects of classical logic
     and mathematics. The special issue is first of all set up
     for extended versions of papers presented at the workshop,
     but the call is open to all researchers.

TOPICS

     Topics of interest for contributions to the journal
     issue include, but are not limited to:

        - logic and type theory,
        - programming language design,
        - verification,
        - witness extraction from classical proofs,
        - game semantic of classical logic,

SUBMISSIONS

     Submissions must be original work which has not been
     previously published in a journal and is not being
     considered for publication elsewhere. If related
     material has appeared in a refereed conference
     proceedings, the manuscript submitted should be
     substantially more complete or otherwise different.

     The title page must include: full title, authors' full
     names and affiliations, and the address to which
     correspondence and  proofs should be sent. Where possible,
     e-mail address and telephone number should be included.
     This should be followed by an abstract of approximately
     300 words and five key words for indexing.

IMPORTANT

     All source files of the final versions of the accepted
     papers must respect the format of APAL. In order to make
     a submission, please follow the instructions at

http://www.elsevier.com/wps/find/journaldescription.cws_home/505603/authorinstructions

     Please upload a .pdf file to the following easy chair link

     >>> TO BE INSERTED <<<

     Deadline for the submission of a title page
     indicating the intent to submit:             December 15, 2010
     Deadline for paper submission:               January 15, 2011
     Notification of acceptance:                  April 15, 2011
     Final version due:                           June 15, 2011

     Guest editors:

     Steffen van Bakel, Imperial College, London, UK
     Stefano Berardi, Universita` di Torino, Italy
     Ulrich Berger, Swansea University, UK

     Contact: u.berger at swansea.ac.uk


=========================================================================== 
===========================================================================
3. (from Matthias Baaz) Kurt Goedel Research Prize Fellowships Program:

KURT GOEDEL RESEARCH PRIZE FELLOWSHIPS

The Kurt Goedel Society is proud to announce the 
commencement of the second round of the
Kurt Goedel Research Prize Fellowships Program.

The research fellowship prize program is 
sponsored by the John Templeton Foundation and will offer:

      * two Ph.D. (pre-doctoral) fellowships of EUR 100,000
      * two post-doctoral fellowships of EUR 100,000  and
      * one unrestricted fellowship of EUR 100,000

One International Board of Jurors will be in 
charge of evaluating the applications and determining up to
twenty finalists whose papers will be published 
in a special issue of the Annals of Pure and Applied Logic,
and another international Board of Jurors will be 
in charge of determining the winners. Both Boards 
will be chaired by Prof. Harvey Friedman, Ohio State University (USA).

Board of Jurors for Determining the Finalists

      * Jeremy AVIGAD, Carnegie Mellon University, (USA)
      * Lenore BLUM, Carnegie Mellon University, (USA)
      * Harvey FRIEDMAN, Ohio State University (USA) CHAIR
      * John HARRISON, Intel Corporation, (USA)
      * Kenneth KUNEN, University of Wisconsin, (USA)
      * Angus MACINTYRE, Queen Mary, University of London and Royal
        Society, (UK)
      * Hiroakira ONO, JAIST Research Center for Integrated Science, (JAPAN)
      * Pavel PUDLAK, Czech Academy of Sciences, (Czech Republic)
      * Michael RATHJEN, University of Leeds, (UK)
      * Frank STEPHAN, National University of Singapore, (SINGAPORE)
      * William TAIT, University of Chicago, (USA)
      * Simon THOMAS, Rutgers University, (USA)
      * Albert VISSER, University of Utrecht (NL)
      * Andreas WEIERMANN, Ghent University, (BELGIUM)
      * Boris ZILBER, University of Oxford, (UK)

Board of Jurors for Determining the Winners

      * Lev BEKLEMISHEV, Russian Academy of Sciences (RUS)
      * Harvey FRIEDMAN, Ohio State University (USA) CHAIR
      * Dov M. GABBAY, King's College London (UK)
      * Warren D. GOLDFARB, Harvard University (USA)
      * Howard Jerome KEISLER, University of Wisconsin (USA)

Goal and Criteria of Merit

The purpose of these fellowships is to support 
original research in, and areas surrounding, the 
foundations of mathematics. (See Scope below for 
more details.) These fellowships are intended to 
carry forward the legacy of Kurt Goedel, whose 
works exemplify deep insights and breakthrough 
discoveries in mathematical logic, with profound 
impact on the philosophy and foundations of 
mathematics. In pursuit of similar insights and 
discoveries, we adopt the following criteria of 
merit for evaluating Fellowship applications:

     1. Intellectual merit, scientific rigor and 
originality of the submitted paper and work plan. 
The paper and research plans should combine 
visionary thinking with academic and scientific excellence.
     2. Potential for significant contribution to 
basic fundamental issues of wide interest, and 
the likelihood for opening new, seminal lines of 
inquiry that bear on such issues.
     3. Impact of the Fellowship on the project 
and likelihood that the Fellowship will make the 
proposed new lines of research possible.
     4. The expectation that the proposed research will be successful.
     5. Qualifications of the applicants will be 
evaluated on the basis of all available 
information including CV, research paper, 
research plans, research accomplishments, and 
letters of recommendation (recommendation letters 
are not required for senior applications).


Winners' Model Projects:
http://fellowship.logic.at/2010/files/Bovykin_Project.pdf
http://fellowship.logic.at/2010/files/Koellner_Project.pdf
Model Questions
http://fellowship.logic.at/index.php?questions

Scope

Original fellowship proposals in the areas of

    	* set theory
  	* recursion theory
  	* proof theory/intuitionism
  	* model theory
  	* computer assisted reasoning
  	* philosophy of mathematics

All fellowship proposals, regardless of subject 
area, will be judged according to

      * the relevance and resemblance of the research (finished and
        proposed) to the great insights and originality of Kurt Goedel
      * its general interest and clarity of motivation
      * its rigorous scientific quality and depth.

Submission Instructions

The three categories of fellowships are specified as follows:
*Ph.D.(pre-doctoral): being in the stage before finishing the thesis (or
  equivalent achievements)
*Post-doctoral: being in the stage within 10 years after finishing the
  thesis (or equivalent achievements)
*Unrestricted: also open to senior applicants

The submission must consist of:

- one document A in PDF format containing
    . the CV
    . the project description
    . the recommendation letters
- one document B in PDF format containing the article
- one text abstract relating to B
Maximum allowed length of the abstract is 500 words.

Document A containing the CV, the project 
description, and the recommendation letters must 
be prepared in the following way:
- minimum font size: 10pt
- paper size: A4
- maximum length of the CV: 3 pages
The CV must contain the list of all/most important publications.
The CV must clearly state to which category the application belongs.
- maximum length of project description: 4 pages
Project description should clearly state where 
and at which institution the applicant intends to carry out the project.
- minimum 2(two)/maximum 3 (three) 1-page 
recommendation letters,in case of applications 
belonging to the categories Ph.D.(pre-doctoral) and post-doctoral fellowships.
    (The recommendation letters should be scanned 
and included into the PDF document)

The submission must be in English.

The Board and the Program Chair reserve the right:
.to consider only submissions with reasonable format
.to reassign a submission to another category as applied for.
The applicant will be informed about the reasons for such a
decision.

Submission Page

The EasyChair system is used for managing the submissions.

For submitting a proposal please go to 
http://www.easychair.org/conferences/?conf=kgrpf10

Timeline

November 15, 2010. 	Submissions deadline
February 28, 2011. 	Jury decision on the papers for publication (at most 20)
March 1, 2011. 		Final versions due
March 6, 2011. 		Jury decision on winners due
April 28-30, 2011. 	Conference and the Award Ceremony
June-October, 2011. 	Commencement of the Fellowships

Web:http://fellowship.logic.at

E-mail contact: goedel-fellowship at logic.at


=========================================================================== 
===========================================================================
4. (from Johann Makowsky) Ackermann Award 2011 - Call for Nominations:

ACKERMANN AWARD 2011 - THE EACSL OUTSTANDING DISSERTATION AWARD
                                         FOR LOGIC IN COMPUTER SCIENCE
    CALL FOR NOMINATIONS
* Eligible for the 2011 Ackermann Award are PhD dissertations in topics
  specified by the EACSL and LICS conferences, which were formally
  accepted as PhD theses at a university or equivalent institution
  between 1.1.2009 and 31.12. 2010.
* Submission details are available at
     http://www.eacsl.org/submissionsAck.html
* The deadline for submission is March 15, 2011
  Nominations can be submitted from January 1, 2011 on,
  and should be sent to the secretary of the Jury by e-mail:
                janos at cs.technion.ac.il
* The award consists of
     - a diploma,
     - an invitation to present the thesis at the CSL conference,
     - the publication of the abstract of the thesis and the laudation
       in the CSL proceedings,
     - travel support to attend the conference.
* The 2011 Ackermann Award will be presented to the recipients at the
  annual conference of the EACSL (CSL'11) in Bergen (Norway)
  to be held 12-15 September 2011,
        www.eacsl.org/csl11/
* The jury consists of at least 7  members (additions still likely):
     - The president of EACSL, D. Niwinski (Warsaw)
     - The vice-president of EACSL, A. Dawar (Cambridge)
     - One member of the LICS Steering Committee, NN
     - A. Atserias (Barcelona)
     - T. Coquand (Goeteborg)
     - P.-L. Curien (Paris)
     - A. Durand (Paris)
  J. Makowsky (Haifa), member of the board of EACSL, will act as the
  secretary of the Jury.
* The jury is entitled to give more (and less) than one award per year.
* The previous Ackermann Award recipients were:
  2005: Mikolaj Bojanczyk, Konstantin Korovin, Nathan Segerlind;
  2006: Stefan Milius and Balder ten Cate;
  2007: Dietmar Berwanger, Stephane Lengrand and Ting Zhang;
  2008: Krishnendu Chatterjee;
  2009: Jakob Nordstrom;
  2010: ---- (The Jury decided that no Award is given).
* For the four years 2010-2013,
  the Ackermann Award is sponsored by the Kurt Goedel Society


=========================================================================== 
===========================================================================
5. (from Stephan Kreutzer) 26th Annual IEEE 
Symposium on Logic in Computer Science (LICS 2011):

26TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2011)
    Fields Institute and the University of Toronto
    June 21-24, 2011
    Call for Workshop Proposals
* The twenty-sith IEEE Symposium on Logic In Computer Science (LICS
2011) will be held in Toronto, Canada, 21-24 June 2011. Possible dates
for workshops are Monday 20th June and Saturday 25th June, 2011 (i.e.,
one day before and one day after LICS).
* Researchers and practitioners are invited to submit proposals for
workshops on topics relating logic - broadly construed - to computer
science or related elds. Typically, LICS workshops feature a number of
invited speakers and a number of contributed presentations. LICS
workshops do not usually produce formal proceedings. However, in the
past there have been special issues of journals based in part on
certain LICS workshops.
* Proposals should include:
  - A short scientific summary and justification of the proposed
    topic. This should include a discussion of the particular
    benefitts of the topic to the LICS community.
  - A discussion of the proposed format and agenda.
  - The proposed duration, which is typically one day (two-day
    workshops can be accommodated too).
  - Your preferred dates. This is important!
  - Procedures for selecting participants and papers.
  - Expected number of participants. This is important!
  - Potential invited speakers.
  - Plans for dissemination (for example, special issues of journals).
  - Proposals are due on the 16th November 2010, and should be
    submitted electronically to the Workshops Chairs:
    o Adriana Compagnoni: abc at cs.stevens.edu
    o Maribel Fernandez: Maribel.Fernandez at kcl.ac.uk
* Notifications will be sent by the 15th December 2010.
  The Workshops Selection Committee consists of
  - the LICS General Chair,
  - LICS Workshops Chairs,
  - LICS 2011 PC Chair and
  - LICS 2011 Conference Co-Chairs.


=========================================================================== 
===========================================================================
6. (from Luca Paolini) Federated Conference on 
Rewriting, Deduction, and Programming (RDP 2011), Novi Sad, Serbia:

Federated Conference on Rewriting, Deduction, and Programming
                                 RDP 2011
                 29/5/2011 - 3/6/2011, Novi Sad, Serbia

                           Call For Workshop Proposals

RDP 2011 is a federated event comprising two major conferences:
- The 22nd International Conference on Rewriting Techniques and
  Applications (RTA'09)
- The 10th International Conference on Typed Lambda Calculi and
  Applications (TLCA'09).

Previous RDPs were held in 2003 in Valencia (Spain), 2004 in Aachen
(Germany),
2005 in Nara (Japan), 2007 in Paris (France) and 2009 in Brasilia
(Brasil).
RDP has a tradition of federating every two years RTA and TLCA, and of
hosting
related workshops.

We solicit proposals for satellite workshops of RDP 2011 that are
related in topics to one or both of the RDP conferences.

Workshops should have a length of 1 or 2 days (possibilities for
longer workshops should be discussed with the organizers). It is
tradition at RDP that attendance to workshops is open to participants of
parallel events, similar to the way FLoC workshops are run. There will
be one day (Sunday, May 29, 2011) reserved for workshops, however, it
will
also be possible to run workshops on the other days in parallel to one
of the main conferences.

RDP will provide the possibility to print workshop proceedings,
details of the procedure will be posted later by the local organizing
committee. RDP will not be able to reimburse invited workshop speakers
for travel or living expenses, though it may be possible to waive part
of the registration fees for invited speakers. The priority of RDP will
be to keep registration fees for the conferences and workshops low.

Please submit your workshop proposal by email to

     rdp2011-workshop at uns.ac.rs

Proposals should be written in plain text. The proposal should cover the
following topics:
  1. Name of workshop
2. A statement of the topics and goals of the workshop
3. Names and addresses of the organizers
4. Pointers to descriptions of previous editions of the workshop, if any
5. A description of the submission selection process
6. Plans for the publication of proceedings (informal proceedings
   distributed to participants, electronic journal,  proceedings with
   separate selection process, ...)
7. Plans for invited speakers or special sessions (round-table
   discussion, tutorials, ...)
8. Expected length of the workshop
9. Expected number of attendees
10. Any special needs (for system demonstrations ...)

The Workshop Selection Committee consists of
Luke Ong (TLCA 2011 program chair)
Manfred Schmidt-Schauss (RTA 2011 program chair)
Silvia Ghilezan (RDP 2011 general chair).

       -------------------------------------------------------
       |November 19, 2010 | deadline for proposals    |
       -------------------------------------------------------
       |November 30, 2010 | notification of acceptance|
       --------------------------------------------------------

Prospective workshop organizers are welcome to contact the workshop
selection committee in advance before sending in a formal submission and
to discuss any questions.

RDP'09 http://rdp09.cic.unb.br/
RDP'07 http://www.lsv.ens-cachan.fr/rdp07/index.html
RDP'05 http://www.kurims.kyoto-u.ac.jp/rdp05/
RDP'03 http://www.dsic.upv.es/~rdp03/
RTA    http://rewriting.loria.fr/rta/
TLCA   http://www.mimuw.edu.pl/tlca/


=========================================================================== 
===========================================================================
7. (from Carlos Martin) 5th International 
Conference on Language and Automata Theory and Applications (LATA 2011):

*********************************************************************
1st Call for Papers

5th INTERNATIONAL CONFERENCE ON LANGUAGE AND 
AUTOMATA THEORY AND APPLICATIONS (LATA 2011)
Tarragona, Spain, May 30 - June 3, 2011

http://grammars.grlmc.com/LATA2011/
*********************************************************************

AIMS:

LATA is a yearly conference in theoretical 
computer science and its applications. Inheriting 
the tradition of the International PhD School in 
Formal Languages and Applications that was 
developed at Rovira i Virgili University in the 
period 2002-2006, LATA 2011 will reserve 
significant room for young scholars at the 
beginning of their career. It will aim at 
attracting contributions from both classical 
theory fields and application areas 
(bioinformatics, systems biology, language 
technology, artificial intelligence, etc.).

SCOPE:

Topics of either theoretical or applied interest 
include, but are not limited to:

- algebraic language theory
- algorithms for semi-structured data mining
- algorithms on automata and words
- automata and logic
- automata for system analysis and programme verification
- automata, concurrency and Petri nets
- cellular automata
- combinatorics on words
- computability
- computational complexity
- computational linguistics
- data and image compression
- decidability questions on words and languages
- descriptional complexity
- DNA and other models of bio-inspired computing
- document engineering
- foundations of finite state technology
- fuzzy and rough languages
- grammars (Chomsky hierarchy, contextual, 
multidimensional, unification, categorial, etc.)
- grammars and automata architectures
- grammatical inference and algorithmic learning
- graphs and graph transformation
- language varieties and semigroups
- language-based cryptography
- language-theoretic foundations of artificial intelligence and artificial life
- neural networks
- parallel and regulated rewriting
- parsing
- pattern recognition
- patterns and codes
- power series
- quantum, chemical and optical computing
- semantics
- string and combinatorial issues in computational biology and bioinformatics
- string processing algorithms
- symbolic dynamics
- term rewriting
- transducers
- trees, tree languages and tree machines
- weighted machines

STRUCTURE:

LATA 2011 will consist of:

- 3 invited talks
- 2 invited tutorials
- refereed contributions
- open sessions for discussion in specific 
subfields, on open problems, or on professional 
issues (if requested by the participants)

INVITED SPEAKERS:

To be announced

PROGRAMME COMMITTEE:

Andrew Adamatzky (Bristol)
Cyril Allauzen (Mountain View)
Amihood Amir (Ramat-Gan)
Franz Baader (Dresden)
Marie-Pierre Béal (Marne-la-Vallée)
Philip Bille (Lyngby)
Miklos Bona (Gainesville)
Symeon Bozapalidis (Thessaloniki)
Vasco Brattka (Cape Town)
Maxime Crochemore (London)
James Currie (Winnipeg)
Jurgen Dassow (Magdeburg)
Cunsheng Ding (Hong Kong)
Rodney Downey (Wellington)
Manfred Droste (Leipzig)
Enrico Formenti (Nice)
Amy Glen (Perth)
Serge Haddad (Cachan)
Shunsuke Inenaga (Fukuoka, co-chair)
Jesper Jansson (Tokyo)
Jarkko Kari (Turku)
Marek Karpinski (Bonn)
Maciej Koutny (Newcastle)
Gregory Kucherov (Lille)
Markus Lohrey (Leipzig)
Benedikt Loewe (Amsterdam)
Salvador Lucas (Valencia)
Sebastian Maneth (Sydney)
Carlos Martin-Vide (Brussels, co-chair)
Giancarlo Mauri (Milano)
Alexander Meduna (Brno)
Kenichi Morita (Hiroshima)
Sven Naumann (Trier)
Gonzalo Navarro (Santiago, CL)
Mark-Jan Nederhof (St Andrews)
Joachim Niehren (Lille)
Joakim Nivre (Uppsala)
Kemal Oflazer (Doha)
Alexander Okhotin (Turku)
Witold Pedrycz (Edmonton)
Dominique Perrin (Marne-la-Vallée)
Giovanni Pighizzini (Milano)
Alberto Policriti (Udine)
Lech Polkowski (Warsaw)
Helmut Prodinger (Stellenbosch)
Mathieu Raffinot (Paris)
Philippe Schnoebelen (Cachan)
Ayumi Shinohara (Sendai)
Jamie Simpson (Perth)
Magnus Steinby (Turku)
James Storer (Boston)
Jens Stoye (Bielefeld)
Andrzej Tarlecki (Warsaw)
Richard Thomas (Leicester)
Gyorgy Vaszil (Budapest)
Heiko Vogler (Dresden)
Pascal Weil (Bordeaux)
Damien Woods (Pasadena)
Thomas Zeugmann (Sapporo)

ORGANIZING COMMITTEE:

Adrian Horia Dediu (Tarragona)
Shunsuke Inenaga (Fukuoka, co-chair) Carlos 
Martin-Vide (Brussels, co-chair) Bianca Truthe (Magdeburg)

SUBMISSIONS:

Authors are invited to submit papers presenting 
original and unpublished research. Papers should 
not exceed 12 single-spaced pages and should be 
formatted according to the standard format for 
Springer Verlag's LNCS series (see 
http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0). 
Submissions have to be uploaded at:

http://www.easychair.org/conferences/?conf=lata2011

PUBLICATIONS:

A volume of proceedings published by Springer in 
the LNCS series will be available by the time of the conference.

A special issue of a major journal will be later 
published containing refereed extended versions 
of some of the papers contributed to the 
conference. Submissions to it will be by invitation.

REGISTRATION:

The period for registration will be open since 
October 13, 2010 until May 30, 2011. The 
registration form can be found at the website of 
the conference: http://grammars.grlmc.com/LATA2011/

Early registration fees: 500 Euro
Early registration fees (PhD students): 400 Euro
Late registration fees: 540 Euro
Late registration fees (PhD students): 440 Euro
On-site registration fees: 580 Euro
On-site registration fees (PhD students): 480 Euro

At least one author per paper should register. 
Papers that do not have a registered author who 
paid the fees by February 28, 2011 will be excluded from the proceedings.

Fees comprise access to all sessions, one copy of 
the proceedings volume, coffee breaks and lunches.

PhD students will need to prove their status on site.

PAYMENT:

Early (resp. late) registration fees must be paid 
by bank transfer before February 28, 2011 (resp. 
May 16, 2011) to the conference series account at 
Uno-e Bank (Julián Camarillo 4 C, 28037 Madrid, Spain):

IBAN: ES3902270001820201823142 - Swift code: 
UNOEESM1 (account holder: Carlos Martin-Vide  LATA 2011).

Please write the participant's name in the 
subject of the bank form. Transfers should not 
involve any expense for the conference. Please 
notice that the date that counts is the day when 
the transfer reached the conference~Rs account.

On-site registration fees can be paid only in 
cash. A receipt for payments will be provided on site.

Besides paying the registration fees, it is 
required to fill in the registration form at the website of the conference.

IMPORTANT DATES:

Paper submission: January 3, 2011
Notification of paper acceptance or rejection: February 14, 2011
Early registration: February 28, 2011
Final version of the paper for the LNCS proceedings: February 28, 2011
Late registration: May 16, 2011
Starting of the conference: May 30, 2011
Submission to the post-conference special issue: August 30, 2011

FURTHER INFORMATION:

florentinalilica.voicu at urv.cat

POSTAL ADDRESS:

LATA 2011
Research Group on Mathematical Linguistics
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain

Phone: +34-977-559543
Fax: +34-977-558386


=========================================================================== 
===========================================================================
8. (from George Metcalfe) TABLEAUX 2011 - 
Automated Reasoning with Analytic Tableaux and Related Methods:

                    First Call for Papers,
                   Call for Tutorials, and
                 Call for Workshop Proposals
                        TABLEAUX 2011

                  International Conference

                       TABLEAUX 2011
                   Automated Reasoning with
             Analytic Tableaux and Related Methods

                     Bern, Switzerland
                    4 July - 8 July 2011
              http://www.tableaux11.unibe.ch/

IMPORTANT DATES

Workshop & Tutorial submission:      Monday, 10 Jan 2011
Workshop & Tutorial notification:    Monday, 24 Jan 2011

Abstract and Title submission:       Monday, 24 Jan 2011
Paper Submission:                    Monday, 31 Jan 2011
Notification:                        Monday, 28 Mar 2011
Final Versions:                      Monday, 25 Apr 2011

Workshops:         Monday, 4 July 2011
Conference:        Tuesday, 5 July - Friday, 8 July 2011


GENERAL INFORMATION

     This conference is the 20th in a series of international meetings on
     Automated Reasoning with Analytic Tableaux and Related Methods.

     In July 2011, the conference will be held in Bern, Switzerland.  The
     conference proceedings will be published in the Springer LNAI series as
     in the previous editions of the conference.

     See http://www.tableaux11.unibe.ch/ for more information on TABLEAUX
     2011, and http://i12www.ira.uka.de/TABLEAUX for information about
     the TABLEAUX conference series.


TOPICS

     Tableau methods are a convenient formalism for automating deduction
     in various non-standard logics as well as in classical logic. Areas
     of application include verification of software and computer
     systems, deductive databases, knowledge representation and its
     required inference engines, and system diagnosis. The conference
     brings together researchers interested in all aspects - theoretical
     foundations, implementation techniques, systems development and
     applications - of the mechanization of reasoning with tableaux and
     related methods.

     Topics of interest include (but are not restricted to):

       * analytic tableaux for various logics (theory and applications)
       * related techniques and concepts, e.g., model checking and BDDs
       * related methods (model elimination, sequent calculi,
         connection method, ...)
       * new calculi and methods for theorem proving in classical and
         non-classical logics (modal, description, intuitionistic, linear,
         temporal, many-valued...)
       * systems, tools, implementations and applications.

     As in previous years, TABLEAUX 2011 puts a special emphasis on
     applications. Papers describing applications of tableaux and related
     methods in areas such as hardware and software verification,
     semantic technologies, knowledge engineering, etc. are particularly
     invited.

     One or more tutorials will be part of the conference program.

SUBMISSIONS

     The conference will include contributed papers, tutorials, system
     descriptions, position papers and invited lectures. Submissions are
     invited in four categories:

       A  Research papers (reporting original theoretical and/or experimental
                           research, up to 15 pages)
       B  System descriptions (up to 5 pages)
       C  Short papers reporting work in progress (up to 5 pages)
       D  Tutorials in all areas of analytic tableaux and related methods
          from academic research to applications (proposals up to 5 pages)

     Submissions in categories A and B will be reviewed by peers,
     typically members of the program committee. They must be unpublished
     and not submitted for publication elsewhere.  For category B
     submissions a working implementation must exist and be available to
     the referees.  Accepted papers in these categories will be published in
     the conference proceedings.

     Submissions in category C will be reviewed by members of the program
     committee and a collection of the accepted papers in this category
     will be published as a Technical Report of the University of Bern.

     Tutorial submissions (Category D) may be at introductory,
     intermediate, or advanced levels. Novel topics and topics of broad
     interest are preferred. The submission should include the title, the
     author, the topic of the tutorial, its level, its relevance to
     conference topics, and a description of the interest and the
     scientific contents of the proposed tutorial. Tutorial proposals
     will be reviewed by members of the program committee.  Note that the
     deadline for tutorial proposals is  Monday, 10. Jan 2011.

     Authors of accepted papers are expected to present their work at the
     conference.

CALL FOR WORKSHOP PROPOSALS

     TABLEAUX 2011 launches a Call for Workshop Proposal on specialised
     subjects in the range of the conference topics. We can accept up to
     three proposals.  The proposals are reviewed by members of the PC
     committee. The purpose of a workshop is to offer an opportunity of
     presenting novel ideas, ongoing research, and to discuss the state
     of the art of an area in a less formal but more focused way than the
     conference itself. It is also a good opportunity for young
     researchers to present their own work and to obtain feedback. The
     format of a workshop is left to the the organizers, but it is
     expected to contain significant time for discussion. The intended
     schedule is for one-day workshops.

     To submit a workshop proposal, please send a description of one or
     two pages to the PC chairs by Monday, 10. Jan 2011.

INVITED SPEAKERS

     We are pleased to announce that the following speakers have agreed
     to give invited talks at TABLEAUX 2011:

      * Maria Paola Bonacina, University of Verona, Italy
      * Ulrich Furbach, University of Koblenz-Landau, Germany
      * Kazushige Terui, Kyoto University, Japan

PROGRAM COMMITTEE

     PC Chairs

      * Kai Brünnler, University of Bern, Switzerland
      * George Metcalfe, University of Bern, Switzerland

     PC Members

      * Arnon Avron, Tel Aviv University, Israel
      * Peter Baumgartner, NICTA, Canberra, Australia
      * Bernhard Beckert, Karlsruhe Institute of Technology, Germany
      * Torben Braüner, Roskilde University, Denmark
      * Agata Ciabattoni, TU Wien, Austria
      * Marta Cialdea, University of Rome 3, Italy
      * Roy Dyckhoff, University of St Andrews, Scotland
      * Martin Giese, University of Oslo, Norway
      * Valentin Goranko, Technical University of Denmark
      * Rajeev Goré, The Australian National University, Canberra, Australia
      * Reiner Hähnle, Chalmers University, GÃ~C¶teborg, Sweden
      * Ullrich Hustadt, University of Liverpool, UK
      * Martin Lange, University of Kassel, Germany
      * Dale Miller, INRIA, Saclay, France
      * Neil V. Murray, University at Albany - SUNY, USA
      * Nicola Olivetti, Paul CÃ~C©zanne University, Marseille, France
      * Jens Otten, University of Potsdam, Germany
      * Dirk Pattinson, Imperial College London, UK
      * André Platzer, Carnegie Mellon University, USA
      * Renate Schmidt, University of Manchester, UK
      * Viorica Sofronie-Stokkermans, MPI, SaarbrÃ~CÅ~Rcken, Germany
      * Ulrich Ultes-Nitsche, Fribourg University, Switzerland
      * Luca Viganò, University of Verona, Italy
      * Arild Waaler, University of Oslo, Norway

ORGANIZING COMMITTEE

     Conference Chairs:

      * Kai Brünnler, University of Bern, Switzerland
      * George Metcalfe, University of Bern, Switzerland

     Local Organizers:

      * Samuel Bucheli
      * Lukas Gerber
      * Roman Kuznets
      * Richard McKinley
      * Nia Stephens


=========================================================================== 
===========================================================================
9. (from Vladik Kreinovich) In memoriam 'Fractal' 
mathematician Benoit Mandelbrot:

'Fractal' mathematician Benoit Mandelbrot dies aged 85

http://www.bbc.co.uk/news/world-europe-11560101

Benoit Mandelbrot, who discovered mathematical 
shapes known as fractals, has died of cancer at the age of 85.

Mandelbrot, who had joint French and US 
nationality, developed fractals as a mathematical 
way of understanding the infinite complexity of nature.

The concept has been used to measure coastlines, 
clouds and other natural phenomena and had 
far-reaching effects in physics, biology and astronomy.

Mandelbrot's family said he had died in a hospice in Cambridge, Massachusetts.

The visionary mathematician was born into a 
Jewish family in Poland but moved to Paris at the 
age of 11 to escape the Nazis.

He spent most of his life in the US, working for 
IBM computers and eventually became a professor 
of mathematical science at Yale University.

His seminal works, Fractals: Form, Chance and 
Dimension and The Fractal Geometry of Nature, 
were published in 1977 and 1982. In these, he 
argued that seemingly random mathematical shapes 
in fact followed a pattern if broken down into a single repeating shape.

The concept enabled scientists to measure 
previously immeasurable objects, including the 
coastline of the British Isles, the geometry of a lung or a cauliflower.

"If you cut one of the florets of a cauliflower, 
you see the whole cauliflower but smaller," he 
explained at the influential Technology 
Entertainment and Design (TED) conference earlier this year.

"Then you cut again, again, again, and you still 
get small cauliflowers. So there are some shapes 
which have this peculiar property, where each 
part is like the whole, but smaller."

'Powerful mind'

Fractal mathematics also led to technological 
developments in the fields of digital music and image compression.

It has also been influential in pop culture, with 
the patterns being used to create beautiful and 
intricate pieces of art. One such design is named in his honour.

Mandelbrot was also highly critical of the world 
banking system, arguing the economic model it 
used was unable to cope with its own complexity.

In a statement, French President Nicolas Sarkozy 
praised Mandelbrot for his "powerful, original 
mind that never shied away from innovation and battering preconceived ideas".

"His work, which was entirely developed outside 
the main research channels, led to a modern information theory," he said.

BBC (c) MMX


=========================================================================== 
=========================================================================== 
Items for the next CiE Newsletter should be sent 
in plain text (avoiding accents) to Olivier 
Bournez <bournez at lix.polytechnique.fr> to arrive by November 5th, 2010

___________________________________________________________________________
   ASSOCIATION COMPUTABILITY IN EUROPE       http://www.computability.org.uk
   CiE Conference Series                          http://www.illc.uva.nl/CiE
   CiE 2011                        http://cie2011.fmi.uni-sofia.bg/?q=node/1
   CiE 2012                                            http://www.cie2012.eu
   CiE Membership Application Form             http://www.cs.swan.ac.uk/acie
   ALAN TURING YEAR                           http://www.turingcentenary.eu/
___________________________________________________________________________




More information about the FOM mailing list