[Elsnet-list] LICS Newsletter 102b

Kreutzer + Schweikardt lics at informatik.hu-berlin.de
Thu Dec 22 17:45:55 CET 2005

Newsletter 102b
Second part of the split newsletter 102
December 23, 2005

* Past issues of the newsletter are available at
* Instructions for submitting an announcement to the newsletter
  can be found at
* To unsubscribe, send an email with "unsubscribe" in the 
  subject line to lics at informatik.hu-berlin.de

  LICS 2006 - Call for Papers
  Logic and Combinatorics - First Announcement

   August  12th - 15th, 2006,
   Seattle, Washington
   Call for Papers
* Twenty-First Annual IEEE Symposium on Logic in Computer Science (LICS 2006)
  The LICS Symposium is an annual international forum on theoretical and
  practical topics in computer science that relate to logic broadly construed.  
  LICS 2006 will be organized as part of the Fourth Federated Logic Conference 
  (FLoC 2006) to be held in Seattle from August 10 to August 22, 2006. 
  Visit http://research.microsoft.com/floc06/ for information regarding 
  FLoC 2006 and the participating meetings.
* Suggested, but not exclusive, topics of interest for LICS 2006 include:
  automata theory, automated deduction, categorical models and logics,
  concurrency and distributed computation, constraint programming,
  constructive mathematics, database theory, domain theory, finite model
  theory, formal aspects of program analysis, formal methods, hybrid systems,
  lambda and combinatory calculi, linear logic, logical aspects of
  computational complexity, logics in artificial intelligence, logics of
  programs, logic programming, modal and temporal logics, model checking,
  probabilistic systems, process calculi, programming language semantics,
  reasoning about security, rewriting, specifications, type systems and type
  theory, and verification.  We welcome submissions in emergent areas, such as
  bioinformatics and quantum computation, if they have a substantial
  connection with logic.
* Important Dates
  Authors are required to submit a paper title and a short abstract of about 
  100 words before submitting the extended abstract of the paper. All submissions 
  will be electronic.
* Important Dates
  - Paper Registration Deadline (with titles & short abstracts): February 3, 2006
  - Paper Submission Deadline: February 10, 2006  
  - Author notification: April 14, 2006
  - Final versions for the proceedings: May 5, 2006.
  All deadlines are firm; late submissions will not be considered. 
  Detailed information about electronic paper submission will
  be posted at the LICS 2006 web site.
* Submission instructions:
  Extended abstracts may be no longer than 10 pages including references, and
  must be formatted in the IEEE Proceedings two-column camera-ready style
  (IEEE style files will be accessible from the LICS 2006 web site).  
  If necessary, detailed proofs of technical results can be included in a 
  clearly-labeled appendix in the same two-column format following the 
  10-page extended abstract or there can be a pointer to a manuscript on a 
  web site.  This material may be read at the discretion of the program committee.
  Extended abstracts not conforming to the above requirements
  concerning format and length may be rejected without further
* Short Presentations
  LICS 2006 will have a session of short (5-10 minutes) presentations.
  This session is intended for descriptions of work in progress, student
  projects, and relevant research being published elsewhere; other brief
  communications may be acceptable. Submissions for these presentations,
  in the form of short abstracts (1 or 2 pages long), should be entered
  at the LICS 2006 submission site between 15th April and 21st April 2006.
  Authors will be notified of acceptance or rejection by 28th April 2006.
* Kleene Award for Best Student Paper:  
  An award in honor of the late S.C. Kleene will be given for the best 
  student paper, as judged by the program committee.  Details concerning 
  eligibility criteria and procedure for consideration for this award will be 
  posted at the LICS web site. The program committee may decline to make the 
  award or may split it among several papers.
* Invited Speakers
  The following distinguished speakers have agreed to give invited talks at 
  LICS 2006: 
  - Andreas Blass (Univ. of Michigan, Ann Arbor, USA),
  - Andy Gordon (Microsoft Research, Cambridge, UK),
  - Orna Kupferman (Hebrew Univ., Israel);
  - the LICS/RTA/SAT joint plenary invited speaker is 
    Randy Bryant (Carnegie Mellon Univ., USA);
  - the invited speakers at the FLoC session celebrating the 
    birth centennial of Kurt Goedel are 
    John Dawson (Pennsylvania State Univ., York, USA) and 
    Dana Scott (Carnegie Mellon Univ., USA).
* Colocated Events
  The following conferences are colocated with LICS at FLoC 2006: 
  CAV, ICLP, IJCAR, RTA, SAT; visit the FLoC 2006 homepage at
  http://research.microsoft.com/floc06/ for details.
  There will also be a number of workshops sponsored by the FLoC conferences. 
  Details on workshops affiliated with LICS, in particular, can be found at the 
  LICS 2006 web site.
* Sponsorship
  The symposium is sponsored by the IEEE Technical Committee on Mathematical 
  Foundations of Computing.
* Program Chair
  Rajeev Alur, Univ. of Pennsylvania
* Program Committee:
  - Luca Aceto, Reykjavik Univ., Iceland and Aalborg Univ., Denmark 
  - Rajeev Alur, Univ. of Pennsylvania, USA
  - Christel Baier, Univ. of Bonn, Germany 
  - Maria Luisa Bonet, Polytechnic Univ. of  Catalunya, Spain
  - Flavio Corradini, Univ. of Camarino, Italy
  - Victor Dalmau, Univ. Pompeu Fabra, Spain
  - Thomas Eiter, TU Vienna, Austria
  - Kousha Etessami, Univ. of Edinburgh, UK
  - Amy Felty, Univ. of Ottawa, Canada
  - Cedric Fournet, Microsoft Research, UK
  - Patrice Godefroid, Bell Labs, USA
  - Jason Hickey, California Institute of Technology, USA
  - Radha Jagadeesan, DePaul Univ., USA
  - Leonid Libkin, Univ. of Toronto, Canada
  - Patrick Lincoln, SRI, USA
  - Yoram Moses, Technion, Israel
  - George Necula, Univ. of California at  Berkeley, USA
  - Joel Ouaknine, Oxford Univ., UK
  - Davide Sangiorgi, Univ. of Bologna, Italy
  - Mahesh Viswanathan, Univ. of Illinois at  Urbana-Champaign, USA
  - Thomas Wilke, Univ. of Kiel, Germany
* Conference Chair
  Magus Veanes, Microsoft Research, Redmond, USA
* Workshop Chair
  Philip J. Scott, Univ. of Ottawa, Canada
* Publicity co-chairs:
  - Stephan Kreutzer,  Humboldt-University Berlin, Germany
  - Nicole Schweikardt, Humboldt-University Berlin, Germany
* General chair:
  Phokion G. Kolaitis, IBM Almaden Research Center and 
                       Univ. of California, Santa Cruz, USA
* Organizing committee
  - Samson Abramsky,
  - Rajeev Alur,
  - Franz Baader,
  - Andrei Broder,
  - Samuel Buss,
  - Edmund Clarke,
  - Amy Felty,
  - Hal Gabow,
  - Lauri Hella,
  - Radhakrishnan Jagadeesan,
  - Alan Jeffrey,
  - Phokion Kolaitis (chair), 
  - Stephan Kreutzer,
  - Johann Makowsky,
  - John Mitchell,
  - Mogens Nielsen, 
  - Prakash Panangaden,
  - Femke van Raamsdonk,
  - Philip Scott, 
  - Nicole Schweikardt,
  - Magus Veanes,
  - Andrei Voronkov
* Advisory board
  - Robert Constable,
  - Yuri Gurevich, 
  - Claude Kirchner, 
  - Dexter Kozen, 
  - Ursula Martin,
  - Albert Meyer, 
  - Leszek Pacholski, 
  - Vaughan Pratt, 
  - Andre Scedrov, 
  - Dana S. Scott, 
  - Moshe Y. Vardi, 
  - Glynn Winskel

   23rd  and 24th September 2006
   Szeged, Hungary
   Satellite Workshop of the conference:
   Computer Science Logic 25th - 29th September 2006
* The annual conference Computer Science Logic is sponsored by the
  European Association for Computer Science Logic. The conference is
  intended for computer scientists whose research activities involve
  logic, as well as for logicians working on issues significant for
  Computer Science.
* A workshop on Applications of Combinatorics to Logic and of Logic to
  Combinatorics will be organized just before the conference Computer
  Science Logic to be held in Szeged in 2006.
* Typical topics will be :
  - Proof complexity
  - Complexity of constraint satisfaction problems and other logically based
  - Logical expression of graph properties, graph decompositions, graph
    transformations and related notions.
  - Logical expression of properties of matroids, isotropic systems, graph
    drawings and knots.
  - Counting and enumeration problems.
  - Polynomials associated with graphs and other combinatorial structures.
  - Ramsey-type arguments applied to 0/1 laws and Ehrenfeucht-Fraisse 
  - "Countable" model theory.
  This list of topics is not exhaustive.
* This workshop should interest people who work in logic (proof
  theory, finite model theory) on the one hand, and in combinatorics
  (graph theory, counting problems, algebraic notions associated
  with graphs and discrete structures) on the other. Recent results show
  how fruitful it is to associate graph theory, algebraic notions and
  monadic second-order logic.
* All lectures will be on invitation. They will be surveys or 
  presentations of  technical  results.  A session will be devoted to
  discussing open problems, research directions and future events.
* Do not hesitate to contact B Courcelle,
  organizer of the Workshop  : courcell at labri.fr
* Provisional information can be found from 
* The organizer of CSL 2006  is Zoltan Esik :
  ze at inf.u-szeged.hu

More information about the Elsnet-list mailing list