PPC10: July 9

Propositional Proof Complexity: Theory and Practice

associated with SAT

Overview

Propositional proof complexity is an area of mathematics (theoretical computer science) within the intersection of mathematical logic and computational complexity and is centered around the question whether the complexity class NP is closed under complementation. It is tightly connected with other areas like computational complexity theory, automated theorem proving and cryptography.

The purpose of the workshop is to bring together researchers in various parts of mathematics and computer science interested in propositional proof complexity. The topic of the workshop will be on propositional proof theory with connections to issues of complexity in the widest sense. Our aim is to expose, through invited and contributed talks, current developments in proof complexity that are most relevant to SAT-solving and automated theorem proving.

More information can be found here.

Programme

Program Chairs

Stefan Dantchev, Durham University, United Kingdom
Olga Tveretina, University of Karlsruhe, Germany

Program Committee:

Eugene Goldberg, Northeastern University, United States
Barnaby Martin, Engineering and Computing Sciences, Durham University, United Kingdom
Alexander Razborov
Søren Riis, Queen Mary, University of London, Denmark
Hans Zantema, Technische Universiteit Eindhoven, The Netherlands, Netherlands