|Title||On the Complexity of the Natural Deduction Proof Search Algorithm|
|Authors||Bolotov, A., Shangin, V. and Kozhemiachenko, D.|
We present our first account of the complexity of natural deduction proof search algorithms.
Though we target the complexity for natural deduction for temporal logic, here we only tackle classical case,
comparing the classical part of the proof search for temporal logic with the classical analytical tableau.
|Keywords||natural deduction, tableuax, complexity, proof search|
|Conference||ARW2017 - 24th Automated Reasoning Workshop|
|Publisher||University of Bristol Technical Report|
|Accepted author manuscript|
|Book title||Proceedings of 24th Automated Reasoning Workshop|