On the Automatability of Tree-Like k-DNF Resolution

Explore the automatability of tree-like k-DNF resolution in this 26-minute conference talk by Susanna de Rezende from Lund University, presented as joint work with Gaia Carenini at the Fields Institute. Delve into the theoretical foundations and computational aspects of this proof system, examining how automated theorem proving techniques can be applied to tree-like k-DNF resolution. Learn about the challenges and possibilities in automating this particular resolution method, gaining insights into the intersection of proof complexity theory and automated reasoning. Discover the latest research developments in understanding the computational limits and capabilities of tree-like k-DNF resolution systems, and their implications for broader questions in computational complexity and logic.