LCC 2007

Ninth International Workshop on
Logic and Computational Complexity

15 July 2007   •   Wroclaw, Poland

The Logic and Computational Complexity Workshop (LCC'07) will be a satellite workshop of the Logic in Computer Science Conference (LICS 2007)
 
PROGRAM
SESSION 1
9.00-10.00 INVITED TALK
Algorithmic meta-theorems
Martin Grohe (Humboldt University of Berlin)
 
10.00-10.30 break
 
SESSION 2
10.30-11.30 INVITED TALK
An algebraic approach to the constraint satisfaction problem
Matt Valeriote (McMaster University)
11.30-12.00 Meta-finite model expansion
Eugenia Ternovska, David Mitchell, and Brendan Guild (Simon Fraser Unversity)
12.00-12.30 On canonical forms of complete problems via first-order projections
Nerio Borges and Blai Bonet (Simón Bolívar University)
 
12.30-14.00 lunch
 
SESSION 3
14.00-15.00 INVITED TALK
Expressive power of tree logics
Mikolaj Bojanczyk (University of Warsaw)
15.00-15.30 Order-invariant MSO is stronger than counting MSO
Tobias Ganzow (RWTH Aachen University) and Sasha Rubin (University of Auckland)
 
15.30-16.00 break
 
SESSION 4
16.00-17.00 INVITED TALK
Resolution proof systems and clause learning SAT algorithms
Jan Johannsen (Ludwig Maximilians University Munich)
17.00-17.30 Resource control of object-oriented programs
Jean-Yves Marion, Romain Pechoux (LORIA/Nancy)
17.30-18.00 Improvements on and optimality of a recent method of certifying polynomial running time and linear/polynomial space
Karl-Heinz Niggl and Jan Mehler (Technical University of Ilmenau)
                       

REGISTRATION AND ACCOMMODATIONS







Program committee

Steering committee

Important dates

15 July 2007 LCC Workshop Dates
10-14 July 2007 LICS'07 Dates

WWW-pages

The LCC home page: http://www.cis.syr.edu/~royer/lcc/
The LICS home page: http://www2.informatik.hu-berlin.de/lics/

Contact information

James S. Royer
Department of Electrial Engineering and Computer Science
Syracuse University
Syracuse, NY 13244 USA
Email: royer at ecs syr edu