Extending the relational model with constraint satisfaction

We propose a new approach to data driven constraint programming. By extending the relational model to handle constraints and variables as first class citizens, we are able to express first order logic SAT problems using an extended SQL which we refer to as SAT/SQL. With SAT/SQL, one can efficiently solve a wide range of practical constraint and optimization problems. SAT/SQL integrates both SAT solver and relational data processing to enable efficient and large scale data driven constraint programming. Furthermore, our research presents two novel meta-programming operators: MINREPAIR and MIN-CONFLICT which are iterative debugging facilities for constraint programming with SAT/SQL.

Name thesis:degree_name

Master of Science (MSc)

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Ontario Institute of Technology

Year dc:date.issued

2021

Author dc:creator

• Valdron, Michael J.

Advisor dc:contributor.advisor

• Pu, Ken

• Constraints
• Databases
• Algebra
• Optimization
• Satisfiability

Language dc:language.iso

en

Handle dc:identifier.uri

https://hdl.handle.net/10155/1282

OAI identifier oai:identifier

oai:ontariotechu.scholaris.ca:10155/1282