[ We apologize if you encounter this posting multiple times.

Please note that for authors who are intending to submit that

we would first like an expression of interest. ]

---------------------< PLAINTEXT VERSION >--------------------------

CALL FOR PAPERS

POST-CONFERENCE WORKSHOP ON CONSTRAINTS, DATABASES AND

LOGIC PROGRAMMING

International Logic Programming Symposium

Portland, Oregon, USA

December 8, 1995

Sponsored by the Association for Logic Programming

The notion of constraints -- the relationships among objects and the

limitations they impose on one another -- is a natural framework for

modelling and problem-solving. Thus it is not surprising that

constraint-based problem representations have evolved into generalized

methods of problem-solving, as exemplified in constraint logic

programming (CLP), constraint databases (CDB's), and

constraint-intensive queries (CIQ's).

CLP is a powerful and expressive programming paradigm, combining the

ability to manipulate partial information using constraints, the

elegance of executable specifications inherent in logic programming,

and the incorporation of search heuristics and efficient constraint

solvers in specialized domains. CDB's are useful for storing and

efficiently querying large numbers of constraints representing, for

example, complex modelling requirements as well as spatial and

temp{*filter*}data. CIQ's are important in applications such as decision

support, in which constraints are used to create views on data and to

facilitate query optimization. The purpose of this workshop is to

advance the state of the art in CLP, CDB's and CIQ's, and to discuss

the interplay among these areas.

Topics include (but are not restricted to) the following:

* Applications of CLP, CDB's and CIQ's

* Using constraint languages for modelling and knowledge representation

* Execution strategies for CLP (e.g. abstract machines, memoing

techniques)

* Global optimization/query optimization for CLP, CDB's and CIQ's

* New constraint domains (especially those useful for databases or

knowledge representation)

* Constraint solving algorithms

* Object databases and constraints

* Storing and accessing large constraint sets

* Spatial and temp{*filter*}databases and constraints

* Implementation and evaluation of constraint systems

Authors are invited to submit papers written in English and not

exceeding 15 pages (5000 words) to the contact address listed below.

We encourage authors to submit by electronic mail in self-contained

postscript or LaTeX/TeX format. Alternatively six paper copies may be

submitted. Submissions should contain return mail and email

addresses. We encourage prospective authors to first send an

expression of interest together with a paper title to the organizers.

The DEADLINE for submission of papers is Sept 25, 1995. (Note:

Authors submitting by electronic mail should contact the organizers if

they have not received an electronic acknowledgement within 2-3 days).

Information about the workshop (including this call) and later the workshop

program will be available on the WWW at:

http://www.*-*-*.com/

Organizing Committee

Alex Brodsky, George Mason University, U.S.A.

Jennifer Burg, Wake Forest University, U.S.A.

Alon Y. Levy, AT&T Bell Laboratories, U.S.A.

Divesh Srivastava, AT&T Bell Laboratories, U.S.A.

Peter J. Stuckey, University of Melbourne, Australia

Roland H.C. Yap, University of Melbourne, Australia

Contact Details:

----------------

Jennifer Burg

Dept. of Mathematics and Computer Science

Wake Forest University

Winston-Salem, NC 27109, U.S.A.

Phone: +1 (910) 759-4465

Fax: +1 (910) 759-6133

Important Dates:

----------------

Intention to submit: September 4

Submission deadline: September 25

Notification of authors: October 30

Camera-ready version: November 20

Workshop date: December 8

------------------------------<CUT HERE>----------------------------

%%%%%%%

%%%%%%%{*filter*}Source

%%%%%%%

\documentstyle{article}

\evensidemargin=0cm

\oddsidemargin=-0.8cm

\topmargin=-1.2cm

\headsep=0cm

\textheight=27cm

\textwidth=17.8cm

\columnwidth=\textwidth

\parskip=2pt plus 1pt

\parindent=3.25ex

\begin{document}

\pagestyle{empty}

\sloppy

\begin{center}

CALL FOR PAPERS \\

{\bf POST-CONFERENCE WORKSHOP ON CONSTRAINTS, DATABASES AND LOGIC PROGRAMMING} \\

{\bf International Logic Programming Symposium} \\[1.0ex]

Portland, Oregon, USA \\

December 8, 1995 \\[0.1ex]

Sponsored by the Association for Logic Programming

\vspace{0.1ex}

\end{center}

\noindent

The notion of constraints -- the relationships among objects and

the limitations they

impose on one another --

is a natural framework for modelling and problem-solving.

Thus it is not surprising that constraint-based problem

representations have evolved into generalized methods

of problem-solving, as exemplified in constraint logic programming (CLP),

constraint databases (CDB's), and constraint-intensive queries (CIQ's).

CLP is a powerful and expressive programming paradigm, combining

the ability to manipulate partial information using constraints,

the elegance of executable specifications inherent in logic programming,

and the incorporation of search heuristics and

efficient constraint solvers in specialized domains.

CDB's are useful for storing and

efficiently querying large numbers of constraints representing,

for example, complex modelling requirements as well as spatial

and temp{*filter*}data.

CIQ's are important in applications such as decision support,

in which constraints are used to create views on data and to

facilitate query optimization.

The purpose of this workshop is to advance

the state of the art in CLP, CDB's and CIQ's,

and to discuss the interplay among these areas.

Topics include (but are not restricted to) the following:

\begin{itemize}

\vspace*{-2mm}

\setlength{\parsep}{0pt}

\setlength{\itemsep}{-1mm}

\item Applications of CLP, CDB's and CIQ's

\item Using constraint languages for modelling and knowledge representation

\item Execution strategies for CLP (e.g. abstract machines, memoing

techniques)

\item Global optimization/query optimization for CLP, CDB's and CIQ's

\item New constraint domains (especially those useful for databases or knowledge

representation)

\item Constraint solving algorithms

\item Object databases and constraints

\item Storing and accessing large constraint sets

\item Spatial and temp{*filter*}databases and constraints

\item Implementation and evaluation of constraint systems

\end{itemize}

Authors are invited to submit papers written in English and not exceeding

15 pages (5000 words) to the contact address listed below.

We encourage authors to submit by electronic mail in

{\bf self-contained} Postscript or \LaTeX/\TeX{} format.

Alternatively six paper copies may be submitted.

Submissions should contain return mail and email addresses.

We encourage prospective authors to first send an expression of interest

together with a paper title to the organizers.

\underline{The {\bf DEADLINE} for submission of papers is Sept 25, 1995}.

(Note: Authors submitting by electronic mail should contact the organizers

if they have not received an electronic acknowledgement within 2-3 days).

Information about the workshop (including this call) and later the

workshop program will be available on the WWW at:

{\tt http://www.*-*-*.com/ }

\begin{center}

\underline{Organizing Committee}

\medskip

\begin{minipage}{15cm}

\begin{tabular}{ll}

\end{tabular}

\end{minipage}

\end{center}

\medskip

\hrule

\smallskip

\underline{\bf Contact Details:} & \underline{\bf Important Dates:} \\ \\

Jennifer Burg & Intention to submit: & September 4 \\

Dept. of Mathematics and Computer Science~~ & Submission deadline: & September 25 \\

Wake Forest University & Notification of authors: & October 30 \\

Winston-Salem, NC 27109, U.S.A. & Camera-ready version: & November 20 \\

& Workshop date: & December 8 \\

Phone: +1 (910) 759-4465 \\

Fax: +1 (910) 759-6133

\end{tabular}

\end{document}