Speaker
Albert Atserias, Universitat Politècnica de Catalunya
Title
Complexity of Proof Search
Abstract
I will survey the area of the algorithmic complexity of proof search for propositional logic, also known as automatability.
Department of Computer Science and Technology
Complexity of Proof Search
I will survey the area of the algorithmic complexity of proof search for propositional logic, also known as automatability.