2nd Workshop on the Parameterized Complexity of Computational Reasoning
The 2nd Workshop on the Parameterized Complexity of Computational Reasoning (PCCR 2014) aims to support a fruitful exchange of ideas between the research on parameterized complexity on one side and the research on various forms of computational reasoning (such as nonmonotonic, probabilistic, and constraint-based reasoning) on the other.
Topics of interest include but are not limited to: multivariate analysis of reasoning problems, kernelization and preprocessing, fixed-parameter tractability and hardness, backdoors and decompositions.
The workshop will feature invited and contributed talks with surveys and new technical results, an open problem session, and a panel discussion on future research directions. Apart from talks on parameterized complexity we are also interested in presentations that highlight structural parameters that have not been studied within the framework of parameterized complexity so far.
Call for Papers
- Georg Gottlob (University of Oxford, UK),
- Dániel Marx (Hungarian Academy of Sciences (MTA SZTAKI), Hungary), and
- Stefan Szeider (Vienna University of Technology, Austria).
PCCR 2014 is organized by
- Michael R. Fellows (Charles Darwin University, Australia),
- Serge Gaspers (The University of New South Wales & NICTA, Australia), and
- Toby Walsh (NICTA & The University of New South Wales, Australia).
PCCR 2010 took place in August 2010 as a satellite workshop of MFCS & CSL 2010 in Brno, Czech Republic.
Registration is done via the VSL registration page. Early registration (by June 8, 2014) is 200 EUR, and gives access to all events of the Vienna Summer of Logic on the days of the workshop. PCCR 2014 is part of the Work Shop Block 2.