From: voronkov@loria.fr (Voronkov Andrei)
Newsgroups: comp.lang.prolog,comp.lang.functional
Subject: LPAR93 CFP (LaTeX)
Date: 23 Jan 93 21:56:40 GMT
Followup-To: comp.lang.prolog
Organization: CRIN (CNRS) Nancy - INRIA Lorraine

\documentstyle[11pt]{article}

\topmargin -1.5cm

\oddsidemargin +0.1cm 
\textheight 25.5cm
\textwidth 16.5cm
\setlength{\parindent}{0cm}

\setlength{\parskip}{1.8ex}

\begin{document}

\framebox[1.2cm][c]{\hspace{1.6mm}\Huge "\hspace{-1mm}("}\hspace{.5cm}
\begin{minipage}[c]{14.4cm}
\begin{center}
{\Large\bf LPAR'93 -- 4th International Conference on\vspace{2mm}\\
		 Logic Programming and Automated Reasoning}
\end{center}
\end{minipage}

\begin{center}
{Call for Papers}\\ \ \\
	{\large St.Petersburg, Ship ``Michail Lomonosov'' \\
	July 13-20, 1993}
\end{center}

LPAR'93 is an international conference traditionally held in Russia since
1990. It aims at bringing together researchers interested in logic programming
and automated reasoning. LPAR'93 is also an excellent opportunity to 
become better acquainted with research in Russia and other countries of
the former Soviet Union.

{\bf Invited speakers:}
\begin{tabbing}
Q\=QQ\=\kill
	\> Alan Bundy (Edinburgh University, UK)\\
	\>	\> \em (Title to be announced)\\
	\> Herve Gallaire (Xerox, France)\\
	\>	\> \em Research in Logic Programming
			and Deductive Databases: The Impact on Industry\\
	\> Ryuzo Hasegawa (ICOT, Japan)\\
	\>	\> \em Model Generation Theorem Provers on PIM\\
	\> Peter Wegner (Brown University, USA)\\
	\>	\> \em Reasoning Versus Modeling in Computer Science\\
	\> Nail Zamov (Kazan University, Russia)\\
	\>	\> \em Theorem proving in Kazan'
\end{tabbing}

{\bf Tutorials:}
\begin{tabbing}
Q\=QQ\=\kill
	\> Jean-Marc Andreoli, Remo Paresci (ECRC): \\
	\>	\> \em Linear Logic Programming \\
	\> Evan Tick (University of Oregon): \\
	\>	\> \em An Advanced Tutorial in Concurrent Logic Programming:
Paradigms and Implementation\\
	\> Leo Bachmair (SUNY at Stony Brook), Harald Ganzinger(Max Plank
		Institut f\"ur Informatik)\\
	\>	\> \em Paramodulation-based Theorem Proving for First-Order 
		Logic with Equality
\end{tabbing}

{\bf Program Committee:}
\begin{tabbing}
Q\=	Dmitri Boulanger (Belgium/Russia)MMM \= \kill
\>	Dmitri Boulanger (Belgium/Russia)
\>	Mats Carlsson (Sweden)\\
\>	Philippe Codognet (France)
\>	Danny De Schreye (Belgium)\\
\>	Norbert Eisinger (Germany)
\>	Harald Ganzinger (Germany)\\
\>	Ryuzo Hasegawa (Japan)
\>	Steffen H{\"o}lldobler (Germany)\\
\>	Deepak Kapur (USA)
\>	Jean-Louis  Lassez (USA) \\
\>	Alexander Leitsch (Austria)
\>	Giorgio Levi (Italy)\\
\>	John Lloyd (UK)
\>	Ewing Lusk (USA)\\
\>	Dale Miller (USA)
\>	Jack Minker (USA)\\
\>	Gregory Mints (USA/Estonia)
\>	Alan Mycroft (UK)\\
\>	Lee Naish (Australia)
\>	Hans-Jurgen Ohlbach (Germany)\\
\>	Michel Parigot (France)
\>	Frank Pfenning (USA)\\
\>	Vladimir Sazonov (Russia)
\>	Marek Sergot (UK)\\
\>	Mark Stickel (USA)
\>	Pascal Van Hentenryck (USA)\\
\>	Konstantin Vershinin (Ukraine)
\>	Andrei Voronkov (Russia) - chair\\
\>	Nail Zamov (Russia)
\end{tabbing}

\newpage

{\bf Organizing Committee:}
\begin{tabbing}
Q\=\kill
\>	Eugene Dantsin (Russia) \\
\>	Robert Freidson (Russia/USA) - chair\\
\>	Andrei Voronkov (Russia) 
\end{tabbing}

{\bf Topics of interest} include, but are not restricted to:
\begin{tabbing}
Q\=Formal methods in software and hardwareQQ\=\+\kill
Constraints \>
Deductive databases \\
Formal methods in software and hardware \>
Implementation techniques \\
Inductive theorem proving \>
Logical Frameworks \\
LPAR in artificial intelligence \>
Meta-programming \\
Parallelism and concurrency \>
Program synthesis and verification \\
Programming in constructive logic \>
Theorem proving \\
Theory and foundations \>
Unification theory and rewriting
\end{tabbing}

Authors are invited to submit 5 copies of their manuscripts to the address:
\begin{center}
Andrei Voronkov -- LPAR'93\\
CRIN-CNRS \& INRIA Lorraine\\ 
Batiment Loria, BP 239     \\
54506 Vandoeuvre-les-Nancy Cedex\\
France
\end{center}

For countries where copying may be a problem one copy will be sufficient.
Email \TeX/\LaTeX\ submissions are acceptable from the countries with postal problems. Proceedings will be published in the series ``Lecture Notes in 
Artificial Intelligence'' by Springer Verlag. (Proceedings of the 
previous conferences were published in LNAI vv.592 and 624).

There are three kinds of submissions: {\em long papers\/} (up to 12 pages), 
{\em short papers\/} (up to 6 pages), or {\em system descriptions\/} (up to 3 
pages). All papers must be written in English. 
Submissions should be accompanied by a one-page abstract sent either
to the same address or (preferably) by email to voronkov@loria.fr. The abstract should include
author's name(s), affiliation, postal and email addresses.  

The program will also include a special session on system demonstrations (IBM PCs
and SPARCstations) and several tutorials delivered by major researchers in
the field.

{\bf Important dates:}
\begin{tabbing}
Q\=Final Version:\ \=\+\kill
	Submission:    \>	February 1\\
	Notification:  \>	March 20\\
	Final Version: \>	April 20
\end{tabbing}

Further information may be obtained at the email address voronkov@loria.fr.

\end{document}