[FOM] CiE Newsletter No.44, February 23, 2011
by way of Martin Davis <eipye@pacbell.net>
bournez at lix.polytechnique.fr
Wed Feb 23 17:02:09 EST 2011
CiE Newsletter No.44, February 23, 2011
Please send any items you would like included in next letter to Olivier
Bournez <bournez at lix.polytechnique.fr>
DEADLINE: March 10th 2011.
___________________________________________________________________________
** 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/
___________________________________________________________________________
CONTENTS:
1) CSL'2011 20th Annual Conference of the European Association for
Computer Science Logic
2) 2nd CfP: History and Philosophy of Computing, Gent (Belgium), 7-10
November 2011
3) (From Torben Brauner) BOOK ANOUNCEMENT Hybrid Logic and its Proof-Theory
4) HyperNet 2011 - Second Call for Papers & Posters
5) Physics & Computation 2011 - Second Call for Papers & Posters
6) JAF 30: 30th Weak Arithmetic Days, Paris (France), 20-22 June 2011
7) Workshop in Computability Theory, San Francisco CA (U.S.A.), 22-23
March 2011
8) (From H. Zenil) BOOK ANNOUNCEMENT, RANDOMNESS THROUGH COMPUTATION: Some
Answers, More Questions
9) Errata page for Algorithmic Randomness and Complexity (fwd)
10) FCT 2011: Fundamentals of Computer Theory, Oslo (Norway), 22-25 August
2011
11) (From Marian Gheorghe) TWELFTH CONFERENCE ON MEMBRANE COMPUTING (CMC)
12) 27th British Colloquium for Theoretical Computer Science (BCTCS)
13) (From Damien Woods) 17th DNA Computing and Molecular Programming
Conference -- Call for Papers
14) (From Ulrich Berger) W o r k s h o p A n n o u n c e m e n t D O
M A I N S X
15) (From Ion Petre) CompMod 2011 3rd International Workshop on
Computational Models for Cell Processes
___________________________________________________________________________
1) CSL'2011 20th Annual Conference of the European Association for
Computer Science Logic
----------------------------------------------------------------------
CALL FOR PAPERS AND WORKSHOP PROPOSALS
CSL 2011
20th Annual Conference of the
European Association for Computer Science Logic
Bergen, Norway
September 12-15, 2011
GENERAL INFORMATION
Computer Science Logic (CSL) is the annual conference of the
European Association for Computer Science Logic (EACSL).
The conference is intended for computer scientists whose
research activities involve logic, as well as for logicians
working on issues significant for computer science.
The Ackermann Award for 2011 will be presented to the
recipients at CSL 2011.
SCOPE
Topics of interest include (but are not limited to):
- automated deduction and interactive theorem proving
- constructive mathematics and type theory
- equational logic and term rewriting
- automata and games, game semantics
- modal and temporal logic
- model checking
- decision procedures
- logical aspects of computational complexity
- finite model theory
- computational proof theory
- logic programming and constraints
- lambda calculus and combinatory logic
- domain theory,
- categorical logic and topological semantics
- database theory
- specification, extraction and transformation of programs
- logical foundations of programming paradigms
- logical aspects of quantum computing
- verification and program analysis
- linear logic
- higher-order logic
- nonmonotonic reasoning
PROCEEDINGS
The proceedings will be published in the series LIPIcs,
Leibniz International Proceedings in Informatics.
Each paper accepted by the Program Committee (PC) must be
presented at the conference by one of the authors,
and a final copy must be prepared according to LIPIcs guidelines
(http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/).
PAPER SUBMISSION
Authors are invited to submit papers of not more than 15 pages
in LIPIcs style presenting work not previously published.
Papers are to be submitted through EasyChair:
http://www.easychair.org/conferences/?conf=csl2011. Submitted papers
must be in English and provide sufficient detail to allow the PC to
assess the merits of the paper. Full proofs may appear in a technical
appendix which will be read at the reviewers' discretion.
Authors are strongly encouraged to include a well written intro-
duction which is directed at all members of the program committee.
Submission is in two phases with dates as given below.
Papers must not be submitted concurrently to another conference with
refereed proceedings; The PC chair should be informed of closely
related work submitted to a conference or journal by March 19, 2011.
Papers authored or coauthored by members of the PC are not allowed.
WORKSHOPS
Proposals for satellite workshops on more specialized topics are
welcome and can be sent to csl11 at eacsl.org
IMPORTANT DATES
Submission of title and abstract: March 27, 2011
Submission of full paper: April 3, 2011
Notification: May 30, 2011
Final paper due: June 17, 2011
Conference: September 12-15, 2011
PROGRAM COMMITTEE
Samson Abramsky (Oxford)
Andrea Asperti (Bologna)
Franz Baader (Dresden)
Matthias Baaz (Vienna)
Johan van Benthem (Amsterdam/Stanford)
Marc Bezem (Bergen, chair)
Patrick Blackburn (Nancy)
Andreas Blass (Michigan)
Jan van den Bussche (Hasselt)
Thierry Coquand (Gothenburg)
Nachum Dershowitz (Tel Aviv)
Valentin Goranko (Copenhagen)
Erich Graedel (Aachen)
Wiebe van der Hoek (Liverpool)
Bart Jacobs (Nijmegen)
Reinhard Kahle (Lisbon)
Stephan Kreutzer (Oxford)
Viktor Kuncak (Lausanne)
Daniel Leivant (Indiana)
Benedikt Loewe (Amsterdam)
Jean-Yves Marion (Nancy)
Eugenio Moggi (Genova)
Albert Rubio (Barcelona)
Anton Setzer (Swansea)
Alex Simpson (Edinburgh)
John Tucker (Swansea)
Pawel Urzyczyn (Warsaw)
Helmut Veith (Vienna)
Andrei Voronkov (Manchester)
ORGANIZING COMMITTEE
Isolde Adler
Marc Bezem
Magne Haveraaen
Michal Walicki
Uwe Wolter
CONFERENCE ADDRESS
CSL 2011, Department of Informatics,
University of Bergen,
P.O.Box 7803, N-5020 Bergen, Norway
http://www.eacsl.org/csl11
-----------------------------------------------------------------
___________________________________________________________________________
2) 2nd CfP: History and Philosophy of Computing, Gent (Belgium), 7-10
November 2011
Second announcement
International Conference
History and Philosophy of Computing
Celebrating the 75th anniversary of the famous 1936 Papers by A. Church,
E.L. Post and A.M. Turing
November 7 - 10, 2011
Gent University, Belgium
http://www.computing-conference.ugent.be
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
INVITED SPEAKERS:
Bill Aspray (University of Texas)
Martin Davis (New York University)
Fairouz Kamareddine (Heriot-Watt University Edinburgh)
Sybille Krämer (Freie Universität Berlin)
Giovanni Sambin (Universita' di Padova)
Raymond Turner (University of Essex)
Stephen Wolfram (Wolfram Research)
SUBMISSIONS
We plan to have up to 30 contributed papers to be presented at the
conference. We welcome contributions from logicians and philosophers or
historians of science as well as from philosophically aware computer
scientists and mathematicians. Authors should submit an electronic
version of an extended abstract (approximately 1000 words) through
EasyChair. Submission will be open on when the Call for Papers is
launched on 15th March 2011.
CONFERENCE CHAIRS:
Liesbeth De Mol and Giuseppe Primiero
PROGRAMME COMMITTEE:
G. Alberts (Amsterdam)
S. Artemov (New York)
M. Campbell-Kelly (Warwick)
L. Corry (Tel Aviv)
M. Denecker (Leuven)
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
The International Association for Computing and Philosophy will fund a
$500 travel grant for an IACAP graduate student to attend. IACAP
graduate students who would like to apply for this grant need to send a
copy of their submission to Tony Beavers (executivedirector at ia-cap.org),
executive director of IACAP. More details for applications will be added
later. The Association also offers a 10% discount on the conference fee
for IACAP members.
Student members of the Association for Symbolic Logic also may apply for
travel grants. To be considered for a Travel Award, please (1) send a
letter of application, and (2) ask your thesis supervisor to send a
brief recommendation letter. The application letter should be brief
(preferably one page) and should include: (1) your name; (2) your home
institution; (3) your thesis supervisor's name; (4) a one-paragraph
description of your studies and work in logic, and a paragraph
indicating why it is important to attend the meeting; (5) your estimate
of the travel expenses you will incur; (6) (for citizens or residents of
the USA) citizenship or visa status; and (7) (voluntary) indication of
your gender and minority status. Women and members of minority groups
are strongly encouraged to apply. In addition to funds provided by the
ASL, the program of travel grants is supported by a grant from the US
National Science Foundation; NSF funds may be awarded only to students
at USA universities and to citizens and permanent residents of the USA.
Air travel paid for using NSF funds must be on a US flag carrier.
Application by email is encouraged; put "ASL travel application'' in the
subject line of your message. Applications should be received at least
three months prior to the meeting at the ASL Business Office: ASL, Box
742, Vassar College, 124 Raymond Avenue, Poughkeepsie, New York 12604,
USA; Fax: 1-845-437-7830; email: asl at vassar.edu. Decisions will be
communicated at least two months prior to the meeting.
PROCEEDINGS
A selection of papers will be published as a Special Issue of the
Journal Philosophy & Technology (Springer)
More details on deadlines and submissions can be found at:
http://www.computing-conference.ugent.be
For requests and infos
computing.conference at ugent.be
_________________________________________________________________________
3) (From Torben Brauner) BOOK ANOUNCEMENT Hybrid Logic and its Proof-Theory
BOOK ANOUNCEMENT
Hybrid Logic and its Proof-Theory
by Torben Braüner
Applied Logic Series, Vol. 37
Springer, 2011
ISBN 978-94-007-0001-7
* This is the first book-length treatment of hybrid logic and its
proof-theory. Hybrid logic is an extension of ordinary modal logic which
allows explicit reference to individual points in a model (where the
points represent times, possible worlds, states in a computer, or
something else). This is useful for many applications, for example when
reasoning about time one often wants to formulate a series of statements
about what happens at specific times.
* There is little consensus about proof-theory for ordinary modal logic.
Many modal-logical proof systems lack important properties and the
relationships between proof systems for different modal logics are often
unclear. In the present book we demonstrate that hybrid-logical
proof-theory remedies these deficiencies by giving a spectrum of
well-behaved proof systems (natural deduction, Gentzen, tableau, and axiom
systems) for a spectrum of different hybrid logics (propositional,
first-order, intensional first-order, and intuitionistic).
* All these proof systems can be motivated independently, but the fact
that the systems can be given in a uniform way shows that hybrid logic and
hybrid-logical proof-theory is a natural enterprise.
* Further information can be found at
http://www.springer.com/philosophy/logic+and+philosophy+of+language/book/978-94-007-0001-7
____________________________________________________________________
4) HyperNet 2011 - Second Call for Papers & Posters
Final Call for Papers / Posters
HYPERNET (Hypercomputation Workshop) 2011
Co-located Workshop with Unconventional Computation 2011
June 6-10, Turku, Finland
Further details online at: http://hypercomputation.net
Papers and posters are solicited on all aspects of Hypercomputation.
KEY DATES
Paper submission deadline: 28 Feb 2011
Paper authors notified: 1 Apr 2011
Final versions due: 18 Apr 2011
Poster submission deadline: 18 Apr 2011
Poster authors notified: 25 Apr 2011
Early registration ends: 2 May 2011
PUBLICATION
Accepted papers will be published in the first instance in electronic form
as a Workshop pre-proceedings. As in previous years, authors will be
invited, following the Workshop, to submit finalised versions of their
work for journal publication.
Submissions should be submitted electronically via EasyChair, in PDF format:
http://www.easychair.org/conferences/?conf=hypernet11
Papers should initially be no more than 12 sides in length (excluding
bibliography), and should be formatted for A4 paper.
TOPICS INCLUDE (but are not restricted to)
* analogue systems
* arithmetic hierarchy
* axiomatizations of physics
* Church-Turing thesis
* complexity of nonstandard systems
* computing beyond the Turing barrier
* digital physics
* economics and uncomputability
* nonstandard computation
* philosophical aspects
* quantum computation
* relativistic computation
* transfinite systems
* unconventional computation and its properties
* wormhole computation
PROGRAMME COMMITTEE
Selim Akl (Queen's)
Hajnal AndrÈka (Budapest)
Olivier Bournez (Ecole Polytechnique)
Cristian Calude (Auckland)
Barry Cooper (Leeds)
Francisco AntÙnio DÛria (Rio de Janeiro)
Marian Gheorghe (Sheffield)
Viv Kendon (Leeds)
Peter Kugel (Boston)
Kenichi Morita (Hiroshima)
Istvan NÈmeti (Budapest)
Ion Petre (Turku)
Mike Stannett (Sheffield)
Susan Stepney (York)
Gergely SzÈkely (Budapest)
Christof Teuscher (Portland)
John Tucker (Swansea)
Benjamin Wells (San Francisco)
ORGANISING COMMITTEE
Hajnal AndrÈka (Budapest)
Selmer Bringsjord (Rensselaer)
Cristian Calude (Auckland)
Ion Petre (Turku)
Mike Stannett (Sheffield)
Susan Stepney (York)
COORDINATOR / QUERIES
Mike Stannett (m.stannett at dcs.shef.ac.uk)
_____________________________________________________________
5) Physics & Computation 2011 - Second Call for Papers & Posters
Final Call for Papers / Posters
PHYSICS & COMPUTATION 2011
Co-located Workshop with Unconventional Computation 2011
June 6-10, Turku, Finland
Further details online at: http://www.pc2011.org
Papers and posters are solicited on the relationships between Physics and
Computation.
KEY DATES
Paper submission deadline: 28 Feb 2011
Paper authors notified: 1 Apr 2011
Final versions due: 18 Apr 2011
Poster submission deadline: 18 Apr 2011
Poster authors notified: 25 Apr 2011
Early registration ends: 2 May 2011
PUBLICATION
Accepted papers will be published in the first instance in electronic form
as a Workshop pre-proceedings. As in previous years, authors will be
invited, following the Workshop, to submit finalised versions of their
work for journal publication.
Submissions should be submitted electronically via EasyChair, in PDF format:
http://www.easychair.org/conferences/?conf=pc2011
Papers should initially be no more than 12 sides in length (excluding
bibliography), and should be formatted for A4 paper.
TOPICS INCLUDE (but are not restricted to)
* analogue computation
* axiomatization of physics: completeness, decidability, reduction
* digital physics
* optical computation
* philosophy of physics and computation
* quantum computation (digital, analogue) and its applications (biology,
mathematics, etc.)
* quantum logics
* quantum randomness
* reaction-diffusion models of computation: including brain dynamics, BZ
computers
* relativity: spacetimes, computation, time travel, speedup
* theory of measurement: axiomatization, complexity
* wormhole computation
PROGRAMME COMMITTEE
Andy Adamatzky (Bristol)
Alastair Abbott (Auckland)
Hajnal AndrÈka (Budapest)
Olivier Bournez (Ecole Polytechnique)
Ad·n Cabello (Seville)
Cristian Calude (Auckland)
Shlomi Dolev (Ben Gurion)
Elham Kashefi (Edinburgh)
Viv Kendon (Leeds)
Giuseppe Longo (Paris)
Kenichi Morita (Hiroshima)
Ferdinand Peper (NiCT)
Ion Petre (Turku)
Mike Stannett (Sheffield)
Mike Stay (Auckland/Google)
Susan Stepney (York)
Damien Woods (CalTech)
Paolo Zuliani (Carnegie Mellon)
ORGANISING COMMITTEE
Hajnal AndrÈka (Budapest)
Selmer Bringsjord (Rensselaer)
Cristian Calude (Auckland)
Ion Petre (Turku)
Mike Stannett (Sheffield)
Susan Stepney (York)
COORDINATOR / QUERIES
Mike Stannett (m.stannett at dcs.shef.ac.uk)
_______________________________________________________
6) JAF 30: 30th Weak Arithmetic Days, Paris (France), 20-22 June 2011
Call for Participation: First Announcement
*****************************************************
JAF 30
30 emes Journees sur les Arithmetiques Faibles
(30 th Weak Arithmetics Days)
Paris, France
June 20-22, 2011
http://jaf30.logique.jussieu.fr/
The third day of JAF 30 will be a common day with the French Journées
Complexité et
Modèles Finis organized by the GDR IM:
http://www.up2.fr/cmf/
*****************************************************
organized by
Équipe de Logique Mathématique
Université Paris Diderot Paris 7
JAF topics:
-----------
provability in weak arithmetics,
definability in weak arithmetics,
weak arithmetics and model theory,
undecidability/decidability/complexity of weak theories,
modelling computations in logical theories
et al.
Invited speakers:
-----------------
Zofia Adamowicz (Warsaw)
Jacques Duparc (Lausanne)
Jan Krajicek (Pragues)
Leszek Kolodziejczyk (Warsaw)
Shahram Mohsenipour (Tehran)
Damian Niwinski (Warsaw)
Pavel Pudlak (Pragues)
Konrad Zdanowski (Warsaw)
Steering Committee:
-------------------
Patrick Cegielski (University Paris 12)
Andres Cordon-Franco (University of Seville)
Constantine Dimitracopoulos (University of Athens)
Alex Esbelin (University Clermont 1)
Jean-Pierre Ressayre (CNRS - University of Paris 7)
Programme Committee:
-------------------
Sedki Boughattas (University of Paris 7)
Patrick Cegielski (University Paris 12)
Andres Cordon-Franco (University of Seville)
Olivier Finkel (CNRS - University of Paris 7)
Constantine Dimitracopoulos (University of Athens)
Alex Esbelin (University Clermont 1)
Jean-Pierre Ressayre (CNRS - University of Paris 7)
Local Organizing Committee:
---------------------------
Sedki Boughattas : bougatas at logique.jussieu.fr
Arnaud Durand : durand at logique.jussieu.fr
Olivier Finkel : finkel at logique.jussieu.fr
Marie hélene Mourgues : mhm at logique.jussieu.fr
Catherine Muhlrad-Greif : greif at logique.jussieu.fr
Jean-Pierre Ressayre : ressayre at logique.jussieu.fr
Registration and submission:
----------------------------
In order to register for the meeting, please send an e-mail with your
name, affiliation, address and e-mail to Sedki Boughattas
(bougatas at logique.jussieu.fr) and to Olivier Finkel
(finkel at logique.jussieu.fr) before *May 10, 2011*. There is no
registration fee.
If you would like to give a contributed talk, please also send a short
abstract before *April 10, 2011*.
--------------------------------
For further information please contact the organizing committee.
________________________________________________________
7) Workshop in Computability Theory, San Francisco CA (U.S.A.), 22-23
March 2011
The next installment of the Workshop in Computability Theory series will
be held at the University of San Francisco in San Francisco on March
22--23, 2011, immediately preceding the 2011 ASL North American Annual
Meeting to be held at the University of California - Berkeley on March
24--27, 2011.
Information about the meeting site and schedule will be available
at http://www.usfca.edu/artsci/math/wct/, and speakers will include
* Wesley Calvert
* Doug Cenzer
* Barry Cooper
* Noam Greenberg
* Bjørn Kjos-Hanssen
* Julia Knight
* Ted Slaman
* Reed Solomon
* Alexandra Soskova
* Rebecca Steiner
We look forward to seeing you there!
Jennifer Chubb & Sara Quinn
_________________________________________________________________
8) (From H. Zenil) BOOK ANNOUNCEMENT, RANDOMNESS THROUGH COMPUTATION:
Some Answers, More Questions
BOOK ANNOUNCEMENT
RANDOMNESS THROUGH COMPUTATION: Some Answers, More Questions
Edited by Hector Zenil (member of CiE)
World Scientific Publishing Company
Dedicated to the memory of Ray Solomonoff (1926--2009)
(For a limited time, members of CiE receiving this announcement can
benefit a 25%
discount from the WSPC online bookstore:
http://www.worldscibooks.com/compsci/7973.html using the code WJAN25B
as you
pre-order. This offer is valid from now till 20 February, 2011 -- the day
before release).
Book Description
----
The volume consists of an indispensable set of chapters written by
leading scholars, scientists and researchers in the field of
Randomness, including related subfields specially but not limited to
the strong developed connections to the Computability and Recursion
Theory. Highly respected, indeed renowned in their areas of
specialization, many of these contributors are the founders of their
fields. The scope of "Randomness Through Computation" is novel. Each
contributor shares his personal views and anecdotes on the various
reasons and motivations which led him to the study of the subject.
They share their visions from their vantage and distinctive
viewpoints. In summary, this is an opportunity to learn about the
topic and its various angles from the leading thinkers.
Contents
----
* Randomness as Circuit Complexity (and the Connection to
Pseudorandomness) (E. Allender)
* Randomness Everywhere: My Path to Algorithmic Information Theory (C.S.
Calude)
* Metaphysics, Metamathematics and Metabiology (G. Chaitin)
* The Martin-Löf-Chaitin Thesis (J-P. Delahaye)
* Computability, Algorithmic Randomness and Complexity (R.G. Downey)
* Is Randomness Native to Computer Science? Ten Years After (M.
Ferbus-Zanda & S. Grigorieff)
* The Impact of Algorithmic Information Theory on Our Current Views (P. Gács)
* Scatter and Regularity Imply Benford's Law... and More (N. Gauvrit &
J-P. Delahaye)
* Is Randomness Necessary? (R. Graham)
* Algorithmic Randomness as Foundation of Inductive Reasoning and
Artificial Intelligence (M. Hutter)
* Randomness: A Tool for Constructing and Analyzing Computer Programs
(A. Kucera)
* Connecting Randomness to Computation (M. Li)
* Some Bridging Results and Challenges in Classical, Quantum and
Computational Randomness (G. Longo, C. Palamidessi & T. Paul)
* Randomness, Computability and Information (J.S. Miller)
* Studying Randomness Through Computation (A. Nies)
* Statistical Testing of Randomness: New and Old Procedures (A.L. Rukhin)
* Randomness, Occam’s Razor, AI, Creativity and Digital Physics (J.
Schmidhuber)
* Algorithmic Probability — Its Discovery — Its Properties and
Application to Strong AI (R.J. Solomonoff)
* From Error-correcting Codes to Algorithmic Information Theory (L. Staiger)
* Uncertainty in Physics and Computation (M.A. Stay)
* Indeterminism and Randomness Through Physics (K. Svozil)
* Probability is a Lot of Logic at Once: If You Don’t Know Which One
to Pick, Take ’em All (T. Toffoli)
* Randomness in Algorithms (O. Watanabe)
* The Road to Intrinsic Randomness (S. Wolfram)
* Panel discussion transcription (University of Vermont, Burlington
2007): Is The Universe Random? (C.S. Calude, J. Casti, G.J. Chaitin,
Paul Davies, S. Wolfram & K. Svozil)
* Panel discussion transcription (University of Indiana Bloomington
2008): What is Computation? (How) Does Nature Compute? (C.S. Calude,
G.J. Chaitin, E. Fredkin, T.J. Leggett, R. de Ruyter, T. Toffoli & S.
Wolfram)
For pre-ordering details see the World Scientific webpage:
http://www.worldscibooks.com/compsci/7973.html
Also available through Amazon:
http://www.amazon.com/Randomness-Through-Computation-Answers-Questions/dp/9814327743/
Please do recommend the title to your library and colleagues.
__________________________________________
9) Errata page for Algorithmic Randomness and Complexity (fwd)
Dat
We have created a list of errata, clarifications, and updates for our book
Algorithmic Randomness and Complexity. It can be found at
http://math.uchicago.edu/~drh/arc.html
Please send any contributions to the list to drh at math.uchicago.edu and/or
Rod.Downey at msor.vuw.ac.nz.
Best,
Rod and Denis
_________________________________________
10) FCT 2011: Fundamentals of Computer Theory, Oslo (Norway), 22-25
August 2011
Call for Papers
FCT 2011
18th International Symposium on Fundamentals of Computer Theory
August 22-25, 2011, Oslo, Norway
The Symposium on Fundamentals of Computation Theory was established in
1977 for researchers interested in all aspects of theoretical computer
science, as well as new emerging fields such as bio-inspired computing. It
is a biennial series of conferences previously held in Poznan (Poland,
1977), Wendisch-Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm
(Sweden, 1983), Cottbus (Germany, 1985), Kazan (Russia, 1987), Szeged
(Hungary, 1989), Gosen-Berlin (Germany, 1991), Szeged (Hungary, 1993),
Dresden (Germany, 1995), Krakow (Poland, 1997), Iasi (Romania, 1999), Riga
(Latvia, 2001), Malmo (Sweden, 2003), Lubeck (Germany, 2005), Budapest
(Hungary, 2007), and Wroclaw (Poland, 2009).
PROCEEDINGS
The conference proceedings will be published (as usual) in the Lecture
Notes in Computer Science series of Springer-Verlag (to be confirmed).
SUBMISSIONS (topics)
Authors are invited to submit papers presenting original unpublished
research in all areas of theoretical computer science. Topics of interest
include (but not limited to):
* Algorithms:
o algorithm design and optimization
o combinatorics and analysis of algorithms
o computational complexity
o approximation, randomized, and heuristic methods
o parallel and distributed computing
o circuits and boolean functions
o online algorithms
o machine learning and artificial intelligence
o computational geometry
o computational algebra
* Formal methods:
o algebraic and categorical methods
o automata and formal languages
o computability and nonstandard computing models
o database theory
o foundations of concurrency and distributed systems
o logics and model checking
o models of reactive, hybrid and stochastic systems
o principles of programming languages
o program analysis and transformation
o specification, refinement and verification
o security
o type systems
* Emerging fields:
o ad hoc, dynamic, and evolving systems
o algorithmic game theory
o computational biology
o foundations of cloud computing and ubiquitous systems
o quantum computation
Authors are invited to submit a paper with at most 12 pages in the LNCS
style.
The paper should provide sufficient detail to allow the Program Committee to
evaluate its validity, quality, and relevance. If necessary, detailed
proofs can
be attached as an appendix. Simultaneous submission to other conferences
with published proceedings or journals is not allowed.
IMPORTANT DATES
Submission Deadline: Tuesday, 5. April 2011
Author Notification: Monday, 6. June 2011
Camera ready manuscript: Friday 17. June 2011
For further information on the conference, please visit the URL at
http://fct11.ifi.uio.no/
PROGRAM CHAIRS
- Olaf Owe (U. of Oslo)
- Martin Steffen (U. of Oslo)
- Jan Arne Telle (U. of Bergen)
PROGRAM COMMITTEE
Erika Abraham (RWTH Aachen, Germany)
Wolfgang Ahrendt (Chalmers, Sweden)
David Coudert (INRIA Sophia-Antipolis, France)
Camil Demetrescu (La Sapienza University of Rome, Italy)
Jiri Fiala (Charles University, Prague, Czech Republic)
Martin Hofmann (LMU, Munich)
Thore Husfeldt (IT University of Copenhagen, Denmark)
Alexander Kurz (U. of Leicester, UK)
Andrzej Lingas (Lund University, Sweden)
Peter Csaba Oelveczky (U. of Oslo, Norway)
Olaf Owe (U. of Oslo, Norway)
Miguel Palomino (U. Complutense, Madrid, Spain)
Yuri Rabinovich (U. of Haifa, Israel)
Saket Saurabh (Inst. of Mathematical Sciences, Chennai, India)
Martin Steffen (U. of Oslo, Norway)
Jan Arne Telle (U. of Bergen, Norway)
Tarmo Uustalu (Inst. of Cybernetics, Tallinn, Estland)
Ryan Williams (IBM Almaden Research Center, San Jose, USA)
Gerhard Woeginger (U. of Eindhoven, The Netherlands)
David Wood (U. of Melbourne, Australia)
STEERING COMMITTEE
Bogdan Chlebus (Warszawa/Denver, Poland/USA)
Zoltan Esik (Szeged, Hungary)
Marek Karpinski - chair (Bonn, Germany)
Andrzej Lingas (Lund, Sweden)
Miklos Santha (Paris, France)
Eli Upfal (Providence, USA)
_________________________________________________________________
11) (From Marian Gheorghe) TWELFTH CONFERENCE ON MEMBRANE COMPUTING (CMC)
TWELFTH CONFERENCE ON MEMBRANE COMPUTING (CMC)
Fontainebleau/Paris, France, 2011
Goal: to bring together researchers working in membrane computing and
related areas
in a friendly atmosphere enhancing communication & cooperation and
continuing the
tradition of past CMC/WMC.
Organizing institutions: Universite Paris-Est Creteil Val de Marne
Dates and Place: August 23 (Tuesday) -- August 26 (Friday), 2011; IUT de
Fontainebleau.
Organizing Committee:
Patrick CEGIELSKI (co-chair)
Olivier MICHEL
Catalin DIMA
Antoine SPICHER
Frederic GERVAIS
Pierre VALARCHER
Pierre KONOPACKI
Serghei VERLAN (co-chair)
Program Committee
Artiom Alhazov (Hiroshima, Japan)
Radu Nicolescu (Auckland, New-Zealand)
Gabriel Ciobanu (Iasi, Romania)
Marion Oswald ((Vienna, Austria)
Erzsebet Csuhaj-Varju (Budapest, Hungary)
Linqiang Pan (Wuhan, China)
Rudolf Freund (Vienna, Austria)
Gheorghe Paun (Bucharest, Romania; Sevilla, Spain)
Pierluigi Frisco (Edinburgh, UK)
Mario J. Perez-Jimenez (Sevilla, Spain)
Marian Gheorghe (Sheffield, UK) -- chair
Dario Pescini (Milan, Italy)
Thomas Hinze (Jena, Germany)
Francisco J. Romero-Campero (Nottingham, UK; Seville, Spain)
Alberto Leporati (Milan, Italy)
Petr Sosik (Opava, Czech Republic)
Vincenzo Manca (Verona, Italy)
Sergey Verlan (Paris, France) -- co-chair
Maurice Margenstern (Metz, France)
Invited speakers: Artiom Alhazov, Jean-Louis Giavitto, Gyorgy Vaszil.
Submission deadline: Monday May 9, 2011.
Notification of acceptance: Friday June 10, 2011.
Final version for the pre-proceedings: Monday July 4, 2011.
Satellite workshops: The conference will be accompanied by several workshops.
More details can be found later on the conference site.
Web page: http://cmc12.lacl.fr/
_________________________________________________________________
12) 27th British Colloquium for Theoretical Computer Science (BCTCS)
=======================================================================
27th British Colloquium for Theoretical Computer Science (BCTCS)
18th to 21st April 2011
University of Birmingham
http://events.cs.bham.ac.uk/BCTCS2011
SCOPE
The purpose of the BCTCS is to provide a forum in which researchers in
theoretical computer science can meet, present research findings, and
discuss developments in the field. It also aims to provide an
environment in which PhD students can gain experience in presenting
their work, and benefit from contact with established researchers. The
conference will consist of invited keynote presentations by
distinguished researchers and a number of contributed talks.
LOCATION AND SCHEDULE
BCTCS 2011 will be held at the University of Birmingham, a short train ride
away from the central "New Street Station" which has direct connections from
much of the UK.
Accommodation will be provided by the Etap Hotel in the city centre with
easy access to eateries and other amenities.
The event will start on Monday afternoon and will end with a lunch on
Thursday (the day before Good Friday).
INVITED SPEAKERS
BCTCS 2011 will include invited lectures by the following
distinguished speakers:
* David S. Johnson (AT&T Labs)
* Cliff Jones (Newcastle)
* Prakash Panangaden (McGill)
* Peter Selinger (Dalhousie)
* Nigel Smart (Bristol)
* Carsten Witt (Technical University of Denmark)
CONTRIBUTED TALKS
Participants at the colloquium are encouraged to present a contributed
talk. If you wish to present a contributed talk, please give the title
when you register for the Colloquium. You will be asked to provide an
abstract, using a provided LaTeX template, at a later stage.
The abstracts of accepted contributed talks will be published in the
Bulletin of the European Association for Theoretical Computer Science.
STUDENT GRANTS
The BCTCS steering committee have submitted an application to EPSRC which
will,
if successful, provide funding to support the participation of up to 45
graduate students at BCTCS. The grants are intended to cover registration
including accomodation and meals, but not travel. Those enrolled as Ph.D.
students may apply for these grants on the registration form.
While we await a decision from EPSRC we recommend that you register now,
as it will be easy to refund to the card you use for registration if you
are awarded a grant.
REGISTRATION
The registration fee is GBP 290, which includes accommodation (nights of the
18th, 19th, and 20th) and one evening meal. Registration is via the
Colloquium
website.
Registration closes on 4 APRIL 2011.
ORGANISATION AND FURTHER INFORMATION
The conference is being organised by Achim Jung, Paul Levy, and Sarah Collins
of the School of Computer Science, University of Birmingham.
More information about the meeting including updates are available
from the conference webpages at: http://events.cs.bham.ac.uk/BCTCS2011
Queries can be sent to: bctcs2011 at cs.bham.ac.uk.
We hope to see you there!
_________________________________________________________________
13) (From Damien Woods) 17th DNA Computing and Molecular Programming
Conference -- Call for Papers
The Seventeenth International Conference on DNA Computing and Molecular
Programming
September 19-23, 2011
Caltech, Pasadena, California, USA
http://dna17.caltech.edu
INTRODUCTION
The Meeting: Research in DNA computing and molecular programming
draws together mathematics, computer science, physics, chemistry,
biology, and nanotechnology to address the analysis, design, and
synthesis of information-based molecular systems. This annual meeting
is the premier forum where scientists with diverse backgrounds come
together with the common purpose of advancing the engineering and
science of biology and chemistry from the point of view of computer
science, physics, and mathematics. Continuing this tradition, the 17th
International Conference on DNA Computing and Molecular Programming
(DNA17), under the auspices of the International Society for Nanoscale
Science, Computation and Engineering (ISNSCE), will focus on the most
recent experimental and theoretical results that promise the greatest
impact.
Solicitation for Papers: Papers and poster presentations are sought in
all areas that relate to biomolecular computing using DNA and/or other
molecules, including but not restricted to: (1) algorithms and models of
computation for biomolecular systems; (2) control of molecular folding and
self-assembly to construct nanostructures; (3) demonstration of switches,
gates, devices, and circuits; (4) molecular motors and molecular robotics;
(5) computational processes in vitro and in vivo; (6) studies of
fault-tolerance and error correction; (7) synthetic biology and in vitro
evolution; (8) software tools for analysis, simulation, and design;
(9) applications in engineering, physics, chemistry, biology, and
medicine.
Dates and Deadlines: Please note that the conference dates have been
shifted from June to September to be suitably staggered from the other
ISNSCE-sponsored conference, Foundations of Nanoscience: Self-Assembled
Architectures and Devices (FNANO). Please note that the new schedule
demands that deadlines will be firmly enforced. The May 2 submission
deadline will not be extended. Revised manuscripts submitted by the July
17 deadline will be the final versions for the LNCS proceedings; there
will be no additional revisions possible after the conference.
INVITED SPEAKERS
Vincent Danos Computational Systems Biology, University of
Edinburgh, Edinburgh, UK.
Yamuna Krishnan Biochemistry, Biophysics, & Bioinformatics,
National Centre for Biological Sciences, Bangalore, India.
Niles Lehman Chemistry, Portland State University, Portland,
Oregon, USA.
Jack Lutz Computer Science, Iowa State University, Ames,
Iowa, USA.
Hao Yan Chemistry & Biochemistry, Arizona State
University, Tempe, Arizona, USA.
IMPORTANT DATES
Submission deadline (firm): May 2, 2011 before 10pm PST
Notification of acceptance: June 19, 2011
Revised manuscripts due: July 17, 2011
Conference: September 19-23, 2011
Accommodation deadline: July 10, 2011
RELATED EVENTS
September 19, 2011 – Tutorial Day: The first day of the meeting will
consist of tutorials covering important topics related to DNA computing
and molecular programming.
CONFERENCE WEBSITE
For further information, please see http://dna17.caltech.edu.
INSTRUCTIONS FOR AUTHORS
Electronic Submissions: All papers and abstracts should be submitted
electronically following the instructions and link at the conference web
page, http://dna17.caltech.edu. The submission site will open by
April 2, 2011 and close on May 2, 2011 at 10pm Pasadena time (PST).
Papers must be submitted in PDF format. The use of LATEX is strongly
encouraged for Track A submissions, as it will be required for the
revised manuscript included in the LNCS proceedings of accepted papers.
TRACKS
Authors may choose between three submission tracks.
Track A - Full Paper: For authors who want their full papers to be
published in the conference proceedings. Submissions will be considered
for oral presentation; those that are not accepted for oral presentation
will automatically be considered for poster presentation. Submissions
should conform to the following guidelines:
* The total length of the paper should not exceed 15 pages and
should be formatted in LATEX for the Springer-Verlag Lecture Notes in
Computer Science (LNCS). Please follow the formatting instructions at:
http://www.springer.de/comp/lncs/authors.html.
* Each paper should contain an abstract which briefly describes the
primary results and their importance.
* Selected papers will be published in the proceedings, available at
the conference and as part of the LNCS
series. Submissions to Track A may not be previously published or
simultaneously submitted to another conference or journal for
publication.
Track B - One-Page Abstract: Primarily for authors submitting
experimental results who plan to submit to a journal rather than publish
in the conference proceedings. (Abstracts for work recently submitted to
or published in a journal will also be considered.) Submissions will
be considered for oral presentation; those that are not accepted for oral
presentation will automatically be considered for poster presentation.
Submissions should conform to the following guidelines:
* The total length of the abstract should not exceed 1 page (11 point
type, single spaced, 1 inch margins).
* The one-page abstract should describe the primary results and their
importance.
* Authors must include a preliminary manuscript, a thesis chapter or some
other form of supporting documentation that can be used by the program
committee to evaluate the merit of the work for oral presentation. Only
the one-page abstract will appear in the proceedings. Track B papers
unaccompanied by adequate documentation will not be eligible for oral
presentation.
Track C - Poster Only: For authors interested in presenting their work
only in the poster session. Submissions should conform to the following
guidelines:
* The total length of the abstract should not exceed 1 page (11 point
type, single spaced, 1 inch margins).
* The one-page abstract should describe the primary results and their
importance.
STUDENT PAPER PRIZES
The best two papers with a student as the lead and presenting author will
be awarded travel prizes. For eligible papers, a brief recommendation
letter (such as from the student’s advisor) should be emailed to
dna17 at easychair.org. Recipients of the prize will be notified at the time
of acceptance. Some other student scholarships may also be available.
STEERING COMMITTEE
Natasha Jonoska (Chair) Mathematics, University of South Florida, USA
Leonard Adleman Computer Science, University of Southern California,
USA
Luca Cardelli Microsoft Research Cambridge, UK
Anne Condon Computer Science, University of British Columbia,
Canada
Masami Hagiya Computer Science, University of Tokyo, Japan
Lila Kari Computer Science, University of Western Ontario
(UWO), Canada
Chengde Mao Chemistry, Purdue University, USA
Giancarlo Mauri Informatics, Systems, & Communication, University of
Milan, Italy
Satoshi Murata Bioengineering & Robotics, Tohoku University, Japan
John Reif Computer Science, Duke University, USA
Grzegorz Rozenberg Computer Science, University of Leiden, The Netherlands
Nadrian Seeman Chemistry, New York University, USA
Andrew Turberfield Physics, Oxford University, UK
Erik Winfree Computer Science, Bioengineering, Computation &
Neural Systems
California Institute of Technology, USA
ORGANIZING COMMITTEE
Erik Winfree (Chair) Computer Science, Bioengineering,
Computation & Neural Systems
California Institute of Technology, USA
Niles Pierce Bioengineering and Applied & Computational Mathematics
California Institute of Technology, USA
Damien Woods Computer Science, California Institute of
Technology, USA
David Doty Computer Science, California Institute of
Technology, USA
PROGRAM COMMITTEE
Luca Cardelli (Co-Chair) Microsoft Research, Cambridge, UK
William Shih (Co-Chair) Harvard Medical School, Boston, USA
Anne Condon University of British Columbia, Vancouver, Canada
David Doty California Institute of Technology, Pasadena, USA
Shawn Douglas Harvard Medical School, Boston, USA
Andrew Ellington University of Texas, Austin, USA
Max Garzon University of Memphis, Memphis USA
Masami Hagiya University of Tokyo, Tokyo, Japan
Natasha Jonoska University of South Florida, Tampa, USA
Ming-Yang Kao Northwestern University, Evanston, USA
Lila Kari University of Western Ontario, London, Canada
Eric Klavins University of Washington, Seattle, USA
Satoshi Kobayashi University of Electro-Communications, Tokyo, Japan
Dongsheng Liu National Center for Nanoscience & Technology,
Beijing, China
Chengde Mao Purdue University, West Lafayette, USA
Satoshi Murata Tohoku University, Sendai, Japan
Jacques Nicolas INRIA, Rennes, France
Pekka Orponen Aalto University, Helsinki, Finland
John Reif Duke University, Durham, USA
Yannick Rondelez University of Tokyo, Tokyo, Japan
Yasubumi Sakakibara Keio University, Tokyo, Japan
Georg Seelig University of Washington, Seattle, USA
Friedrich Simmel Technical University of Munich, Munich, Germany
David Soloveichik University of Washington, Seattle, USA
Darko Stefanovic University of New Mexico, Albuquerque, USA
Fumiaki Tanaka University of Tokyo, Tokyo, Japan
Andrew Turberfield University of Oxford, Oxford, England
Erik Winfree California Institute of Technology, Pasadena, USA
Damien Woods California Institute of Technology, Pasadena, USA
Hao Yan Arizona State University, Tempe, USA
Bernard Yurke Boise State University, Boise, USA
Byoung-Tak Zhang Seoul National University, Seoul, Korea
David Zhang Harvard Medical School, Boston, USA
_________________________________________________________________
14) (From Ulrich Berger) W o r k s h o p A n n o u n c e m e n t D O M
A I N S X
W o r k s h o p A n n o u n c e m e n t
D O M A I N S X
http://www.cs.swan.ac.uk/domains2011/
Swansea University, Wales, UK, 5-7 September 2011
INTRODUCTION
The Workshop on Domains is aimed at computer scientists and
mathematicians alike who share an interest in the mathematical
foundations of computation. The workshop will focus on
domains, their applications and related topics. Previous meetings
were held in Darmstadt (94,99,04), Braunschweig (96), Munich (97),
Siegen (98), Birmingham (02), Novosibirsk (07) and Brighton (08).
Besides its traditional topics Domains X will have the special
themes 'Modelling Computational Effects' and 'Modelling
Continuous Data.'
FORMAT
The emphasis is on the exchange of ideas between participants similar
in style to Dagstuhl seminars. In particular, talks on subjects
presented at other conferences and workshops are acceptable.
INVITED SPEAKERS (confirmed)
Lars Birkedal University of Copenhagen (Denmark)
Nick Benton Microsoft Research Cambridge (UK)
Margarita Korovina University of Manchester (UK)
Dag Normann University of Oslo (Norway)
John Power University of Bath (UK)
Matija Pretnar University of Ljubljana (Slovenia)
Thomas Streicher University of Darmstadt (Germany)
Jeff Zucker McMaster University (Canada)
SCOPE
Domain theory has had applications to programming language
semantics and logics (lambda-calculus, PCF, LCF), recursion theory
(Kleene-Kreisel countable functionals), general topology
(injective spaces, function spaces, locally compact spaces, Stone
duality), topological algebra (compact Hausdorff semilattices) and
analysis (measure, integration, dynamical systems). Moreover,
these applications are related - for example, Stone duality gives
rise to a logic of observable properties of computational
processes.
As such, domain theory is highly interdisciplinary. Topics of
interaction with domain theory for this workshop include, but are
not limited to:
program semantics
program logics
probabilistic computation
exact computation over the real numbers
lambda calculus
games
models of sequential computation
constructive mathematics
recursion theory
realizability
real analysis and computability
topology, metric spaces and domains
locale theory
category theory
topos theory
type theory
SUBMISSION OF ABSTRACTS
Please submit a one-page abstract via Easychair
https://www.easychair.org/conferences/?conf=domainsx2011
Shortly after an abstract is submitted (usually two or three weeks),
the authors will be notified by the programme committee. The
criterion for acceptance is relevance to the meeting. In
particular, talks on subjects presented at other conferences and
workshops are acceptable.
DEADLINE
Abstracts will be dealt with on a first-come/first-served basis.
We ask potential speakers to express the intention to give
a talk by the end of June.
REGISTRATION
Further details about the local arrangements will be provided soon.
VENUE AND ACCOMMODATION
The Domains X workshop will take place at Swansea University,
Department of Computer Science, Robert Recorde Room (2nd floor,
Faraday Building). Accommodation will be on Campus in House Oxwich.
Further details will be given later.
PROGRAMME COMMITTEE
Ulrich Berger Swansea University (Co-Chair)
Jens Blanck Swansea University
Martin Escardo University of Birmingham (Co-Chair)
Achim Jung University of Birmingham
Klaus Keimel TU Darmstadt
Bernhard Reus University of Sussex
John Tucker Swansea University
ORGANIZING COMMITTEE
Ulrich Berger Swansea University
Jens Blanck Swansea University
Monika Seisenberger Swansea University
PUBLICATION
We plan to publish proceedings of the workshop in a special volume
of a journal. There will be a call for papers after the workshop.
The papers will be refereed according to normal publication
standards.
URL
http://www.cs.swan.ac.uk/domains2011/
_________________________________________________________________
15) (From Ion Petre) CompMod 2011 3rd International Workshop on
Computational Models for Cell Processes
======================================================================
CompMod 2011
3rd International Workshop on Computational Models for Cell Processes
Aachen, Germany, September 10, 2011
http://combio.abo.fi/compmod11/
In conjunction with CONCUR 2011
------------------------------------------------------------
=== Deadline for submissions: May 23, 2011 ===
------------------------------------------------------------
Computational systems biology is an exciting new application area for
applied mathematics and computer science. This workshop of the 22nd
International Conference on Concurrency Theory (CONCUR) fosters an
excellent platform gathering researchers in formal methods and related
fields that are interested in the wealth of opportunities and challenges in
systems biology.
SUBMISSIONS
-----------
We seek papers and extended abstracts in all areas that relate to the
relevance and potential of formal methods and computational modeling
and simulation in systems biology. In particular, we welcome
contributions that present biological processes requiring special
computational and formal techniques that have not been investigated so
far in the context of formal methods, as well as extensions of formal
methods formalisms introduced to improve their applicability to
biology. Topics of interest include, but are not limited to:
- Formal models for cellular pathways
- Qualitative biological modeling
- Quantitative formal methods
- Theoretical comparison of formalisms for biological processes
- Biologically-inspired extensions to formal methods, concurrency
theory, or logical methods
- Differential, discrete and/or stochastic modeling languages
- Reconstruction of biological networks based on empirical data
- Decomposition and modularization of large biological networks
- Applications of formal methods and computational modeling
- Membrane systems as a modeling platform
- Process calculi as a biomodeling platform
- Formal methods for synthetic biology
Authors are invited to submit extended abstracts or full papers of up
to 15 pages formatted according to EPTCS guidelines. Submissions can
be uploaded at www.easychair.org/conferences/?conf=compmod2011.
Simultaneous submission to other conferences or workshops with
published proceedings is not allowed. A special issue of the Transactions
on Computational Systems Biology, based on the workshop, is planned
after the workshop.
INVITED SPEAKERS
----------------
- Adelinde Uhrmacher, University of Rostock, Germany
- Verena Wolf, Saarland University, Germany
IMPORTANT DATES
---------------
- Submission: May 23, 2011
- Notification: June 25, 2011
- Final version: July 25, 2011
- Workshop: September 10, 2011
PROGRAMME COMMITTEE
-------------------
- Ralph Back, Abo Akademi, Finland
- Vincent Danos, University of Edinburgh, UK
- Francois Fages, INRIA Paris-Rocquencourt, France
- Russ Harmer, Harvard Medical School, US
- Monika Heiner, Brandenburg University of Technology Cottbus, Germany
- Jane Hillston, University of Edinburgh, UK
- Ina Koch, University of Frankfurt, Germany
- Giancarlo Mauri, University of Milan-Bicocca, Italy
- Emanuella Merelli, University of Camerino, Italy
- Ion Petre, Abo Akademi, Finland (co-chair)
- Alberto Policriti, University of Udine, Italy
- Corrado Priami, Microsoft Research & University of Trento, Center for
Computational and Systems Biology, Italy
- Angelo Troina, Universita degli Studi di Torino, Italy
- Adelinde Uhrmacher, University of Rostock, Germany
- Erik de Vink, Eindhoven University of Technology, the Netherlands
(co-chair)
ORGANIZERS
----------
- Ion Petre, ipetre 'at' abo.fi
- Erik de Vink, evink 'at' win.tue.nl
Venue: University of Aachen, Germany
_________________________________________________________________
16) PLS8 - SECOND CALL FOR PAPERS
*******************************************************************************
*******************************************************************************
***
***
*** T H E 8 T H P A N H E L L E N I C L O G I C S Y M P O S I U M
***
*** J u l y 4 - 8 , 2 0 1 1
***
*** I o a n n i n a, G r e e c e
***
***
***
*** www.cs.uoi.gr/~pls8/
***
***
***
*******************************************************************************
*******************************************************************************
CALL FOR PAPERS
HISTORY OF THE SYMPOSIUM
The Panhellenic Logic Symposium, a biennial scientific event established in
1997, aims to promote interaction and cross-fertilization among different
areas
of logic. Originally conceived as a way of bringing together the many
logicians
of Hellenic descent throughout the world, it has evolved into an
international
forum for the communication of state-of-the-art advances in logic. The
symposium is open to researchers worldwide who work in logic broadly
conceived.
The Eighth Panhellenic Logic Symposium will be hosted by the Department of
Computer Science at the University of Ioannina.
PROGRAM OF THE SYMPOSIUM
The scientific program of the symposium will consist of one-hour long invited
talks, three-hour long tutorials, and twenty-five-minute presentations of
accepted contributed papers. There will also be special opportunities for
students to give short talks, and receive comments on work in progress.
INVITED TUTORIALS
- Jeremy Avigad (Carnegie Mellon, USA)
- Dale Miller (INRIA, France)
- Simon Thomas (Rutgers, USA)
INVITED SPEAKERS
- George Barmpalias (University of Amsterdam, Netherlands)
- Ozlem Beyarslan (Bogazici University, Turkey)
- Michael Rathjen (University of Leeds, UK)
- Nicole Schweikardt (Goethe University, Germany)
- Athanassios Tzouvaras (University of Thessaloniki, Greece)
CALL FOR PAPERS
Original papers that fall within the scope of the symposium are solicited.
Prospective speakers of twenty-five-minute presentations are invited to
submit
an extended abstract, in English, not exceeding five pages, by 25 March 2011.
Papers should be prepared using the EasyChair class style (available from
http://www.easychair.org/coolnews.cgi) and submitted electronically, using
the Easy Chair conference system, at
http://www.easychair.org/conferences/?conf=pls8
If possible, each submitted paper should be classified in one of the
following
areas (in alphabetical order):
- Algebraic and Categorical Methods in Logic
- Computability Theory
- History and Philosophy of Logic
- Logic in Computer Science
- Model Theory
- Nonclassical and Modal Logics
- Proof Theory
- Set Theory
All submitted papers will be reviewed by the scientific committee of the
symposium, who will make final decisions on acceptance or rejection. During
the symposium, each accepted paper will be presented by one of its authors,
with five extra minutes for questions. Authors of submitted papers will be
notified of the decision by early May 2011. Camera-ready extended abstracts
will be due by the end of May for inclusion in the symposium proceedings
which
will be distributed to all participants.
IMPORTANT DATES:
- Abstract Submission Deadline: March 25, 2011
- Acceptance Notification: May 7, 2011
- Camera Ready Papers Deadline: May 31, 2011
- Conference Dates: July 4-8, 2011
SCIENTIFIC COMMITTEE
- Ayse Berkman (Middle East Technical University)
- Costas Dimitracopoulos (University of Athens)
- Kostas Hatzikiriakou (University of Thessaly)
- Antonis Kakas (University of Cyprus)
- Panagis Karazeris (University of Patras)
- Phokion Kolaitis (University of California, Santa Cruz
and IBM Research-Almaden)
- George Koletsos (National Technical University of Athens )
- Joan Moschovakis (Occidental College (retired), Chair of SC)
- Christos Nomikos (University of Ioannina)
- Itay Neeman (University of California, Los Angeles)
- Thanases Pheidas (University of Crete)
- Alexandra Soskova (Sofia University)
- Constantine Tsinakis (Vanderbilt University)
- Stathis Zachos (National Technical University of Athens )
ORGANIZING COMMITTEE
- Manolis Gergatsoulis (Ionian University)
- Spyros Kontogiannis (University of Ioannina)
- Costas Koutras (University of Peloponnese)
- Christos Nomikos (University of Ioannina, chair of the OC)
- Panos Rondogiannis (University of Athens)
SYMPOSIUM WEBPAGE
www.cs.uoi.gr/~pls8/
CONTACT
Joan Moschovakis (Chair of the Scientific Committee)
e-mail: joan at math.ucla.edu
Christos Nomikos (Chair of the Organizing Committee)
address: University of Ioannina
Department of Computer Science
P.O. Box 1186
45110, Ioannina
Greece
tel: +30 26510 08815
fax: +30 26510 08895
e-mail: cnomikos at cs.uoi.gr
pls8 at zeus.cs.uoi.gr
_________________________________________________________________
More information about the FOM
mailing list