Newsgroups: comp.ai,comp.constraints,comp.lang.prolog,sci.op-research
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!oitnews.harvard.edu!purdue!ames!hookup!news.kei.com!news.mathworks.com!newsfeed.internetmci.com!news.mel.aone.net.au!inferno.mpx.com.au!news.unimelb.EDU.AU!cs.mu.OZ.AU!roland
From: roland@cs.mu.OZ.AU (Roland YAP)
Subject: Final CFP ILPS'95 Workshop: Constraints, Databases, Logic Programming
Message-ID: <9524400.24666@mulga.cs.mu.OZ.AU>
Keywords: constraints, databases, logic programming, workshop, ILPS
Organization: Computer Science, University of Melbourne, Australia
Date: Thu, 31 Aug 1995 14:45:45 GMT
Expires: Sat, 30 Sep 1995 14:00:00 GMT
Lines: 232
Xref: glinda.oz.cs.cmu.edu comp.ai:33079 comp.constraints:810 comp.lang.prolog:13798 sci.op-research:4276


   [ 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
temporal 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 temporal 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.cs.mu.oz.au/ilps95workshops/Welcome.html

                         Organizing Committee
                                   
        Alex Brodsky, George Mason University, U.S.A.   
                brodsky@isse.gmu.edu
        Jennifer Burg, Wake Forest University, U.S.A.    
                burg@mthcsc.wfu.edu
        Alon Y. Levy, AT&T Bell Laboratories, U.S.A.    
                levy@research.att.com
        Divesh Srivastava, AT&T Bell Laboratories, U.S.A.    
                divesh@research.att.com
        Peter J. Stuckey, University of Melbourne, Australia 
                pjs@cs.mu.oz.au
        Roland H.C. Yap, University of Melbourne, Australia  
                roland@cs.mu.oz.au

                           Contact Details:
                           ----------------

                Jennifer Burg 
                Dept. of Mathematics and Computer Science
                Wake Forest University
                Winston-Salem, NC 27109, U.S.A.

                Email: burg@mthcsc.wfu.edu
                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>----------------------------

%%%%%%%
%%%%%%% LaTeX 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 temporal 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 temporal 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.cs.mu.oz.au/ilps95workshops/Welcome.html}


\begin{center}
\underline{Organizing Committee} 

\medskip
\begin{minipage}{15cm}
\begin{tabular}{ll}
Alex Brodsky, George Mason University, U.S.A. &  {\tt brodsky@isse.gmu.edu} \\
Jennifer Burg, Wake Forest University, U.S.A. & {\tt burg@mthcsc.wfu.edu} \\
Alon Y. Levy, AT\&T Bell Laboratories, U.S.A. & {\tt levy@research.att.com} \\
Divesh Srivastava, AT\&T Bell Laboratories, U.S.A. & {\tt divesh@research.att.com} \\
Peter J. Stuckey, University of Melbourne, Australia & {\tt pjs@cs.mu.oz.au} \\
Roland H.C. Yap, University of Melbourne, Australia & {\tt roland@cs.mu.oz.au} \\
\end{tabular}
\end{minipage}
\end{center}

\medskip

\hrule
\smallskip
\begin{tabular}{l|@{\hspace{8mm}}ll}
\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 \\
Email: burg@mthcsc.wfu.edu \\
Phone: +1 (910) 759-4465 \\
Fax: +1 (910) 759-6133 
\end{tabular}

\end{document}

