[ The Types Forum (announcements only), http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]
The following is a program for LCC'07 (the 2007 Workshop on Logic and Computational Complexity) which will be a satellite workshop of the Logic in Computer Science Conference (LICS 2007). The deadline for early registration for LCC'07 and LICS 2007 is **Thursday, May 31**. See http://july2007.ii.uni.wroc.pl/registration.html for on-line registration. LCC'07 PROGRAM SESSION 1 9.00-10.00 INVITED TALK: Algorithmic meta-theorems Martin Grohe (Humboldt University of Berlin) 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 Evgenia Ternovska, David Mitchell, and Brendan Guild (Simon Fraser Unversity) 12.00-12.30 On canonical forms of concrete problems via first-order projections Blai Bonet and Nerio Borges (Simon Bolivar University) 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) 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 and 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) ------------------------------------------------------------------------ ---- The LCC'07 Homepage: http://www.cis.syr.edu/~royer/lcc/LCC07/ The joint conference site for ICALP, LICS, LC, PPDP 2007: http://july2007.ii.uni.wroc.pl/