As the conclusion to this series, this is a draft for an epilogue that reflects on what the Cook-Levin theorem achieved, while connecting it to the P vs NP problem itself and the current state of ...

Cathedral is decentralized formal verification: compute whose answers can be checked deterministically and rewarded through an open miner market. The substrate is Boolean satisfiability, the canonical ...

Abstract: Boolean satisfiability (SAT), a non-deterministic polynomial (NP)-complete problem, has gained increasing attention with applications in artificial intelligence, machine learning, electronic ...

The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the premier annual meeting for researchers focusing on the theory and applications of the propositional ...

The rise of AI, graphic processing, combinatorial optimization and other data-intensive applications has resulted in data-processing bottlenecks, as ever greater amounts of data must be shuttled back ...

Abstract: Techniques to solve the Boolean Satisfiability problem (SAT) lend themselves to various applications in computer-aided design, circuit design, automated reasoning, formal verification, etc.

I moved to Carnegie Mellon University. This page is no longer maintained. Visit the link above for the new webpage. My current research focusses on two major challenges for SAT solving: 1) exploiting ...