[Prev][Next][Index][Thread]
CADE-15: Final Call for Workshops and Tutorials
CADE-15
The 15th International Conference on Automated Deduction
July 5-10, 1998, Lindau, Germany
FINAL CALL FOR WORKSHOPS AND TUTORIALS
CADE is the major forum for the presentation of new research in all aspects of
automated deduction. Proposals for workshops and for tutorials are solicited.
Tutorials and workshops will run July 5 and 6. Workshops will ordinarily run
a whole day, and tutorials for half a day. A special symposium Deduction as a
Cross-Sectional Technology will be held on Friday, July 10.
Program Committee: Topics
F. Baader (Aachen) Recent CADE workshops have included term
D. Basin (Freiburg) schematizations and their applications, visual
W. Bibel (Darmstadt) reasoning, automation of proofs by induction,
H. Comon (Cachan) empirical studies in logic algorithms,
G. Dowek (Rocquencourt) mechanization of partial functions, proof search
H. Ganzinger (Saarbr"ucken) in type-theoretic languages, automated model
F. Giunchiglia (Trento) building, evaluation of automated theorem-
S. Grumbach (Rocquencourt) proving systems, strategies in automated
J. Hsiang (Taipei) deduction, automated theorem proving in
D. Kapur (Albany) software engineering, and in mathematics.
C. Kirchner (Nancy) Workshops may have the same topic as those of
H. Kirchner (Nancy) previous workshops, and this practice is
C. Kreitz (Ithaca) encouraged.
C. Lynch (Clarkson)
D. McAllester (Florham Park) Recent CADE tutorials have included equality
M. Okada (Tokyo) reasoning in semantic tableaux, proof systems
L. Paulson (Cambridge) for nonmonotonic logics, rewrite techniques
N. Shankar (Menlo Park) in theorem proving, parallelization of
A.P. Sistla (Chicago) deduction strategies, resolution decision
J. Slaney (Canberra) methods, constructive type theory, the use of
M. Wallace (London, UK) semantics in Herbrand-based proof procedures,
D. Wang (Grenoble) logical frameworks, theorem proving by the
S. Watt (London, Canada) inverse method, deduction methods based on
boolean rings, higher-order equational logic,
and term indexing in automated reasoning.
Tutorials may be introductory, intermediate,
or advanced.
Proposals
Anyone wishing to organize a workshop or
tutorial in conjunction with CADE-15 should
send (e-mail preferred) a proposal no longer
than two pages to the program chairs by
February 15, 1998. The proposal should
describe the topic of the proposed workshop or
tutorial and explain why the topic is
relevant to CADE. Proposals will be evaluated
by the program committee, and decisions will
be made by March 16, 1998. Further
information about the arrangements for
workshops and tutorials can be obtained from
the CADE-15 Web site.
Proposal deadline: February 15, 1998
Notification of acceptance: March 16, 1998
Program Chair: Conference Chair:
Claude and Helene Kirchner Wolfgang Bibel
LORIA, INRIA & CNRS Darmstadt University of Technology
615 Rue du Jardin Botanique, BP 101 Alexanderstr. 10
F-54602 Villers-les-Nancy CEDEX D-64283 Darmstadt
FRANCE GERMANY
Phone: +33 3 83 59 30 11 or 12 Phone: +49 6151 162100
FAX: +33 3 83 27 83 19 FAX: +49 6151 165326
E-mail: cade-15@loria.fr E-mail:cade-15@informatik.tu-darmstadt.de
CADE-15 Web Site - http://www.tu-darmstadt.de/cade-15
===============================================================================
=== LATEX VERSION ===
===============================================================================
\documentstyle{article}
\setlength{\textwidth}{17cm}
\setlength{\textheight}{27cm}
\setlength{\hoffset}{-3cm}
\setlength{\voffset}{-3.7cm}
\begin{document}
\thispagestyle{empty}
\begin{center}
{\Huge\bf CADE-15}
\\[.6cm]
{\LARGE The 15th International Conference on Automated Deduction}\\[.4cm]
{\Large\it July 5-10, 1998, Lindau, Germany}\\[6mm]
{\LARGE\bf FINAL CALL FOR WORKSHOPS AND TUTORIALS}
\end{center}
CADE is the major forum for the presentation of new research in all
aspects of automated deduction. Proposals for workshops
and for tutorials are solicited.
Tutorials and workshops will run July 5 and 6. Workshops will
ordinarily run a whole day, and tutorials for half a day. A special
symposium {\em Deduction as a Cross-Sectional Technology} will be held
on Friday, July 10.
\\[3mm]
\noindent
\begin{minipage}{5.5cm}
{\small
{\bf Program Committee:}\\[1.5mm]
F. Baader (Aachen)\\
D. Basin (Freiburg)\\
W. Bibel (Darmstadt) \\
H. Comon (Cachan)\\
G. Dowek (Rocquencourt)\\
H. Ganzinger (Saarbr\"ucken)\\
F. Giunchiglia (Trento)\\
S. Grumbach (Rocquencourt)\\
J. Hsiang (Taipei)\\
D. Kapur (Albany)\\
C. Kirchner (Nancy)\\
H. Kirchner (Nancy)\\
C. Kreitz (Ithaca) \\
C. Lynch (Clarkson)\\
D. McAllester (Florham Park)\\
M. Okada (Tokyo)\\
L. Paulson (Cambridge)\\
N. Shankar (Menlo Park)\\
A.P. Sistla (Chicago)\\
J. Slaney (Canberra)\\
M. Wallace (London, UK)\\
D. Wang (Grenoble)\\
S. Watt (London, Canada)\\[4mm]
}
%\framebox{
\begin{minipage}{4.5cm}
\begin{tabbing}
xxxxxxxxxx \= \kill
{\bf Proposal deadline:}\\
\> February 15, 1998\\
{\bf Notification of acceptance:}\\
\> March 16, 1998
\end{tabbing}
\end{minipage}
%}
\end{minipage}
\begin{minipage}{11.5cm}
\medskip
\begin{center}
{\bf Topics}
\end{center}
Recent CADE workshops have included term schematizations and their
applications, visual reasoning, automation of proofs by induction,
empirical studies in logic algorithms, mechanization of partial
functions, proof search in type-theoretic languages, automated model
building, evaluation of automated theorem-proving systems, strategies
in automated deduction, automated theorem proving in software
engineering, and in mathematics. Workshops may have the same topic as
those of previous workshops, and this practice is encouraged.
\medskip Recent CADE tutorials have included equality reasoning in
semantic tableaux, proof systems for nonmonotonic logics, rewrite
techniques in theorem proving, parallelization of deduction
strategies, resolution decision methods, constructive type theory, the
use of semantics in Herbrand-based proof procedures, logical
frameworks, theorem proving by the inverse method, deduction methods
based on boolean rings, higher-order equational logic, and term
indexing in automated reasoning. Tutorials may be introductory,
intermediate, or advanced.
\medskip
\begin{center}
{\bf Proposals}
\end{center}
Anyone wishing to organize a workshop or tutorial in conjunction with
CADE-15 should send (e-mail preferred) a proposal no longer than two
pages to the program chairs by February 15, 1998. The proposal should
describe the topic of the proposed workshop or tutorial and explain
why the topic is relevant to CADE. Proposals will be evaluated by the
program committee, and decisions will be made by March 16, 1998.
Further information about the arrangements for workshops and tutorials
can be obtained from the CADE-15 Web site.
\end{minipage}
\vspace{.3cm}
\begin{center}
\begin{minipage}[t]{7cm}
{\bf Program Chair:}\\[.2cm]
Claude and H\'el\`ene Kirchner\\
LORIA, INRIA \& CNRS \\
615 Rue du Jardin Botanique, BP 101\\
F-54602 Villers-les-Nancy CEDEX\\
FRANCE
\begin{tabbing}
00000000\=\kill
Phone: \> +33 3 83 59 30 11 or 12\\
FAX: \> +33 3 83 27 83 19\\
E-mail: \> cade-15@loria.fr
\end{tabbing}
\end{minipage}
\begin{minipage}[t]{7cm}
{\bf Conference Chair:}\\[.2cm]
Wolfgang Bibel \\
Darmstadt University of Technology\\
Alexanderstr.\ 10\\
D-64283 Darmstadt \\
GERMANY
\begin{tabbing}
00000000\=\kill
Phone: \> +49 6151 162100\\
FAX: \> +49 6151 165326\\
E-mail: \> cade-15@informatik.tu-darmstadt.de
\end{tabbing}
\end{minipage}
\vspace{.5cm}
\fbox{\bf CADE-15 Web Site --- \tt http://www.tu-darmstadt.de/cade-15}
\end{center}
\end{document}