pdk@uklirb.informatik.uni-kl.de (workshop organizers) (09/28/90)
\documentstyle[11pt]{article}
\addtolength{\evensidemargin}{-1.8cm}
\addtolength{\oddsidemargin}{-1.8cm}
\addtolength{\textwidth}{3.6cm}
\addtolength{\topmargin}{-2.5cm}
\addtolength{\textheight}{7.5cm}
\unitlength1.0cm
\setlength{\parindent}{0.0cm}
\renewcommand{\baselinestretch}{0.9}
\begin{document}
\thispagestyle{empty}
\vspace*{1cm}
\begin{center}
{\Huge\bf PDK '91}
\\
\vspace{1cm}
{\large CALL FOR PAPERS}
\\
\vspace{1cm}
{\Large\bf International Workshop}
\\
\vspace{0.6cm}
{\large\bf on}
\\
\vspace{0.6cm}
{\huge\bf Processing Declarative Knowledge}
\\
\vspace{0.6cm}
{\Large\bf --- Representation and Implementation Methods ---}
\\
\vspace{1.2cm}
{\bf July 1-3, 1991 Kaiserslautern, Germany}
\vspace{1.2cm}
\end{center}
\setlength{\parindent}{0cm}
{\bf Background:} \\
\setlength{\parindent}{1.0cm}
Declarative representation formalisms have long constituted the
kernels of AI languages. Their high description level facilitates
readability, maintenance, and parallelization of knowledge
bases; their orientation toward logic enables clear semantics.
This becomes especially important when several formalisms are
used in a `hybrid' fashion, as the amalgamation of
sublanguages is simplified.
However, the processing of large declarative knowledge bases is
becoming efficient only with the use of modern implementation
techniques. For instance, the increased gap to von~Neumann
machines may be
bridged by (global) static analysis and (multi-stage)
transformation/compilation of the representation formalisms.
Experimental methods for most representation and implementation
layers exist, which should gradually enter practical AI, e.g. via
expert-system shells.
\\[0.2cm]
\setlength{\parindent}{0cm}
{\bf Scope:} \\
\setlength{\parindent}{1.0cm}
This workshop will provide an opportunity to present promising
approaches for processing declarative knowledge, to
demonstrate implemented systems, and to meet with AI
practitioners. Also welcome are well-founded critiques of
declarative-knowledge processing (e.g. from procedural,
object-oriented, or connectionist points of view).
Besides representation formalisms on the basis of horn-logic
programming it is possible to present, among others: more general
{\it inference rules} (backward/forward chaining),
{\it concept-description languages} (subsumption procedures), as well as
{\it constraint} or {\it constraint-logic-program\-ming systems}
(propagation algorithms).
Regarding implementation, all recent interpretation
and especially compilation techniques will be of interest, e.g.:
{\it abstract interpretation}, {\it partial evaluation},
{\it rule compilation}, and {\it WAM technology}.
\newpage
\thispagestyle{empty}
\setlength{\parindent}{0cm}
{\bf Paper Submission:} \\
\setlength{\parindent}{1.0cm}
Please submit {\bf four (4) copies} of papers written in English by
{\bf 1 March 1991} (not via email). If electronic mail is available,
additionally email an ASCII version of the abstract.
Refereeing will take place in two categories: {\bf Long papers} of
max. 20 pages for full-blown research results, {\bf short papers}
of up to\ 6 pages for concise presentations and partial results.
In both categories we expect original work.
Authors will be {\bf notified of acceptance or rejection} of submitted
papers by {\bf 30 April 1991}, the {\bf camera-ready revisions}
are due by {\bf 10 June 1991}. {\bf Applications for
system presentations} consisting of a system mini-description of
1-3 pages as well as a specification of the hardware/software
required should arrive by {\bf 3 June 1991}.
Please direct contributions and requests to the following address:
\begin{tabbing}
\hspace{3cm}\=
{\bf \+PDK}\\
{\bf DFKI GmbH}\\
{\bf P.~O.~Box 2080}\\
{\bf 6750 Kaiserslautern, F.~R.~Germany}
\\[0.15cm]
FAX: +49-631-205-3210
\\
email: pdk@informatik.uni-kl.de
\end{tabbing}
Preprints of refereed papers will be produced for the workshop, and a proceedings publication is scheduled immediately afterwards.
\\[0.2cm]
\setlength{\parindent}{0cm}
{\bf Associated Societies:} \\
\setlength{\parindent}{1.0cm}
The workshop is organized by the German Research Center for Artificial Intelligence (DFKI) in cooperation with the Association for Logic Programming (ALP) and the Gesellschaft fr Informatik e.V. (GI).
\\[0.2cm]
\setlength{\parindent}{0cm}
{\bf Important Dates:}
\begin{tabbing}
\hspace*{1cm}\=30 April 1991: \hspace{0.5cm}\= \kill
\> 1 March 1991: \> Deadline for submission of papers \\
\> 30 April 1991: \> Notification of acceptance or rejection \\
\> 3 June 1991: \> Deadline for application of system demonstrations\\
\> 10 June 1991: \> Camera-ready paper\\
\> 1-3 July 1991: \> Workshop\\
\end{tabbing}
{\bf Program Committee:}
\\
{\small
\begin{tabbing}
Maurice Bruynooghe, Kath. Universiteit Leuven \hspace{0.5cm}\= \kill
Hassan A\"{\i}t-Kaci, DEC Paris \> Alexander Herold, ECRC Munich \\
H.-J. Appelrath, University of Oldenburg \> Robert Kowalski, Imperial College London \\
Woody Bledsoe, University of Texas at Austin \> Hans Langmaack, University of Kiel \\
Egon B{\"o}rger, University of Pisa \> Jean-Louis Lassez, IBM Yorktown Heights/NY \\
Harold Boley, DFKI Kaiserslautern \> Michael M. Richter, DFKI Kaiserslautern (Chair) \\
Maurice Bruynooghe, Kath. Universiteit Leuven \> Erik Sandewall, Univerity of Link{\"o}ping \\
Tim Finin, Unisys Paoli \> John Taylor, Hewlett Packard Bristol \\
Herv{\'e} Gallaire, Bull Paris \> A. Voronkov, Int. Lab. of Intelligent Syst. Novosibirsk \\
Jan Grabowski, Humboldt University Berlin
\end{tabbing}}
\end{document}