MATH Seminar

Title: Enabling Relational Databases for Effective CSP Solving
Defense: Dissertation
Speaker: Sebastien Siva of Emory University
Contact: Sebastein Siva, siva@mathcs.emory.edu
Date: 2011-06-06 at 1:00PM
Venue: W304
Download Flyer
Abstract: Constraint satisfaction problems (CSP) are frequently solved over data residing in relational database systems. In such scenarios, the database is typically just used as a data storage back end. However, there exist important advantages, such as the wide availability of database practices and tools for modeling, to having database systems that are capable of natively modeling and solving CSPs. This research introduces general concepts and techniques to extend a database system with constraint processing capabilities. Topics include relational constraint satisfaction problems (RCSP) and their specification in SQL, compiling RCSP into SAT, supporting multiple solving algorithms, and automated problem decomposition.