2011: Computer science workshop

March 24–25, 2011, a Workshop on Logic and Computer Science takes place at the KGRC, organized by Laura Kovacs (TU Wien) and Sy Friedman (KGRC).

Program

Thursday, March 24
09:20 – 10:10	Tetsuo Ida (Tsukuba)	Theory of Handcrafted and Computational Fold
10:20 – 11:10	Masahiko Sato (Kyoto)	Formalization of Mathematics
11:30 – 12:00	Temur Kutsia (Linz)	Anti-Unification for Unranked Terms and Hedges
14:00 – 14:50	Fairouz Kamareddine (Edinburgh)	MathLang, a system for the computerisation of mathematics
15:00 – 15:50	Florian Zuleger (Vienna)	Termination proofs for imperative programs
16:30 – 17:20	Yike Guo (London)	Wikianalytics
17:30 – 18:00	Sy Friedman (Vienna)	Strong isomorphism reductions in complexity theory
19:00	Workshop Dinner: Wiener Kochsalon (everyone invited)
Friday, March 25
09:20 – 10:10	Angelina Vidali (Vienna)	Designing Truthful Mechanisms
10:20 – 11:10	Tudor Jebelean (Linz)	Induction as Termination Principle
11:30 – 12:00	Laura Kovacs (Vienna)	Experiments with Invariant Generation Using a Saturation Theorem Prover
14:00 – 14:50	Agata Ciabattoni (Vienna)	Systematic (and algebraic) proof theory for substructural logics
15:00 – 15:50	Thomas Eiter (Vienna)	Paracoherent Answer Set Programming
	Sekt and Sandwiches