PCCR 2014 ABSTRACTS: EDITOR'S PREFACE
PCCR 2014, the 2nd Workshop on the Parameterized Complexity of Computational Reasoning, took place in Vienna, Austria, 17-18 July 2014, as part of FLoC and the Vienna Summer of Logic.
The workshop was hosted by CSL-LICS and is also affiliated with IJCAR and SAT. The first edition of the workshop, PCCR 2010, took place in August 2010 as a satellite workshop of MFCS & CSL 2010 in Brno, Czech Republic.
PCCR supports 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.
The program of PCCR 2014 includes an open problem session, a panel session, and three invited talks,
- Georg Gottlob (University of Oxford, UK and Vienna University of Technology, Austria), Structural Decomposition Methods: How They Matter;
- Dániel Marx (Hungarian Academy of Sciences, Hungary), CSPs and fixed-parameter tractability;
- Stefan Szeider (Vienna University of Technology, Austria), Fixed-Parameter Algorithms for Reasoning Problems in NP and Beyond.
Contributed talks were given by Robert Ganian, Jan Johannsen, Martin Kronegger, Johann Makowsky, Sebastian Ordyniak, Andreas Pfandler, and R. Ramanujam.
We would like to thank all the speakers and participants of PCCR 2014, and the organizers of FLoC and VSL, who made the organization of this workshop effortless.