Logic, Combinatorics   and  Computation

 

in  finite  and  infinite  structures

Satellite workshop of the joint conferences

Mathematical Foundations of Computer Science  &  Computer Science Logic (23-27 August)

http://mfcsl2010.fi.muni.cz/

 

Brno, Czech Republic.

 

 

Organizers :  B. Courcelle, P. Hliněný, J. Makowsky

 

 

Presentation  and  topics   (The following list is not limitative)

 

 

Logical expression of graph properties, graph decompositions, graph transformations and related notions.

Logical expression of properties of matroids, isotropic systems, graph drawings and knots.

Counting and enumeration problems.

Polynomials associated with graphs and other combinatorial structures.

Combinatorics in games, 0/1 laws and randomized computations

Constraint satisfaction problems and other logically based algorithmic problems.

Finite descriptions of infinite structures.

 

Proof complexity.

 

 

Lectures will be surveys or presentations of  technical  results.

 

Full articles based on the presentations may be submitted to the excellent electronic and freely accessible journal :

Logical Methods in Computer Science  (B. Courcelle is member of its editorial board).

 

Please inform your colleagues, collaborators and PhD students of this event.

 

                        Final list of speakers, abstracts  and schedule of lectures

 

        

Bruno Courcelle (Bordeaux) : courcell@labri.fr

Petr  Hliněný (Brno) :  hlineny@fi.muni.cz ;  mfcsl2010@fi.muni.cz

Janos  Makowsky (Haďfa) :  janos@cs.technion.ac.il