Delivery-Date: 
Sender: info-hol-request@lal.cs.byu.edu
Errors-To: info-hol-request@lal.cs.byu.edu
Precedence: list
Message-Id: <m0sufRG-004ELoC@lutece.research.att.com>
Date: Mon, 18 Sep 95 08:36 EDT
From: Amy Felty <felty@research.att.com>
To: info-hol@leopard.cs.byu.edu
Subject: CADE-13 Call for Tutorials (text & LaTeX)


[Our apologies for multiple copies.]


    The Thirteenth International Conference on Automated Deduction
    --------------------------------------------------------------

                      Rutgers University
		New Brunswick, New Jersey, USA 

                 CADE-13:  Call for Tutorials

                    Tuesday, 30 July, 1996


The CADE conferences are the major forum for the presentation of new
research in all aspects of automated deduction.  It is proposed to hold
a number of tutorials in conjunction with CADE-13. All tutorials will
be held in parallel on Tuesday, 30 July, 1996. All workshops will be
held on the same day.

          +------------------------------------------------------+
          | 				       			 |
          | Deadline for Tutorial Proposals: 1 December, 1995    |
          | 				       			 |
          +------------------------------------------------------+

CADE conferences cover all aspects of automated deduction:

   First vs. Higher Order Logics            Classical vs. Non-Classical Logics
   Special vs. General Purpose Inference    Interactive vs. Automatic Systems

 Specific topics of interest include (but are not limited to):

   Resolution        Sequent Calculus          Decision Procedures
   Unification       Rewrite Rules             Mathematical Induction

and any applications of automated deduction, including:

   Deductive Databases                 Logic and Functional Programming
   Commonsense Reasoning               Software and Hardware Development
   Distributed Theorem Proving	       Learning Search Heuristics	

The CADE-13 conference itself will be held from Wednesday, 31 July, to
Saturday, 3 August, 1996.  It will be held as part of the Federated
Logic Conference (FLoC'96) to be hosted by the Center for Discrete
Mathematics and Computer Science (DIMACS) at Rutgers University, New
Brunswick, New Jersey, USA, from Saturday, 27 July, to Saturday, 3
August, 1996. As well as CADE, other conferences participating in
FLoC'96 will be CAV, (Conference on Computer-Aided Verification), LICS
(IEEE Symposium on Logic in Computer Science), and RTA (Conference on
Rewriting Techniques and Applications).  The goal of FLoC is to battle
fragmentation of the technical community by bringing together
synergetic conferences that relate logic to computer science.

Anyone wishing to offer a tutorial in conjunction with CADE-13 should
send a proposal no longer than two pages in length to the Program
Co-Chairs by 1 December, 1995.  This proposal should describe the topic
of the proposed tutorial; explain why this topic is relevant to CADE;
name the speakers and specify the tutorial's length. The default length
is two hours.  Further information about the arrangements for tutorials,
can be obtained from the Local Arrangements Chair or from the CADE-13
world wide web site: http://www.research.att.com/lics/FLoC/cade13.

Note that it is unlikely that more than the equivalant of 12 two hour
tutorials will be chosen.  The maximum number of tutorials running in
parallel is unlikely to exceed six.

    Program Co-Chairs                     Local Arrangements Chair

    Michael McRobbie & John Slaney        Amy Felty        
    Centre for Information                AT&T Bell Laboratories
        Science Research                  Room 2A-425
    The Australian National University    600 Mountain Avenue 
    ACT 0200                              Murray Hill NJ 07974
    Australia                             United States of America
                                     
    Tel: [+61] 6-249-2035                 Tel: [+1] 908-582-4049
    Fax: [+61] 6-249-0747                 Fax: [+1] 908-582-7550
    Email: cade13@cisr.anu.edu.au         Email: cade13-la@cisr.anu.edu.au


+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
TEX Version
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


% For LaTeX2e use
\documentclass[a4paper]{article}
% if you have LaTeX2e and if you have "winning-logo.epsi" then 
% uncomment the following line.
%\usepackage{graphicx}
% else, for LaTeX 2.09 comment out the two lines above and uncomment:
% \documentstyle{article}
% Furthermore, if you do not have the file "winning-logo.epsi", 
% and if you do not have LaTeX2e comment out a line in the text 
% below, which contains "\includegraphics".

\addtolength{\topmargin}{-2cm}
% for LateX2e use the line below
\addtolength{\textheight}{3cm}
% for LaTeX 2.09, comment out the line above and uncomment:
% \addtolength{\textheight}{5cm}
\addtolength{\textwidth}{4.2cm}
\addtolength{\oddsidemargin}{-2cm}

\font\logofont=cmbsy10 scaled 3000
\font\logofontt=cmtt10 scaled 3000

\def\cadeC{{\logofont\char'032}}
\def\cadeA{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char'070}}}
\def\cadeD{{\logofont\char'033}}
\def\cadeE{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char'071}}}
\def\cadeArrow{{\logofont\char'041}}
\def\cadetwlv{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 12}}}
\def\cadethrt{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 13}}}

%\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadetwlv}
\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadethrt}

\pagestyle{empty}

\begin{document}

% comment out the following "\includegraphics" line, if you do not
% have LaTeX2e and if you do not have the file "winning-logo.epsi".
%\noindent
%{\hskip-1.5cm{\vskip-2cm\hskip-1.5cm\includegraphics[scale=0.2]{winning-logo.epsi}}}

\begin{center}
{\Large\bf Thirteenth International Conference on Automated Deduction}
\end{center}
\begin{center}
{\Large\bf Rutgers University, New Brunswick, USA}
\end{center}
\begin{center}
{\Large\bf 30 July, 1996}
\end{center}
\vskip0.5cm
\begin{center}
{\cadelogo}
\end{center}
\vskip0.5cm
\begin{center}
{\huge\bf CALL FOR TUTORIALS}
\end{center}
\vskip1cm

\noindent 
The CADE conferences are the major forum for the presentation of new
research in all aspects of automated deduction.  It is proposed to hold
a number of tutorials in conjunction with CADE-13.  All tutorials will
be held in parallel on Tuesday, 30 July, 1996.  All workshops will be
held on the same day.

\vskip0.5cm
\begin{center}
\framebox{\begin{tabular}{l}
Deadline for Tutorial Proposals: 1 December, 1995
\end{tabular}}
\end{center}

\vskip0.5cm
CADE conferences cover all aspects of automated deduction:
\begin{center}
\begin{tabular}{ll}
First {\em vs.}\ Higher Order Logics &
Classical {\em vs.}\  Non-Classical Logics \\
Special {\em vs.}\  General Purpose Inference &
Interactive {\em vs.}\ Automatic Systems \\
\end{tabular}
\end{center}

Specific topics of interest include (but are not limited to):
\begin{center}
\begin{tabular}{lll}
Resolution & Sequent Calculus & Decision Procedures \\
Unification & Rewrite Rules & Mathematical Induction \\
\end{tabular}
\end{center}

and any applications of automated deduction, including:
\begin{center}
\begin{tabular}{ll}
Deductive Databases & Logic and Functional Programming \\
Commonsense Reasoning & Software and Hardware Development \\ 
Distributed Theorem Proving & Learning Search Heuristics \\ 
\end{tabular}
\end{center}

The CADE-13 conference itself will be held from Wednesday, 31 July, to
Saturday, 3 August, 1996.  It will be held as part of the Federated
Logic Conference (FLoC'96) to be hosted by the Center for Discrete
Mathematics and Computer Science (DIMACS) at Rutgers University, New
Brunswick, New Jersey, USA, from Saturday, 27 July, to Saturday, 3
August, 1996.  As well as CADE, other conferences participating in
FLoC'96 will be CAV, (Conference on Computer-Aided Verification), LICS
(IEEE Symposium on Logic in Computer Science), and RTA (Conference on
Rewriting Techniques and Applications).  The goal of FLoC is to battle
fragmentation of the technical community by bringing together
synergetic conferences that relate logic to computer science.

Anyone wishing to offer a tutorial in conjunction with CADE-13 should
send a proposal no longer than two pages in length by post to the 
Program Co-Chairs by 1 December, 1995.  This proposal should describe
the topic of the proposed tutorial; explain why this topic is relevant
to CADE; name the speakers and specify the tutorial's length.  The 
default length is two hours. Further information about the arrangements
for tutorials, can be obtained from the Local Arrangements Chair or
from the CADE-13 world wide web site: 
http://www.research.att.com/lics/FLoC/cade13.

Note that it is unlikely that more than the equivalant of 12 two hour
tutorials will be chosen.  The maximum number of tutorials running in
parallel is unlikely to exceed six.

\vskip1.5cm
\raggedleft ../2 
\begin{center}
\begin{tabular}{l@{\hspace{2em}}l}
\begin{tabular}[t]{l}
{\bf Program Co-Chairs\/}\\[1ex]
Michael McRobbie and John Slaney \\
Centre for Information Science Research \\
The Australian National University\\
ACT  0200 \\
Australia
\end{tabular}
&
\begin{tabular}[t]{l}
{\bf Local Arrangements Chair\/}\\[1ex]
Amy Felty\\
AT\&T Bell Laboratories \\
Room 2A-425 \\
600 Mountain Avenue \\
Murray Hill  NJ  07974  \\
United States of America \\

\end{tabular}\\
\hbox{}\\
\begin{tabular}[t]{l}
 Tel: [+61] 6-249-2035 \\
 Fax: [+61] 6-249-0747 \\
 Email: {\tt cade13}{\rm @}{\tt cisr.anu.edu.au}% 
\end{tabular}
&
\begin{tabular}[t]{l}
 Tel: [+1 ] 908-5824049 \\
 Fax: [+1 ] 908-5827550 \\
 Email: {\tt cade13-la}{\rm @}{\tt cisr.anu.edu.au}
\end{tabular}
\end{tabular}
\end{center}

\vskip0.5cm
\begin{center}
{\bf Program Committee\/}
\end{center}

\begin{center}
\begin{tabular}{lll}
O.~Astrachan (Duke)& J.~Avenhaus (Kaiserslautern)& L.~Bachmair (Stonybrook)\\
D.~Basin (Max-Planck)& W.~Bibel (Darmstadt)& B.~Buchberger (Linz)\\
F.~Bry (Munich)& R.~Caferra (Grenoble)& K.~S.~Choi (KAIST)\\
A.~Cohn (Leeds)& L.~Farinas del Cerro (Toulouse)& W.~Farmer (MITRE)\\
A.~Felty (AT\&T Bell Labs)& M.~Fitting (CUNY)& M.~Fujita (MRI)\\
S.~Garland (MIT)& F.~Giunchiglia (IRST)& E.~Gunter (AT\&T Bell Labs)\\
R.~Hasegawa (Kyushu)& L.~Henschen (North Western)& L.~Hines (Texas)\\
S.~H\"olldobler (Dresden)& M.~Kaufmann (Motorola)& A.~Leitsch (Vienna)\\
E.~Lusk (Argonne)& U.~Martin (St.~Andrews)& D.~McAllester (MIT)\\
W.~McCune (Argonne)& H.-J.~Ohlbach (Max-Planck)& J.~Posegga (Karlsruhe)\\
W.~Pase (Ottawa)& F.~Pfenning (Carnegie Mellon)& F.~Pirri (Rome)\\
D.~Plaisted (North Carolina)& U.~Reddy (Illinois)& M.~Rusinowitch (INRIA)\\
K.~Satoh (Hokkaido)& J.~Schumann (Munich)&  C.~Schwind (Marseille)\\
N.~Shankar (SRI)& J.~Siekmann (Saarbr\"ucken)& A.~Smaill~(Edinburgh)\\
G.~Smolka~(Saarbr\"ucken)& M.~Stickel~(SRI)& G.~Sutcliffe (James Cook)\\
E.~Tiden (Siemens)& A.~Voronkov (Uppsala)& L.~Wallen (Oxford)\\
D.~Wang (Grenoble)& H.~Zhang (Iowa)& \\
\end{tabular}
\end{center}
\end{document}