FLoC 2006 - FLoC

The 2006 Federated Logic Conference
Seattle, August 10 - 22, 2006

Monday, August 14th

See also the by-session program.

LICS	RTA	SAT

09:00‑10:00 (Metropolitan A) Orna Kupferman Avoiding Determinization [ppt]	09:00‑10:00 (Cirrus) Jurgen Giesl Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages [pdf]	09:00‑10:00 (Metropolitan B) Fahiem Bacchus CSPs: Adding Structure to SAT [ppt]
10:00‑10:30 Break
10:30‑11:00 (Metropolitan A) Nir Piterman From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata	10:30‑11:00 (Cirrus) Nao Hirokawa and Aart Middeldorp Predictive Labeling	10:30‑11:00 (Metropolitan B) María Luisa Bonet , Jordi Levy and Felip Manyà A Complete Calculus for Max-SAT
11:00‑11:30 (Metropolitan A) Orna Kupferman and Moshe Y. Vardi Memoryful Branching-Time Logic	11:00‑11:30 (Cirrus) Dieter Hofbauer and Johannes Waldmann Termination of String Rewriting with Matrix Interpretations	11:00‑11:30 (Metropolitan B) Zhaohui Fu and Sharad Malik On Solving The Partial MAX-SAT Problem
11:30‑12:00 (Metropolitan A) Nir Piterman and Amir Pnueli Faster Solutions of Street and Rabin Games	11:30‑12:00 (Cirrus) Yi Wang and Masahiko Sakai Decidability of Termination for Semi-Constructor TRSs, Left-Linear Shallow TRSs and Related Systems	11:30‑12:00 (Metropolitan B) Evgeny Dantsin and Alexander Wolpert MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster than in $O(2^n)$ Time
12:00‑12:30 (Metropolitan A) Mikolaj Bojanczyk and Thomas Colcombet Bounds in omega-regularity	12:00‑12:30 (Cirrus) Olivier Bournez and Florent Garnier Proving Positive Almost Sure Termination Under Strategies	12:00‑12:15 (Metropolitan B) Osamu Watanabe and Masaki Yamamoto Average-case analysis of the MAX-2SAT problem
		12:15‑12:30 (Metropolitan B) Chu Min Li MAX-SAT Evaluation
12:30‑14:00 Lunch break
14:00‑14:30 (Metropolitan A) Soren Lassen Head normal form bisimulation for pairs and the lambda-mu calculus	14:00‑14:30 (Cirrus) Harrie Jan Sander Bruggink A Proof of Finite Family Developments for Higher-Order Rewriting using a Prefix Property	14:00‑14:30 (Metropolitan B) Steven Prestwich and Ines Lynce Local Search for Unsatisfiability
14:30‑15:00 (Metropolitan A) Thierry Coquand and Arnaud Spiwack Proof of strong normalisation using domain theory	14:30‑15:00 (Cirrus) Jean-Pierre Jouannaud and Albert Rubio Higher-Order Orderings for Normal Rewriting	14:30‑15:00 (Metropolitan B) Andrei Bulatov and Evgeny Skvortsov Efficiency of Local Search
15:00‑15:30 (Metropolitan A) Giulio Manzonetto and Antonino Salibra Boolean algebras for lambda calculus	15:00‑15:30 (Cirrus) Jordi Levy , Manfred Schmidt-Schauss and Mateu Villaret Bounded Second-Order Unification is NP-Complete	15:00‑15:30 (Metropolitan B) Panagiotis Manolios and Yimin Zhang Implementing Survey Propagation on Graphics Processing Units
15:30‑16:00 (Metropolitan A) Makoto Tatsuta and Mariangiola Dezani Normalisation is insensible to lambda-term identity or difference		15:30‑16:00 (Metropolitan B) Eric Hsu and Sheila McIlraith Characterizing Propagation Methods for Boolean Satisfiability
16:00‑16:30 Break
16:30‑17:15 (Metropolitan A and B) John Dawson Shaken Foundations or Groundbreaking Realignment? A Centennial Assessment of Kurt Gödel's Impact on Logic, Mathematics, and Computer Science [ppt]
17:15‑18:00 (Metropolitan A and B) Dana Scott The Future of Proof [pdf]