• Login
    View Item 
    •   eScholar Home
    • Faculty of Science
    • Master Theses & Projects
    • View Item
    •   eScholar Home
    • Faculty of Science
    • Master Theses & Projects
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Extending the relational model with constraint satisfaction

    Thumbnail
    View/Open
    Valdron_Michael_J.pdf (704.0Kb)
    Date
    2021-01-01
    Author
    Valdron, Michael J.
    Metadata
    Show full item record
    Abstract
    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.
    URI
    https://hdl.handle.net/10155/1282
    Collections
    • Electronic Theses and Dissertations [1323]
    • Master Theses & Projects [292]

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of eScholarCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV