Abstract
This note summarizes a dissertation that focuses on methods for solving structured real-world problems based on propositional satisfiability (SAT). The work contributes to the analysis and development of both complete search (DPLL and clause learning) and stochastic local search methods for SAT.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.