\begin{center}
\LARGE
Application of Groebner basis in constraint of
                    non-numerical domains
\end{center}

\begin{center}
\Large
Yosuke Sato

\end{center}

\noindent
Date:  July 19th (Friday)\\
Time:  08:30-08:55\\

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

We discuss Groebner bases in a polynomial ring over a Boolean ring which is a commutative ring
but not an integral domain. We prove they have several nice features such as easily constructed
comprehensive Groebner bases. Using them we can provide constraint solvers over non-numerical
domains of sets. 
