\documentclass[11pt]{article}
\usepackage[letterpaper, left=1in, top=1in, bottom=1in, right=1in]{geometry}
\usepackage{verbatim}
\setlength{\parindent}{0in}
\pagestyle{empty}
\begin{document}
\vspace{\fill}
\begin{center}\LARGE
\textsc{Master's Thesis}
\par
\textsc{Defense}
\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textit{An Investigation into Managing SQL-Cardinality Constraints}
\end{center}
\vspace{\fill}
\begin{center}\Large
Lesi Wang\par
Emory University
\end{center}
\vspace{\fill}
\textbf{Abstract:} Constraint Satisfaction Problems (CSP) are commonly found in practice and finding effective representation language and efficient constraint solving techniques are important research areas. A recent development is the integration of CSP (specifically SAT) solvers with relational database systems to enable CSPs to be modelled using SQL, and solved within the database system.  A key challenge in this integration is to keep the SAT encoding of SQL constraints small.  In this work, we describe a divide-and- conquer technique for reducing the encoding of cardinality constraints.  We present a number of experiments to show the improvements on performance.\vspace{\fill}
\begin{center}\Large
Monday, November 17, 2008, 2:00 pm\par
Mathematics and Science Center: E408
\end{center}
\vspace{\fill}
\begin{center}\Large
Advisor: Dr. James Lu
\end{center}
\vspace{\fill}
\begin{center}\LARGE
\textsc{Mathematics and Computer Science}\par
\textsc{Emory University}
\end{center}
\end{document}