Anthony Zaleski, Rutgers University

Abstract

Given a logical formula in n Boolean variables, how can we determine whether there is an assignment to the variables that makes it true? This is the task of Boolean satisfiability (SAT), the first problem proved to be NP-complete. Here, we shall talk about our ideas for constructing SAT solvers. Then, we shall discuss some computer-generated results and conjectures regarding generalizations of SAT inspired by integer covering systems. Joint work with Doron Zeilberger.