\begin{center}
\LARGE
Determining the Relationship Among Sets

\end{center}

\begin{center}
\Large
Hoon Hong, Stefan Ratschan

\end{center}

\noindent
Date:  July 19th (Friday)\\
Time:  11:10-11:35\\

\begin{center}
\large
Abstract
\end{center}

Checking the entailment/disentailment of sets is an important operation in constraint
programming. We will generalize this problem to the problem of answering queries about sets
using a certain query language. Furthermore we will present an efficient algorithm solving this
problem for arbitrary non-linear polynomials. 

