Newsletter 27

June 15, 1995


FLOC'96 LOGO CONTEST WINNER
The FLoC organizing committee has selected Luca Cardelli's entry as the
official logo for the 1996 Federated Logic Conference.  To view the logo,
see the FLoC home page.

INTEREST GROUP IN PURE AND APPLIED LOGICS (IGPL)
* Description.  IGPL is sponsored by The European Foundation for Logic,
  Language and Information (FoLLI), and currently has a membership of over
  800 researchers in various aspects of logic (symbolic, mathematical,
  computational, philosophical, etc.) from all over the world (currently,
  55 countries). Our main activity is that of a research and information
  clearing house.
* Activities.  Exchanging information about research problems,
  references and common interest among group members.  Helping to obtain
  photocopies of papers to colleagues (under the appropriate copyright
  restrictions), especially where there may be difficulties of access.
  Supplying review copies of books through the Journals on which some of
  us are editors.  Helping to organise exchange visits and workshops
  among members.  Advising on papers for publication.  Editing and
  distributing a Newsletter and a Bulletin (the first scientific journal
  in logic which is FULLY electronic: submission, refereeing, revising,
  typesetting, publishing, distributing).  Keeping a public archive of
  papers, abstracts, etc., accessible via ftp.  Wherever possible,
  obtaining reductions on group (6 or more) purchases of logic books
  from publishers.
* Joining.  Please send personal details (name, postal address, phone, fax,
  e-mail address, research interests) to: IGPL Headquarters, c/o Prof Dov
  Gabbay, Imperial College, Dept of Computing, 180 Queen's Gate, London SW7
  2BZ, United Kingdom.  E-mail: igpl-request@doc.ic.ac.uk.

BULLETIN OF THE INTEREST GROUP IN PURE AND APPLIED LOGICS (IGPL)
* General Description.  The Bulletin is published several times per year by
  the Max Planck Institut f"ur Informatik, Saarbr"ucken, and Imperial
  College, London.  The Bulletin is an attempt to solve a problem in the
  logic (in particular, IGPL) community: long delays and large backlogs in
  publication of papers in current journals; Very tight time limits and
  page number limits on submission.  Papers in the final form should be in
  LaTeX.  The review process is quick, and is usually made by other IGPL
  members.  The Bulletin is available as an electronic journal as well as a
  hard copy journal.
* Editor-in-Chief.  Dov M. Gabbay.
* Executive Editors.  Ruy de Queiroz & Hans J"urgen Ohlbach.
* Editorial Board. Jon Barwise, Wilfrid Hodges, Hans Kamp, Robert Kowalski,
  Grigori Mints, Ewa Orlowska, Amir Pnueli, Vaughan Pratt, Johan van
  Benthem.
* Latest Issue via ftp.  From theory.doc.ic.ac.uk (146.169.2.27 or
  146.169.22.150), directory theory/forum/igpl/Bulletin/V3-1, binary file
  V3-1-whole.ps.gz.

WORKSHOP ON MODEL THEORY AND COMPLEXITY 
  September 21-23, 1995, Sevilla, Spain
* Topics.  The aim of this Workshop is the exposition of results on the
  relationship between Model Theory and Complexity Theory, as well as the
  creation of a forum for the debate and the interchangement of concepts
  and methods among the researchers on these fields of investigation.
  Model Theory, finite model theory, models of arithmetic, complexity
  theory, Hoare logic and arithmetic, infinitary logic, high-order logic,
  applications of model theory (to philosophy of science, to the analysis
  of natural language, etc.).
* Program Committee.  E. Diaz Estevez, E. Dominguez Murillo,
  A. Fernandez Margarit, J. Flum, L.M. Laita de la Rica, P. Martinez
  Freire.
* Languages.  The languages of this Workshop are English and Spanish.
* Invited Lecturers.  The following lecturers have been invited, most of
  them having accepted: W. Hodges, A. Fernandez Margarit, H. Marraud,
  M. Mytilinaios, J. Truss, C. Dimitracopoulos, M. Manzano, R. Kaye,
  J. Flum, R. Farre, A. Berarducci, M. Otero.
* Registration.  The number of participants will be limited. Students must
  certify their condition. There will be a number of fellowships for the
  students.
* Further Information.  Joaquin Borrego Diaz, Departamento de Algebra,
  Computacion, Geometria y Topologia, Facultad de Matematicas, Avda. Reina
  Mercedes, s/n, 41012 Sevilla, Spain, Fax: 34 5 4557970, E-mail:
  borrego@obelix.cica.es.  Angel Nepomuceno Fernandez, Departamento de
  Filosofia y Logica y Filosofia de la Ciencia, Facultad de Filosofia,
  Avda. San Francisco Javier s/n, 41005 Sevilla, Spain, Fax: 34 5 4557796.

COMPUTING: THE AUSTRALASIAN THEORY SYMPOSIUM (CATS'96)
  29-30 January, 1996. Melbourne, Australia
* Topics.  Papers are solicited in all areas of theoretical computer
  science, including algorithms (combinatorial, distributed, geometric,
  parallel), category theory, complexity, concurrency theory, formal
  semantics, logic in computer science, specification and verification.
* Co-located meetings.  Held in conjunction with Seventh Australasian
  Database Conference and Nineteenth Australasian Computer Science
  Conference.
* General chair.  Harald Sondergaard, University of Melbourne, Australia.
* Program chair.  Peter Eades, University of Newcastle, Australia.
* Program Committee.  John Crossley, Jeremy Gibbons, Mike Houle, Barry Jay,
  Liz Sonenberg, John Staples, C. P. Tsang.
* Submissions.  Electronic submission to cats96@cs.newcastle.edu.au.  For
  the full Call for Papers and submission guidelines, consult the WWW page
  mentioned above.  Alternatively send your address to cats96@cs.mu.au.oz
  and a hard copy for the CFP will be mailed out.  The deadline for
  submissions is 29 August, 1995.

SYMPOSIUM AND EXHIBITION ON INDUSTRIAL APPLICATIONS OF PROLOG (INAP-95)
  19, 20 October 19-20, 1995, Hino, Tokyo, Japan
* Topics.  The conference provides a forum for researchers and
  practitioners working on industrial Prolog applications to exchange
  research ideas and to share development experiences.  Topics include:
  Prolog in services, Prolog as R&D tool, software engineering, programming
  techniques, programming paradigms, standardization, industrial
  requirements.
* Submissions.  Authors are invited to submit full manuscripts (max 8 pages
  A4) or extended abstracts in English or Japanese.  Apply by August 18
  1995 with the authors' names, mailing addresses, e-mail addresses,
  telephone and facsimile numbers, paper title and abstract.  Authors of
  accepted papers are expected to present their papers at the conference.
* Chairman.  Prof. Shuichi Fukuda.
* Program Committee.  Dr. Oskar Bartenstein, Prof. Hon Wai Chun,
  Dr. Alexander Herold, Prof. Tohru Ihara, Prof. Geun Sik Jo, Prof. Uk Kim,
  Mr. Nobukuni Kino, Prof. Yoshiki Kishi, Prof. Isao Nagasawa, Prof. Mihoko
  Okada, Mr. Takao Ozaki, Prof. Naoyuki Tamura, Prof. Hajime Yoshino,
  Prof. Matthew Yuen.
* Correspondence.  Mr. Toshiaki Yagihashi, REN Associates, Inc., INAP
  Organizer's Office, 2nd Nichika Bldg, 2-12-14 Hamamatsucho, Minato-ku,
  Tokyo 105 Japan.  Tel +81-3-3433-2543. Fax +81-3-3433-3904.  Internet:
  pfe00252@niftyserve.or.jp.

SIXTH INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY (CONCUR '95)
  August 21-24, 1995, Philadelphia, Pennsylvania, USA
* Program, Registration Information.  Plain text, dvi, and postscript
  versions of the Call For Registration and the abstracts of the
  accepted papers, as well as the latest information on CONCUR '95 can
  be obtained electronically via the WWW page, by email from
  concur95@cis.upenn.edu, and via ftp from ftp.cis.upenn.edu
  (158.130.12.3) -- pub/concur95.
* Software Demonstrations.  The program will allow space and time for
  demonstrations of software related to the design and verification of
  concurrent systems.  Please contact Hong-Liang Xie
  (hxie@saul.cis.upenn.edu) if you are interested in demonstrating software
  at CONCUR '95.

3RD INT'L CONF. ON THE MATHEMATICS OF PROGRAM CONSTRUCTION (MPC '95)
  July 17-21, 1995, Kloster Irsee, Germany
* Topics.  The general theme of this series of conferences is the use of
  crisp, clear mathematics in the discovery and design of algorithms and in
  the development of corresponding software or hardware.  The theme
  reflects the growing interest in formal, mathematically based methods for
  the construction of software and hardware.  Topics include program
  correctness, programs analysis, program transformation, formal methods,
  semantics.
* Contact.  Prof. Dr. B. M\"oller (MPC '95), Institut f\"ur Mathematik,
  Universit\"at Augsburg, D-86135 Augsburg, Germany.  Fax: +49 821 598
  2274.  E-mail: moeller@uni-augsburg.de.

2ND CONF. ON INFORMATION-THEORETIC APPROACHES TO 
LOGIC, LANGUAGE, AND COMPUTATION
  July 18-21, 1996, Regent's College, London. 
* Topics.  The aim of the conference is to bring together researchers from
  such fields as Computing, Linguistics, Logic, Philosophy and the Social
  Sciences.  The themes of the conference include formal approaches to
  information and meaning, as well as applications in a number of relevant
  areas.  We solicit papers on the following topics: philosophical
  foundations of information, and information-based computation;
  applications of situation theory to the social sciences; visual logical
  systems and programming languages; mathematical foundations of the theory
  of information; formal theories of pragmatics and discourse.
* Program Committee.  J. Ginzburg, R. Koons, L. Moss (chair), H. Nakashima,
  M. de Rijke.
* Submissions.  authors are invited to submit a detailed abstract of a full
  paper of at most 10 pages by e-mail to ITALLC96@cs.indiana.edu (using
  `ITALLC96 Submission' as the subject line).  The cover page should
  include title, authors and the coordinates of the corresponding
  author. Submissions in LaTeX are encouraged.  The deadline for
  submissions is January 1, 1996.  The accepted papers will appear on a
  World Wide Web server.  We anticipate publishing a volume of proceedings.
  
FIRST INT'L WORKSHOP ``FRONTIERS OF COMBINING SYSTEMS'' (FROCOS'96)
  March 26-29, 1996, Munich, Germany
* Topics.  In various areas of logic, computation, language processing, and
  artificial intelligence there is an obvious need for using specialized
  formalisms and inference mechanisms for special tasks. In order to be
  usable in practice, these specialized systems must be combined with each
  other, and they must be integrated into general purpose systems.  The
  development of general techniques for the combination and integration of
  special systems has been initiated in many areas, and the Workshop
  ``Frontiers of Combining Systems'' intends to offer a common forum for
  these research activities.  Topics include: combination of logics (e.g.,
  modal logics, logics in AI, ...); combination of constraint solving
  techniques (unification and matching algorithms, general symbolic
  constraints, numerical constraints, ...)  and combination of decision
  procedures; integration of equational and other theories into deductive
  systems (e.g. theory resolution, constraint resolution, constraint
  paramodulation, ...); combination of term rewriting systems; integration
  of data structures (e.g., sets, multisets, lists) into CLP formalisms and
  deduction processes; hybrid systems in computational linguistics,
  knowledge representation, natural language semantics, and human computer
  interaction; logic modelling of multi-agent systems.
* Submissions.  A PostScript version of the full paper (preferable LaTeX
  format), not exceeding 15 pages (incl. title page and references), should
  be received via e-mail by October 16, 1995.  In addition, one hard copy
  of the paper should be received by the same date.  Please send
  submissions to the local organizer.  We intend to publish the proceedings
  as one volume of the Kluwer series on ``Applied Logic''.
* Program Committee.  F. Baader (co-chair), P. Baumgartner, P. Blackburn,
  A. Bockmayr, A. Boudet, J. Calmet, A. Colmerauer, D.M. Gabbay,
  H. Kirchner, H.J. Ohlbach, J. Pfalzgraf, M. de Rijke, W. Rounds,
  M. Schmidt-Schauss, K.U. Schulz (co-chair).
* Local Organization.  K.U. Schulz, CIS, University of Munich,
  Wagmuellerstr. 23, D-80538 Muenchen, Germany.  E-mail:
  schulz@cis.uni-muenchen.de.
* Further Information.  See the WWW page, under Events/Aktuell.

JOINT COMPUGRAPH/SEMAGRAPH WORKSHOP ON GRAPH REWRITING 
AND COMPUTATION (SEGRAGRA'95)
  August 28 - September 1, 1995, Volterra (Pisa, Italy)
* Aim.  Graph Rewriting and Term Graph Rewriting is the focus of two Esprit
  Basic Research Working Groups, COMPUGRAPH II and SEMAGRAPH II. They have
  decided to organize their final workshop as a common initiative, with the
  aim of presenting a coherent, detailed account of the achieved results
  and their view of the state of the art in the field.
* Invited Speakers.  Chris Wadsworth, Detlef Seese, Thomas Johnsson,
  Eike Best.
* Tutorials.  Rinus Plasmeijer, Bruno Courcelle, Andrea Corradini, Richard
  Kennaway, Jan Willem Klop, Hans-Joerg Kreowski
* Location.  Volterra is a historical town of about 13,000 people on the
  top of a hill, whose origins go back to the Etruscan period.  Its main
  flourishing period however was in the 13th and 14th centuries, and it
  still maintains the structure and the charm of the old medieval town,
  with curly streets, far reaching panoramas and several elegant civil
  buildings.  It is the main center in Italy of production and
  craftsmanship of alabaster.  Climate is breezy and usually fresh and dry.
  Volterra can be reached from the International airports of Pisa and
  Florence by train and bus in about 90 mins.
* Registration fee.  380,000 ITL (about 175 ECU). Includes proceedings,
  lunches, coffe breaks, excursion and workshop dinner.
* Accommodation.  For booking rooms at special conditions, contact
   BEFORE JUNE 30.
* Program chair.  Ugo Montanari, Dipartimento di Informatica, Universita'
  di Pisa, Corso Italia, 40, I-56100 Pisa,
  Italy. E-mail:segragra@di.unipi.it.
* Program committee.  B. Courcelle, H. Ehrig, C. Hankin, D. Janssens,
  J.W. Klop, H.-J. Kreowski, L. Leth, U. Montanari, R. Plasmeijer,
  J.-C. Raoult, G. Rozenberg, R. Sleep.
* Further Information.  For the Preliminary Program and any further
  Information contact Andrea Corradini at .