{"id":"2411.07955","title":"How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization","url":"https://codeofpaper.com/paper/2411.07955","arxiv_url":"https://arxiv.org/abs/2411.07955","published":"2024-11-12","code":"none","best":null,"most_starred_community":null,"implementations":[],"possible_matches":0}