---------- Forwarded message ----------
CiE Newsletter No.26, January 18, 2010 Just 2 days to the CiE 2010 submission deadline. There have been numerous requests for an extension of deadline, so watch this space for a decision from the co-chairs - either an official extension, or some unofficial flexibility involving keeping the easychair submission page open a little longer. Or (given the late wave of submissions and the tight timetable), maybe they will take a tougher line ... ___________________________________________________________________________ CONTENTS: 1. Ackermann Award 2010 - Call for Nominations 2. Physics and Computation 2010 - Final Call for Papers 3. 2010 Mal'tsev Meeting Malcev Meeting-2010 dedicated to 70th birthday of Yu.L.Ershov, Novosibirsk, 2-6 May 4. Theory and Applications of Models of Computation (TAMC 2010) - 2nd Call for papers 5. Computer Science Logic (CSL 2010) - 1st Call for Papers 6. Proof, Computation and Complexity (PCC 2010) - Call for Papers 7. 4 PhD positions in Formalization of Mathematics in Type Theory 8. Artificial Intelligence and Symbolic Computation 2010 (AISC 2010) - First Call for Papers =========================================================================== =========================================================================== 1. (from Johann Makowsky) Ackermann Award 2010 - Call for Nominations: ACKERMANN AWARD 2010 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS * Eligible for the 2010 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.2008 and 31.12. 2009. * Submission details are available at http://www.eacsl.org/submissionsAck.html * The deadline for submission is March 15, 2010 Nominations can be submitted from January 1, 2010 on and should be sent to the chairman of the Jury by e-mail: [email protected] * 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 2010 Ackermann Award will be presented to the recipients at the annual conference of the EACSL (CSL'10) in Brno (Czech Republic) to be held 23-27 August 2010, http://mfcsl2010.fi.muni.cz/ * The jury consists of 10 members: - The member of the board of EACSL as chairman of the Jury, J. Makowsky (Haifa) - The president of EACSL, D. Niwinski (Warsaw) - The vice-president of EACSL, A. Dawar (Cambridge) - One member of the LICS organizing committee, G. Plotkin (Edinburgh) - R. Alur (Philadelphia) - A. Atserias (Barcelona) - T. Coquand (Goeteborg) - P.-L. Curien (Paris) - A. Durand (Paris) - J. van Benthem (Amsterdam and Stanford) * The jury is entitled to give more 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 * For the three years 2010-2012, the Award is sponsored by the Kurt Goedel Society =========================================================================== =========================================================================== 2. (from Felix Costa) Physics and Computation 2010 - CALL FOR PAPERS: FINAL CALL FOR PAPERS PHYSICS AND COMPUTATION 2010, P&C 2010 Extended deadline: January 22 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ [Apologies for cross-postings. Please forward to anyone interested] -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- P&C 2010 3rd International Workshop on PHYSICS AND COMPUTATION On the Nile, Egypt August 30 (embarkation) - September 3 (desimbarkation on September 5) Submissions of 4-5 pages extented abstracts due: January 22 Notification: February 12 Full paper submission due: March 20 Registration: Phase 1 due to February 19 --- The charter will take a limited number of 40 participants with some further space for people travelling together (in the early registration step, participants will have to book their places and pay a fee of $200 each to the Cruiser Company in Egypt, through the Conference Webpage). -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- WEB www.pc2010.uac.pt -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.- Original papers are solicited in all areas of Physics and Computation (and related fields). Typical, but not exclusive, topics are: - Analogue computation - Axiomatization of physics: completeness, decidability, reduction - Church-Turing thesis - Computing beyond the Turing barrier - Digital physics - Philosophy of physics (and computation) - Quantum computation (digital, analogue). Applications to Biology. Quantum logics - Reaction-diffusion models of computation: including Brain Dynamics, BZ Computers - Relativity: spacetimes, computation, time travel, speedup - Theory of measurement: axiomatization, complexity All researchers in the area of the Workshop are kindly invited to submit their extended abstracts (4-5 pages) and / or papers (at most 12 pages) electronically, via Easychair: http://www.easychair.org/conferences/?conf=pc10 . The submissions are expected to be in PDF format using the suitable class files of Springer LNCS. Joint submissions to other conferences are not permitted. Each accepted paper must be presented at the Workshop. Contributed papers will be selected from submissions received by the PROGRAMME COMMITTEE: - Andrew ADAMATZKI, University of West England - Selim AKL, Queen's University, Canada - Hajnal ANDREKA, Alfred Renyi Institute of Mathematics, Budapest - Edwin BEGGS, University of Swansea - Olivier BOURNEZ, Ecole Polytechnique - Dan BROWNE, University College London - Cristian CALUDE, University of Auckland, New Zealand - Arturo CARSETTI, University of Rome "Tor Vergata" - Barry COOPER, University of Leeds - Bob COECKE, University of Oxford - Jose Felix COSTA, Technical University of Lisbon - Gilles DOWEK, Ecole Polytechnique and INRIA - Walid GOMAA, University of Alexandria - Viv KENDON, University of Leeds - Carlos LOURENCO, University of Lisbon - Judit MADARASZ, Alfred Renyi Institute of Mathematics, Budapest - Yasser OMAR, Technical University of Lisbon - Sonja SMETS, University of Groningen , Netherlands - Mike STANNETT, University of Sheffield - Karl SVOZIL, Institut fur Theoretische Physik, Technische Universitat Wien - John V. TUCKER, University of Swansea - Jiri WIEDERMANN, Academy of Sciences of the Czech Republic , Institute of Computer Science - Karoline WIESNER, University of Bristol - Martin ZIEGLER, University of Paderborn, Germany TUTORIALS: - Hajnal ANDREKA, Gergely SZEKELY, Judit X. MADARASZ, Istvan NEMETI, and Peter NEMETI (Physics and Computation) , Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences : Axiomatization of Physics in a logical framework. - Marco LANZAGORTA (Quantum Computation) , Technical Fellow and Director of the Quantum Information Group at ITT Corporation : Quantum computation: computability and complexity. INVITED SPEAKERS: - Samson ABRAMSKI (Quantum Computation and Protocols) , University of Oxford , Categorial foundations. - Arturo CARSETTI (Philosophy of Science) , University of Rome "Tor Vergata" , The emergence of meaning at the co-evolutive level. An epistemological approach. - John CASE (Learning Theory) , University of Delaware : Algorithmic Scientific Inference. - Gilles DOWEK (CT Thesis) , Ecole Polytechnique : The physical Church thesis as an explanation of the Galileo thesis. - Thomas JENNEWEIN (Quantum Computation) , Institute for Quantum Computing , University of Waterloo : Teleportation Experiments. - Sonja SMETS (Quantum Logic) , University of Groningen : Quantum logics. - Vlatko VEDRAL (Quantum computation) , Universities of Oxford and Singapore : Can entanglement be considered a genuine order parameter? - Salvador VENEGAS-ANDRACA (Quantum computation) , Tecnologico de Monterrey : Adiabatic quantum computation and NP-completeness: quantum algorithms and massive simulation in classical computer clouds. SPECIAL SESSION: The wakening of the computer; Which technological realizations make us feel closer to the HAL 9000 Computer? - Selmer BRINGSJORD , Rensselaer Polytechnic Institute (RPI) - David G. STORK , Chief Scientist of Ricoh Innovations VENUE: 3rd International Workshop on Physics and Computation, P&C 2010 Egypt, August 30 -- September 3, cruise downstream and upstream the Nile, from Luxor (through Aswan) to Luxor. Arrival and departure airports: Luxor or Cairo. (Full) Registration fee: $1200 USD , plus the (optional) sightseeing package of $145 USD . Includes one room / cabin (7 nights) on board , the meals (but not drinks) and coffee breaks for the 8 days cruise on the Nile. PREVIOUS EVENTS: Second International Workshop on Physics and Computation http://www.lix.polytechnique.fr/~bournez/PC2009/i.php First International Workshop on Physics and Computation http://www.cs.auckland.ac.nz/CDMTCS/conferences/physicsandcomputation/pc08.html POST--CONFERENCE PUBLICATION: P&C 08: Two Issues of Applied Mathematics and Computation (Volume 215, Issue 4, October 15 , 2009 , Elsevier) and Natural Computing (Volume 8, Number 3 , September, 2009 , Springer) . P&C 09: Proceedings will appear as a Bentham Book. P&C 10: Special Issue of Applied Mathematics and Computation , Special Issue of the International Journal of Unconventional Computing . We are applying for a Special Issue of Physica D . STRUCTURE OF THE EVENT: Our 6 days Workshop «Physics and Computation 2010» comprises: 8 Invited speakers (50 minutes each, 10 minutes for discussion); 2 Tutorials (100 minutes each, 20 minutes for discussion); 14-16 Contributed papers (35 minutes each, 10 minutes for discussion); 1 Special Session: Homage to Arthur C. Clarke 's 2010 , HAL 9000 New Legacy (120 minutes). David G. Stork has done a respectable work with respect to 2001 (http://mitpress.mit.edu/e-books/Hal/contents.html). Social programme includes sightseeing (with visits to) the main Archeological Stations, light lectures after dinner on Egyptology and the reading of hieroglyphs. STEERING COMMITTEE: - Caslav BRUKNER - Cristian CALUDE - Gregory CHAITIN - Jose Felix COSTA - Istvan NEMETI ORGANIZATION COMMITTEE: - Cristian CALUDE - Jose Felix COSTA - Walid GOMAA - Helia GUERRA - Karl SVOZIL CONTACT: Walid GOMAA Faculty of Engineering, Alexandria University, Alexandria, Egypt Email: [email protected] and [email protected] =========================================================================== =========================================================================== 3. (from Andrey Morozov) 2010 Mal'tsev Meeting Malcev Meeting-2010 dedicated to 70th birthday of Yu.L.Ershov, Novosibirsk, 2-6 May: ============================= Conference Announcement The international conference on algebra, mathematical logic, and applications will be held in Novosibirsk (Russia) on May 2-6, 2010. This conference is dedicated to the 70th birthday of Yurii Leonidovich Ershov. Web page of the conference is situated at http://www.math.nsc.ru/conference/malmeet/10/Main_e.htm The organisers of the conference are Sobolev Institute of Mathematics and Novosibirsk State University. The topics of the conference include group theory, ring theory, universal algebra, mathematical logic, computability theory, theoretical computer science, and related areas of mathematics. The programme committee includes S. Goncharov (chairman) M. Arslanov L. Bokut' K. Keimel B. Khoussainov J. Knight S. Lempp A. Macintyre L. Maksimova V. Mazurov A. Morozov A. Nerode D. Pal'chunov E. Palyutin V. Remeslennikov N. Romanovskii I. Shestakov D. Skordev R. Soare The scintific programme of the conference will consist of invited talks and contributions in sections. As usual, every talk at the Mal'tsev Meeting is considered as a talk at the "Algebra and Logic" seminar. Articles on reported results can be submitted to the journal with the same title (http://www.math.nsc.ru/~alglog/alglogfe.html). Abstracts of the talks will be published electronically. Instructions will be available later. The conference will be held in the Sobolev Institute of Mathematics. Accommodation will be available at the "Golden Valley" hotel (for participants of the conference, the prices will be approximately 2 times lower than those indicated at hotel's www-page http://www.gold-valley.ru/?lang=en or at the university campus. If you have questions concerning participation in the meeting, please, visit the web page of he conference at http://www.math.nsc.ru/conference/malmeet/10/Main_e.htm and/or do not hesitate to contact the organisers E-mail of the Conference: [email protected] Address of the Conference: Mal'tsev Meeting 2010 IM SB RAS pr. Akad. Koptyuga 4 630090 Novosibirsk, Russia , =========================================================================== =========================================================================== 4. (from Jan Kratochvil) Theory and Applications of Models of Computation (TAMC 2010) - 2nd Call for papers: 2nd Call for papers ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010) June 7 - 11, 2010 Prague, Czech Republic [email protected] http://www.tamc2010.cz ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ LOCATION: The conference will take place in the premisses of Charles University in the historic center of Prague, the capital of the Czech Republic. Six previous annual meetings were held in 2004-2009, in Beijing, Shanghai, Xi'an, and ChangSha, with enthusiastic participation from researchers all around the world. In 2010, the conference is organized for the first time in Europe. PLENARY SPEAKERS: John Hopcroft (Cornell University, USA) ShangHua Teng (Boston University, USA) SPECIAL SESSIONS: Computational Geometry (organized by Jiri Matousek) Proof Complexity (organized by Jan Krajicek) IMPORTANT DATES: Submission of papers: February 10, 2010 Notification of acceptance: March 20, 2010 Final version due: March 30, 2010 Early registration: April 10, 2010 SCOPE: The three main themes of the conference continue to be Computability, Complexity, and Algorithms. It aims to bring together researchers with interests in theoretical computer science, algorithmic mathematics, and applications to the physical sciences. Typical but not exclusive topics of interest include: - algorithmic graph theory and combinatorics, - algorithmic algebra, number theory and coding theory, - algorithms and data structures, - automata and neural networks, - computable mathematics, - computational biology, - computational complexity, - computational game theory, - computational geometry, - continuous and real computation, - cryptography, - decidability and undecidability, - generalized and higher type computation, - learning theory, - models of computation, - natural computation, - on-line algorithms, - parallel algorithms, - physical computability, - proofs and computation, - quantum computing, - randomness, - relative computability and degree structures, - theoretical problems in networks and security, - network information, - network structures and algorithms, - Turing definability. SUBMISSIONS: The submission must not exceed 10 pages in Springer-Verlag Lecture Notes LaTeX style. A clearly marked appendix that will be read at the discretion of the program committee may be added. Simultaneous submission of papers to any other conference with published proceedings or submitting papers previously accepted for journal publication is not allowed. Only electronic submissions in postscript or pdf formats are accepted. PROCEEDINGS: Invited papers and accepted contributions will be published in the conference proceedings in Lecture Notes in Computer Science, Springer-Verlag. A special issue of Theoretical Computer Science published by Elsevier containing selected contributions presented at the conference is planned. SPONSORS: DIMATIA - Center for Discrete Mathematics and ITI - Institute for Theoretical Computer Science, Charles University, Prague Further details are available on the conference web site http://www.tamc2010.cz =========================================================================== =========================================================================== 5. (from Geoff Sutcliffe) Computer Science Logic (CSL 2010) - 1st Call for Papers: CSL 2010 First Call for Papers The Annual Conference of the European Association for Computer Science Logic August 23-27, 2010, Brno, Czech Republic http://www.mat.uc.pt/~csl/ Submission (title & abstract): March 26, 2010 Notification: May 17, 2010 Submission (full paper): April 2, 2010 Final papers: June 6, 2010 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 19th EACSL Annual Conference on Computer Science Logic (CSL 2010) and the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010) are federated and organized in parallel at the same place. The federated MFCS & CSL 2010 conference has common plenary sessions and social events for all participants. The technical program and proceedings of MFCS 2010 and CSL 2010 are prepared independently. The MFCS & CSL 2010 conference is accompanied by satellite workshops on more specialized topics. Suggested 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, 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, categorical logic and topological semantics, domain theory, database theory, specification, extraction and transformation of programs, logical foundations of programming paradigms, verification and program analysis, linear logic, higher-order logic, nonmonotonic reasoning. Proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of the LNCS series. Each paper accepted by the Programme Committee must be presented at the conference by one of the authors, and a final copy must be prepared according to Springer's guidelines. Submitted papers must be in Springer's LNCS style and of no more than 15 pages, presenting work not previously published. They must not be submitted concurrently to another conference with refereed proceedings. The PC chairs should be informed of closely related work submitted to a conference or journal by March 19, 2010. Papers authored or coauthored by members of the Programme Committee are not allowed. Papers will be submitted through the conference website. Submitted papers must be in English and provide sufficient detail to allow the Programme Committee to assess the merits of the papers. 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 introduction which is directed at all members of the program committee. The Ackermann Award for 2010 will be presented to the recipients at CSL'10. *** Programme Committee Armin Biere (Linz) Lars Birkedal (ITU, Denmark) Nikolaj Bjorner (Redmond) Manuel Bodirsky (Paris) Mikolaj Bojanczyk (Warsaw) Iliano Cervesato (Doha) Krishnendu Chatterjee (Klosterneuburg) Agata Ciabattoni (Vienna) Anuj Dawar (Cambridge, co-chair) Azadeh Farzan (Toronto) Georg Gottlob (Oxford) Martin Hofmann (Munich) Orna Kupferman (Jerusalem) Christof Loeding (Aachen) Joao Marques-Silva (Dublin) Tobias Nipkow (Munich) Prakash Panangaden (Montreal) R. Ramanujam (Chennai) Simona Ronchi della Rocca (Torino) Alex Simpson (Edinburgh) Pascal Tesson (Quebec) Helmut Veith (Vienna, co-chair) Yde Venema (Amsterdam) *** CSL/MFCS Plenary Speakers David Basin (Zurich) Herbert Edelsbrunner (Klosterneuburg) Erich Graedel (Aachen) Joseph Sifakis (Gieres) *** CSL Invited Speakers Peter O'Hearn (London) Jan Krajicek (Prague) Andrei Krokhin (Durham) Andrey Rybalchenko (Munich) Viktor Kuncak (Lausanne) *** Organizing Committee Jan Bouda (Brno, chair) *** Conference address MFCSL 2010 Faculty of Informatics Masaryk University, Botanicka 68a, 60200 Brno Czech Republic [email protected] =========================================================================== =========================================================================== 6. (from Kai Brunnler) Proof, Computation and Complexity (PCC 2010) - Call for Papers: =============================== CALL FOR PAPERS 9th Proof, Computation and Complexity PCC 2010 June 18-19, 2010 Bern, Switzerland http://pcc2010.unibe.ch/ =============================== Aim and scope -------------------- The aim of PCC is to stimulate research in proof theory, computation, and complexity, focusing on issues which combine logical and computational aspects. Topics may include applications of formal inference systems in computer science, as well as new developments in proof theory motivated by computer science demands. Specific areas of interest are (non-exhaustively listed) foundations for specification and programming languages, logical methods in specification and program development including program extraction from proofs, type theory, new developments in structural proof theory, and implicit computational complexity. Organisers ---------------- * Kai Brunnler, Bern (co-chair) * Alessio Guglielmi, Loria * Reinhard Kahle, Coimbra * Thomas Studer, Bern (co-chair) Invited Speakers (provisional list) ---------------------------------------------- * Agata Ciabattoni (Wien) Contributions ------------------ PCC is intended to be a lively forum for presenting and discussing recent work. Participants who want to contribute a talk are asked to submit an abstract (Pdf, 1-2 pages) to [email protected]. The collection of abstracts will be available at the meeting. Important Dates ---------------------- Submission deadline : May 1, 2010 Notification to authors : May 15, 2010 Workshop: June 18-19, 2010 =========================================================================== =========================================================================== 7. (from Thierry Coquand) 4 PhD positions in Formalization of Mathematics in Type Theory: 4 PhD positions in Formalization of Mathematics in Type Theory We are looking for students with a strong interest in functional programming and mathematics for two projects in formalization of mathematics in type theory. Among the theme of research are: constructive representation of algebraic numbers (in particular applied to computations on algebraic curves), homological algebra, category theory in type theory, as well as metatheory of types systems. Three positions are funded by an ERC Advanced Grant from the European Union. One position is within a Strep Open, 7th framework, which involves, as other sites, INRIA, INRIA-microsoft, Nijmegen and La Roja. The monthly salary is around 2350 euros. For more informations see http://www.gu.se/omuniversitetet/ledigaanstallningar =========================================================================== =========================================================================== 8. (from Serge Autexier) Artificial Intelligence and Symbolic Computation 2010 (AISC 2010) - First Call for Papers: AISC 2010 - 10th International Conference on ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION Theory, Implementations and Applications http://www.informatik.uni-bremen.de/~autexier/aisc2010 CNAM, Paris, France, July 5th - July 6th, 2010 CALL FOR PAPERS Artificial Intelligence and Symbolic Computation are two views and approaches for automating problem solving, in particular mathematical problem solving. The two approaches are based on heuristics and on mathematical algorithmics, respectively. Artificial Intelligence can be applied to Symbolic Computation and Symbolic Computation can be applied to Artificial Intelligence. Hence, a wealth of challenges, ideas, theoretical insights and results, methods and algorithms arise in the interaction of the two fields and research communities. Advanced tools of software technology and system design are needed and a broad spectrum of applications is possible by the combined problem solving power of the two fields. Hence, the conference is in the center of interest and interaction for various research communities: * Artificial Intelligence * Logic * Symbolic Computation * Software Technology * Computer Algebra * Semantic Web Technology * Automated Reasoning * Mathematical Knowledge Management * Formal mathematics * Computer-based Math Teaching & Didactics * Machine Learning * Computer-Supported Publishing * Automated Discovery * Language and System Design Topics ====== Topics of particular interest of the conference include: * AI in Symbolic Mathematical Computing * Computer Algebra Systems and Automated Theorem Provers * Symmetries in AI problems * Engineering, Industrial and Operations Research Applications * Foundations and Complexity of Symbolic Computation * Mathematical Modeling of Multi-Agent Systems * Implementations of Symbolic Computation Systems * Programming Languages for Symbolic Computation * Symbolic Computations for Expert Systems and Machine Learning * Symbolic Computation and Ontologies * Logic and Symbolic Computing * Implementation and Performance Issues * Intelligent Interfaces * Symbolic Techniques for Document Analysis Papers on other topics with links to the above research fields and topics will also be welcomed for consideration. Proceedings =========== The proceedings of the conference will be published as a volume in the series Lecture Notes in Artificial Intelligence (LNAI) by Springer-Verlag. Accepted papers will have to be prepared in LaTeX and formatted according to the requirements of the Springer's LNAI series (the corresponding style files can be downloaded from http://www.springer.de/comp/lncs/authors.html and are the same for LNCS and LNAI). Submission ========== Theoretical and applied research papers on all topics within the scope of the conference are invited. Submitted papers (in English) must not exceed 15 pages in length (in the LNCS style). The title page should contain the title, author(s) with affiliation(s), e-mail address(es), listing of keywords and abstract plus the topics from the above list to which the paper is related. The program committee (PC) will subject all submitted papers to a peer review. Theoretical papers will be judged on their originality and contribution to their field, and applied papers on the importance and originality of the application. Results must be original and have not been published elsewhere. The web page for electronic submission is at: http://www.easychair.org/conferences/?conf=aisc20100 Best Paper Awards ================= Every submission automatically competes for the Best Paper Award. Papers which have been mainly developed by (PhD) students can be marked as student papers upon submission to also compete for the Best Student Paper Award. Important Dates =============== Abstract Submission deadline: February 19, 2010 Submission deadline: February 26, 2010 Notification: April 18, 2010 Camera Ready Version: April 28, 2010 Conference: July 5 - July 6, 2010 =========================================================================== =========================================================================== Items for the next CiE Newsletter should be sent to [email protected] to arrive by January 30, 2010 ___________________________________________________________________________ ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2010 http://www.cie2010.uac.pt/ CiE Membership Application Form http://www.cs.swan.ac.uk/acie ALAN TURING YEAR http://www.turingcentenary.eu/ ___________________________________________________________________________ _______________________________________________ Logica-l mailing list [email protected] http://www.dimap.ufrn.br/cgi-bin/mailman/listinfo/logica-l
