7-8 Jul 2018
Oxford, England
FLoC workshop on proof complexity - Call for Presentations ---------------------------------------------------------- Oxford, 7-8 July 2018 http://easychair.org/smart-program/PC2018/ The workshop will be part of FLoC and will be affiliated with the conferences SAT'18 and LICS'18. === Important Dates === 15 April 2018 ....... Abstract submission 15 May 2018 ......... Notification to authors 7-8 July 2018 ....... Workshop in Oxford === Scope === Proof complexity is the study of the complexity of theorem proving procedures. The central question in proof complexity is: given a theorem F (e.g. a propositional tautology) and a proof system P (i.e., a formalism usually comprised of axioms and rules), what is the size of the smallest proof of F in the system P? Moreover, how difficult is it to construct a small proof? Many ingenious techniques have been developed to try to answer these questions, which bare tight relations to intricate theoretical open problems from computational complexity (such as the celebrated P vs. NP problem), mathematical logic (e.g. separating theories of Bounded Arithmetic) as well as to practical problems in SAT/QBF solving. === Invited Speakers === Christoph Berkholz (Humboldt University Berlin) Samuel R. Buss (University of California, San Diego) Nicola Galesi (Sapienza University Rome) Meena Mahajan (IMSc Chennai) === Submissions === We welcome 1-2-page abstracts presenting (finished, ongoing, or if clearly stated even recently published) work on proof complexity. Particular topics of interest are * Proof Complexity * Bounded Arithmetic * Relations to SAT/QBF solving * Relations to Computational Complexity === Submission Guidelines === Abstracts are invited of ongoing, finished, or (if clearly stated) even recently published work on a topic relevant to the workshop. The abstracts will appear in electronic pre-proceedings that will be distributed at the meeting. Abstracts (at most 2 pages, in LNCS style) are to be submitted electronically in PDF via EasyChair http://www.easychair.org/conferences/?conf=pc2018 Accepted communications must be presented at the workshop by one of the authors. === Program Committee === Olaf Beyersdorff (University of Leeds) - chair Ilario Bonacina (UPC Barcelona) Leroy Chew (University of Leeds) Yuval Filmus (Technion ? Israel Institute of Technology) Jan Johannsen (Ludwig Maximilian University of Munich) - chair Martina Seidl (Johannes Kepler University Linz) === Organizers === Olaf Beyersdorff (University of Leeds) Leroy Chew (University of Leeds) Jan Johannsen (LMU Munich) -- [LOGIC] mailing list http://www.dvmlg.de/mailingliste.html Archive: http://www.illc.uva.nl/LogicList/ provided by a collaboration of the DVMLG, the Maths Departments in Bonn and Hamburg, and the ILLC at the Universiteit van Amsterdam