[C2] _________________________ AMAST Links 02 03

Annual Conf. European Association for Computer Science Logic, CSL'95

Paderborn, Germany, September 22-29, 1995

The LaTeX full version of this Call for Papers is available.

CSL '95 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 in areas related to computer science. The scientific program consists of a tutorial on Finite Model Theory organized by H.-D. Ebbinghaus (Freiburg) with lectures by J. Flum (Freiburg) and E. Grädel (Aachen), during Sept 22. - 24, and of invited lectures and contributed papers, Sept. 25 - 29. The conference will be immediately preceded by the workshop on Higher-Order Algebra, Logic and Term Rewriting, HOA '95 which is announced separately.

Submissions: Authors are invited to submit five copies of a draft of a full paper (5-12 pages) and twelve copies of a two page abstract to the chairman of the program committee. The cover page should include title, authors, and corresponding author: name, address, phone number, email address, and fax number (when available).

The deadline for submissions is May 1st, 1995. The authors will be notified of acceptance for presentation at the conference by July 15th.

The preliminary version of the full paper to be submitted to the Proceedings volume (LNCS Springer Verlag) should be available at the conference. Authors will be notified of the acceptance of their paper by January 15th, 1996.

Grants: For young scientists living at least one year in EU-countries some grants are available from the HCM Euroconferences program of the EU. For more information please contact the Chair:

Prof. Dr. Hans Kleine Büning (CSL '95),
FB 17 Mathematik--Informatik
Universität-GH Paderborn, 33095 Paderborn, Germany
E-mail: csl95@uni-paderborn.de, Fax: +49 5251 60 3338

The final application should be sent not later then May 1st, 1995.

See also the CSL'95 WWW page.