Home
About
A Brief History of AI
AI-Alerts
AI Magazine
AAAI Conferences
NeurIPS
Books
Classics
How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization
Open in new window
aitopics.org uses cookies to deliver the best possible experience. By continuing to use this site, you consent to the use of cookies.
Learn more ยป
I understand
Add feedback
Send feedback to help us improve this new enhanced search experience.
Select feedback type:
General
Views
Title
Summary
Body
Concept Tags
Oilfield Places
Thank You!