9:30 - 10:00

Conference Opening, by Marty Golumbic, General Chair, and Frederick Hoffman, Conference Chair

10:00 - 11:00 Plenary lecture: INVITED TALK I

Carnegie Mellon University

KDD I (invited session)

Constraint Satisfaction

11:15

Pareto-Optimal Patterns in Logical Analysis of Data, by Peter L. Hammer, Alexander Kogan, and Bruno Simone

A New Tractable Class of Constraint Satisfaction Problems, by Victor Dalmau

11:45

Identification of Frequent Sets and Association rules, by Jan Cor Bioch

Solving Hierarchical Constraints over Finite Domains, by Martin Henz, Lim Yun Fong, Lua Seet Chong, Shi Xiao Ping, J. Paul Walser, and Roland H. C. Yap

KDD II (invited session)

Nonmonotonic Reasoning

14:00

Average Case Performance of the Apriori Algorithm , by Paul Purdom

Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels, by Douglas Cenzer, Jeffrey B. Remmel, and Amy K. C. S. Vanderbilt

14:30

Generating all ``good'' patterns in polynomial expected time, by Endre Boros, Lijie Shi, and Mutsunori Yagiura

Generalized vs formula circumscription over finite models, by Alexei Lisitsa

KDD III (invited session)

Optimization

15:30

Algorithms for Massive Data Streams , by Martin Strauss

Heuristics for Vehicle Routing Problem with Time Windows, by Kay Chen Tan, Loo Hay Lee, Kenny Qili Zhu, and Kenny Zhu

16:00

Multiple Randomized Classifiers: Why boosting and randomized forests really work, by Yali Amit

On Solving Boolean Optimization with Satisfiability-Based Algorithms, by Vasco M. Manquinho and Joao Marques-Silva