The International Conferences on Theory and Applications of Satisfiability Testing are the primary annual meetings for researchers studying the propositional satisfiability problem (SAT), a prominent problem in both theoretical and applied computer science. SAT lies at the heart of the most important open problem in complexity theory (P vs NP) and underlies many applications in, among other examples, artificial intelligence, operations research, and electronic design engineering. The primary objective of th
SAT + SMT