Extending the relational model with constraint satisfaction

dc.contributor.advisorPu, Ken
dc.contributor.authorValdron, Michael J.
dc.date.accessioned2021-04-19T20:18:26Z
dc.date.accessioned2022-03-29T17:27:01Z
dc.date.available2021-04-19T20:18:26Z
dc.date.available2022-03-29T17:27:01Z
dc.date.issued2021-01-01
dc.degree.disciplineComputer Science
dc.degree.levelMaster of Science (MSc)
dc.description.abstractWe 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.en
dc.description.sponsorshipUniversity of Ontario Institute of Technologyen
dc.identifier.urihttps://hdl.handle.net/10155/1282
dc.language.isoenen
dc.subjectConstraintsen
dc.subjectDatabasesen
dc.subjectAlgebraen
dc.subjectOptimizationen
dc.subjectSatisfiabilityen
dc.titleExtending the relational model with constraint satisfactionen
dc.typeThesisen
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Ontario Institute of Technology
thesis.degree.nameMaster of Science (MSc)

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Valdron_Michael_J.pdf
Size:
704.03 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.61 KB
Format:
Plain Text
Description: