The problem of propositional satisfiability (SAT) is the classic NP-complete problem. It asks whether a Boolean expression is satisfiable: whether an assignment of Boolean values to its variables exists that makes the expression true. Algorithms for determining satisfiability underpin methods in numerous application domains, including planning, constraint satisfaction, and software and hardware verification. Our work on satisfiability focuses on developing and testing portfolio methods.