This National Science Foundation (NSF) Project Grant award under the Computer and Information Science and Engineering (CFDA 47.070) program provides $600,000 in funding to Carnegie Mellon University from August 1, 2024 to July 31, 2027 to develop improved Boolean satisfiability (SAT) solvers through cooperative stochastic local search. The project aims to enhance automated reasoning capabilities by combining complementary local search and complete search algorithms into cooperative frameworks, including sequential and parallel approaches. This research seeks to advance the state-of-the-art in SAT solving, which underpins applications in areas such as verification, planning, and mathematical problem-solving. The award reflects NSF's mission to support transformative research that has the potential for broad scientific and technological impacts.
Generated 1/28/25, 9:43 AM