Beyersdorff, O and Mueller, S (2010) Different Approaches to Proof Systems. In: Kratochvil, J, Li, A, Fiala, J and Kolman, P, (eds.) Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Proceedings. 7th Annual Conference, TAMC 2010, 7 - 11 June 2010, Prague, Czech Republic. Springer Verlag , 50 - 59 . ISBN 978-3-642-13561-3
Available under licence : See the attached licence file.
The classical approach to proof complexity perceives proof systems as deterministic, uniform, surjective, polynomial-time computable functions that map strings to (propositional) tautologies. This approach has been intensively studied since the late 70’s and a lot of progress has been made. During the last years research was started investigating alternative notions of proof systems. There are interesting results stemming from dropping the uniformity requirement, allowing oracle access, using quantum computations, or employing probabilism. These lead to different notions of proof systems for which we survey recent results in this paper.
|Item Type:||Proceedings Paper|
|Copyright, Publisher and Additional Information:||© 2010, Springer Verlag. This is an author produced version of a paper published in Theory and Applications of Models of Computation. Uploaded in accordance with the publisher's self-archiving policy. The original publication is available at www.springerlink.com|
|Institution:||The University of Leeds|
|Academic Units:||The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds)|
|Depositing User:||Symplectic Publications|
|Date Deposited:||10 Dec 2012 13:02|
|Last Modified:||08 Jun 2014 20:15|