CALL FOR PARTICIPATION
PCCR 2010
Parameterized Complexity of Computational Reasoning
Satellite Workshop of MFCS & CSL
Brno, Czech Republic, 28 August 2010
http://www.kr.tuwien.ac.at/drm/pccr2010
This workshop 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. The workshop features invited
and contributed talks and presentations of surveys and new technical results.
Invited speakers are:
* Mike Fellows, Charles Darwin University
* Nicola Galesi, Sapienza University of Rome
* Gregory Gutin, University of London
* Petr Hlineny, Masaryk University Brno
* Reinhard Pichler, Vienna University of Technology
List of Presentations:
* Mike Fellows: An Overview of Parameterized Complexity and Recent Research
Directions in Constraint Satisfaction and Artificial Intelligence
* Gregory Gutin, Keynote Talk: Complexity of Permutation Constraint Satisfaction
Problems Parameterized Above Average
* Petr Hlineny: Where Myhill-Nerode Theorem meets Parameterized Algorithmics
* Reinhard Pichler: Bounded Treewidth in Non-Monotonic Reasoning
* M. Praveen: Does Treewidth Help in Modal Satisfiability?
* Fran Rosamond: On the Complexity of Some Constraint Satisfaction Problems with
Global Constraints and Convexity
* Nicola Galesi: The Complexity of Proofs in Parameterized Resolution
* Yijia Chen: Optimal Proof Systems, Slicewise Monotone Parameterized Problems,
and Logics for PTIME
For the schedule of the talks, see http://www.kr.tuwien.ac.at/drm/pccr2010/
For information on how to register and local information please consult the
MFCS-CSL 2010 web-site http://mfcsl2010.fi.muni.cz/
The workshop is organized by Igor Razgon, Marko Samer, Stefan Szeider (chair),
and Stefan Woltran.
==============================================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
