Affiliations: Department Information and Computer Science, Helsinki University of Technology (TKK), Finland
Note: [] Address for corresponcence: Matti Järvisalo, Department of Information and Computer Science, Helsinki University of Technology (TKK), P.O. Box 5400, FI-02015 TKK, Finland. E-mail: [email protected].
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.
Keywords: Propositional satisfiability, SAT, clause learning, DPLL, stochastic local search, heuristics, proof complexity, problem structure, backdoors, answer set programming
