Structure-Based Satisfiability Checking: Analyzing and Harnessing the Potential

Reference:

Matti Järvisalo. Structure-based satisfiability checking: Analyzing and harnessing the potential. AI Communications, 22(2):117–119, 2009. Thesis summary.

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

Suggested BibTeX entry:

@article{Jarvisalo:AICom09,
    author = {Matti J\"arvisalo},
    journal = {AI Communications},
    note = {Thesis summary},
    number = {2},
    pages = {117--119},
    title = {Structure-Based Satisfiability Checking: Analyzing and Harnessing the Potential},
    volume = {22},
    year = {2009},
}