Newsletter 103 January 29, 2006 ******************************************************************* * Past issues of the newsletter are available at http://www.informatik.hu-berlin.de/lics/newsletters/ * Instructions for submitting an announcement to the newsletter can be found at http://www.informatik.hu-berlin.de/lics/newsletters/inst.html * To unsubscribe, send an email with "unsubscribe" in the subject line to email@example.com ******************************************************************* TABLE OF CONTENTS * CONFERENCES AND WORKSHOPS MFPS 2006 - Call for Papers ICCL Summer School 2006 FLoC 2006 - Call for Papers LCC 2006 - Call for Papers STRATEGIES 2006 - Call for Papers GLOBAN Summer School 2006 - Call for Participation RELATIONS AND KLEENE ALGEBRA IN COMPUTER SCIENCE 2006 * AWARDS ACKERMANN AWARD - Call for Nominations * VACANCIES Tenure Track Professor Positionsm Universite Du Quebec a Montreal, Montreal, Canada PhD-Position at the University of Marburg, Germany MATHEMATICAL FOUNDATIONS OF PROGRAMMING SEMANTICS (MFPS 2006) May 24 - May 27, 2006 Genova, Italy * We are now accepting submissions for MFPS 22. * The invited speakers for MFPS 22 include - Marcelo Fiore (Cambridge) - Eugenio Moggi (Genova) - Prakash Panangaden (McGill) - Davide Sangiorge (Bologna) - Peter Selinger (Dalhousie) and - Steve Zdancewic (Penn) * In addition, there will be special sessions on security, on timed systems, and on quantum computing. There also will be a Tutorial Day on May 23 on Separation Logic; the lecturers will be Stephen Brookes (CMU), Peter O'Hearn (QMW) and John Reynolds (CMU). * Researchers are encouraged to submit papers in programming semantics, its mathematical and logical foundations and related areas, as well as in the areas listed above. Submissions should be made in the form of a PostScript or pdf file thact can be printed on any standard printer. The deadline for submissions is Midnight, Pacific Standard Time, Wednesday, February 22, 2006. * More information about the meeting together with precise instructions about submissions can be found at the MFPS 22 web page http://www.math.tulane.edu/~mfps/mfps22.htm ICCL SUMMER SCHOOL 2006 ON KNOWLEDGE STRUCTURES June 24 - July 8, 2006 Technische Universität Dresden Call for Participation * See http://www.computational-logic.org/iccl-ss-2006 for more information. * TOPIC The topic of this year's summer school is KNOWLEDGE STRUCTURES It is common wisdom that the still growing power of digital data processing greatly enhances the wealth of human knowledge and will continue to do so. A precondition for this is, however, that knowledge is encoded and represented in a computer-accessible manner, such that it can be algorithmically processed. This requires, in turn, the use of appropriate formal structures for knowledge representation and knowledge processing. Such structures, called `Knowledge Structures', will be the topic of this year's ICCL summer school. There are many approaches to this topic ranging from formal logics, to mathematical and data mining methods. The summer school's focus is on the following three areas: - Logic, with Description Logic and Inductive Logic Programming, - Cluster Methodology, with applications to text clustering and Semantic Web mining, and - Formal Concept Analysis, with applications to Ontologies and Machine Learning. The basic ideas of these areas will be introduced and discussed, with the aim of providing a broad methodological repertoire for future research and applications. * REGISTRATION If you want to attend the summer school, we'd prefer that you register by March 18, 2006. (See the online registration on the web page mentioned above.) For all who want to apply for a grant, this deadline is obligatory. After March 18, 2006, registration will be possible as long as there are vacant places. (Since we intend to restrict participation to about 60 people, in case of excessive demand, we will have to close the registration to the summer school.) People applying until March 18, 2006, and applying for a grant will be informed about respective decisions on grants by end of March 2006. * FEES We ask for a participation fee of 150 EUR. * GRANTS A limited number of grants may be available, please indicate in your application if the only possibility for you to participate is via a grant. Applications for grants must include an estimate of travel costs and they should be sent together with the registration. * INTEGRATED WORKSHOP It will be possible for some participants to present their research work during a small workshop integrated in the summer school. If you would like to do so, please register by means of the online workshop registration form on the web page mentioned above. * COURSE PROGRAM - Finger Exercises in Formal Concept Analysis. Bernhard Ganter (Technische Universität Dresden) - Knowledge, Reasoning, and the Semantic Web. Pascal Hitzler (AIFB Universität Karlsruhe) - Text clustering and Semantic Web mining. Andreas Hotho (Universität Kassel) - Inductive Logic Programming. Stefan Kramer (Technische Universität München) - Cluster Methodology. Sabine Krolak-Schwerdt (Universität Saarbrücken) - Machine Learning and Formal Concept Analysis. Sergei Kuznetsov (VINITI, Moscow, Russia) - Reasoning in Description Logics. Franz Baader (Technische Universität Dresden) * PEOPLE INVOLVED Chairs of the ICCL Summer School 2006 - Bernhard Ganter - Steffen Hölldobler Organizing Committee - Julia Koppenhagen - Bertram Fronhöfer THE 2006 FEDERATED LOGIC CONFERENCE FLOC'06 August 10 -- August 22, 2006 Seattle, Washington, USA http://research.microsoft.com/floc06/ Call for Papers * In 1996, as part of its Special Year on Logic and Algorithms, DIMACS hosted the first Federated Logic Conference (FLoC). It was modeled after the successful Federated Computer Research Conference (FCRC), and synergetically brought together conferences that apply logic to computer science. The second Federated Logic Conference (FLoC'99) was held in Trento, Italy, in 1999, and the third (FLoC'02) was held in Copenhagen, Denmark, in 2002. * The Fourth Federated Logic Conference (FLoC'06) will be held in Seattle, Washington, in August 2006, at the Seattle Sheraton (http://www.sheraton.com/seattle). * The following conferences will participate in FLoC'06: - Int'l Conference on Computer-Aided Verification (CAV) - Int'l Conference on Rewriting Techniques and Applications (RTA) - IEEE Symposium on Logic in Computer Science (LICS) - Int'l Conference on Logic Programming (ICLP) - Int'l Conference on Theory and Applications of Satisfiability Testing (SAT) - Int'l Joint Conference on Automated Reasoning (IJCAR) * In addition, FLoC'06 will host 42 workshops. Pre-conference workshops will be held on August 10-11. LICS, RTA, and SAT will be held in parallel on August 12-15, to be followed by mid-conference workshops and excursions on August 15-16. CAV, ICLP, and IJCAR will be held in parallel on August 16-21, to be followed by post-conference workshops on August 21-22. Plenary events involving all the conferences are planned. * Calls for papers for the conferences and workshops are available at the conference website: http://research.microsoft.com/floc06/. We invite you to submit papers to FLoC'06 conferences and workshops. * FLoC'06 Steering Committee - Moshe Y. Vardi (General Chair) - Jakob Rehof (Conference Chair) - Edmund Clarke (CAV) - Reiner Hahnle (IJCAR) - Manuel Hermenegildo (ICLP) - Phokion Kolaitis (LICS) - Henry Kautz (SAT) - Aart Middeldorp (RTA) - Andrei Voronkov (IJCAR) WORKSHOP ON LOGIC AND COMPUTATIONAL COMPLEXITY (LCC'06) (affiliated with LICS 2006) Call for Papers Seattle, USA, August 10-11, 2006. http://www.cis.syr.edu/~royer/lcc/LCC06/ * Topics of interest include: complexity analysis for functional languages, complexity in database theory, complexity in formal methods, computational complexity in higher types, formal methods for complexity analysis of programs, foundations of implicit computational complexity, logical & machine-independent characterizations of complexity classes, logics closely related to complexity classes, proof complexity semantic approaches to complexity, software that applies LCC ideas, type systems for controlling complexity * All submissions must be done electronically. See the workshop webpage for details. * Submission Deadline : June 12, 2006 * Program committee: Georg Gottlob (University of Oxford) Neil Immerman (University of Massachusetts, Amherst) co-chair Russell Impagliazzo (University of California, San Diego) Neil Jones (University of Copenhagen) Bruce Kapron (University of Victoria) co-chair Harry Mairson (Brandeis University) Karl-Heinz Niggl (University of Technology, Ilmenau) Toniann Pitassi (University of Toronto) Thomas Schwentick (University of Dortmund) Colin Stirling (University of Edinburgh) STRATEGIES 2006 Sixth International Workshop on Strategies in Automated Deduction A FLoC'06 Affiliated Workshop http://research.nianet.org/strategies06 * This workshop is a successor to both the series of STRATEGIES workshops associated with CADE and IJCAR and to the STRATA 2003 workshop associated with TPHOLs. Papers and participation are invited from both the fully automatic and interactive theorem proving communities. * For the full Call for Papers see: http://research.nianet.org/strategies06/cfp.html GLOBAN SUMMER SCHOOL 2006: THE GLOBAL COMPUTING APPROACH TO ANALYSIS OF SYSTEMS Technical University of Denmark August 21-25, 2006 Call for Participation http://www.imm.dtu.dk/globan * The one-week GLOBAN summer school will give doctoral students and other young researchers a comprehensive overview of contemporary techniques for analysis and verification of models of global computing systems characterized by concurrency, communication, heterogeneity and distribution. The school is organised by IMM/DTU in association with the SENSORIA project. * Lecturers. Process Algebras and Concurrent Systems (Rocco De Nicola, University of Florence, Italy) Equality of processes: equivalences and proof techniques (Davide Sangiorgi, University of Bologna, Italy) Flow Logics (Flemming Nielson, Technical University of Denmark) Computing with relations using Horn clauses (Helmut Seidl, Technical University of Munich, Germany) Type systems (Vasco Vasconcelos, University of Lisbon, Portugal) Modal logics (Luís Caires, New University of Lisbon, Portugal) Model checking (Kim Guldstrand Larsen, University of Aalborg, Denmark) Stochastic modelling (Stephen Gilmore, University of Edinburgh, Scotland) * Details of registration, participant fees and a grant scheme will be posted on webpage by March 1, 2006 * For details see webpage RELATIONS AND KLEENE ALGEBRA IN COMPUTER SCIENCE Second Call for Papers Manchester, UK, 29 Aug-2 Sep 2006 www.cs.man.ac.uk/relmics06/ * The RelMiCS Conference is the main forum for the relational calculus as a conceptual and methodological tool. The AKA Workshop is a forum on topics related to Kleene algebras. As in previous years, the two events are co-organised; they have a joint programme committee and joint proceedings. * Topics: Relation algebras, Kleene algebras, related formalisms such as process algebras, fixed point calculi, idempotent semirings, quantales, allegories, dynamic algebras, cylindric algebras, and their applications. Special focus will be on formal methods for software engineering, logics of programs and links with neighbouring disciplines. * Invited speakers: - Ernie Cohen, Microsoft, USA - Roger D. Maddux, Iowa State University, USA - Jeff Sanders, Oxford University, UK * Important dates: - Abstract submission: 27 February 2006 - Paper submission: 6 March 2006 * Paper submission: Authors are invited to submit papers of at most 15 pages in LNCS style. * Publication details: The proceedings of the conference will be published in the Springer LNCS series. * Student programme: A PhD training programme will be co-organised with the conference. - Application submission: 30 May 2006 * Programme committee: Roland Backhouse, Brandon Bennett, Rudolf Berghammer, Stephane Demri, Jules Desharnais, Zoltan Esik, Marcello Frias, Hitoshi Furusawa, Stephane Gaubert, Steven Givant, Valentin Goranko, Martin Henson, Ali Jaoua, Peter Jipsen, Wolfram Kahl, Yasuo Kawahara, Zhiming Liu, Bernhard Moeller, Damian Niwinski, Ewa Orlowska, Alban Ponse, Ingrid Rewitzky, Ildiko Sain, Holger Schlingloff, Gunther Schmidt, Renate Schmidt (General Chair), Giuseppe Scollo, Georg Struth (PC chair), Harrie de Swart, Michael Winter. * Please consult the website for further information. AWARD NOMINATIONS: ACKERMANN AWARD * The EACSL Outstanding Dissertation Award for Logic in Computer Science (The Ackermann Award) will be presented to the recipients at the annual conference of the EACSL (CSL'xx). The jury is entitled to give more than one award per year. * Submissions for the Ackermann Award 2006 Eligible for the 2006 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.2004 and 31.12.2005. * The deadline for submission is 31.1.2006 . Submission details follow below. * 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 laudatio in the CSL proceedings, - travel support to attend the conference. * The jury consists of seven members: - The president of EACSL, J. Makowsky (Haifa); - The vice-president of EACSL, D. Niwinski (Warsaw); - One member of the LICS organizing committee, S. Abramsky (Oxford); - B. Courcelle (Bordeaux); - E. Graedel (Aachen); - M. Hyland (Cambridge); - A. Razborov (Moscow and Princeton); * The candidate or his/her supervisor has to submit 1. the thesis (ps or pdf file); 2. a detailed description (not longer than 20 pages) of the thesis in ENGLISH (ps or pdf file); 3. a supporting letter by the PhD advisor and two supporting letters by other senior faculty or researchers in equivalent positions (in English); supporting letters can also be sent directly to J.A. Makowsky (firstname.lastname@example.org); 4. a short CV of the candidate. 5. a copy of the document asserting that the thesis was accepted as a PhD thesis at a recognized University (or equivalent institution) and that the candidate has received his/her PhD within the specified period (scanned as pdf-file or faxed); * The submission should be sent by e-mail as attachments to email@example.com With the following subject line and text: - Subject: Ackermann Award Submission - Text: Name of candidate, list of attachments * Submission can be sent via several e-mail messages. If this is the case, indicate it in the text. Letters of Support and document can also be faxed to Prof. J. Makowsky Ackermann Award +972-4-829 3900 * For more details, see http://www.dimi.uniud.it/~eacsl/award.html VACANCY: TENURE TRACK PROFESSOR POSITIONS, UNIVERSITE DU QUEBEC A MONTREAL, MONTREAL, CANADA * Two tenure track positions are available at the computer science department of UQAM. * One position is in - Data Bases (Data Mining) and the second position is in - Combinatorics and Algorithms (Bio-Informatics) * All teaching at UQAM is done in French, so a working knowledge of this language is necessary. * Priority will be given to Canadian citizens and landed immigrants. * Application deadline is March 15th 2006. * The complete announcement is available at http://www.info.uqam.ca/Members/admin/AnnonceInformatique.pdf VACANCY: PHD-POSITION - WISSENSCHAFTL. MITARBEITER/IN (BAT IIA) - University of Marburg, Germany * The Department of Mathematics and Computer Science at the University of Marburg, Germany, offers a full time PhD-Position - Wissenschaftl. Mitarbeiter/in (BAT IIa) - in the area Universal Coalgebra / Universal Algebra, Verification, Formal Methods. * Prerequisites: Excellent degree (Diplom or Master) in Computer Science or Mathematics. Strong background in one or more of the above areas. German language fluency. * Tasks: Service (organization, preparation, counselling) in teaching and research at the undergraduate and graduate level. PhD-Research * The contract is initially for 1 year, with the possibility for extensions to a total of at most 5 years * If you are interested, please get in touch with Prof. Dr. H.Peter Gumm firstname.lastname@example.org * The official advertisement can be found at http://www.mathematik.uni-marburg.de/~gumm/Stelle/Stelle.pdf
Back to the LICS web page.