Boolean Functions and Data Mining

A special invited session on Boolean Functions and SAT, consisting solely of invited talks, has been organized by Ewald Speckenmeyer (Universität zu Köln, Institut für Informatik, Pohligstr. 1, D-50969 Köln, Germany). 

• On the structure of some classes of minimal unsatisfiable formulas in CNF, by Hans Kleine Büning, University of Paderborn, Germany. (MO 13:30)
  
  
• A closer look at the pure implicational calculus, by Peter Heusch, Universität zu Köln, Germany. (MO 14:00)
  
  
• Generation and comparison of decision strategies for solving satisfiability problems, by Robert Rodosek, Imperial College, London, England. (MO 14:30)