Program of the Seventh International Symposium on Artificial Intelligence and Mathematics


Friday, January 4, 2002

9:00 - 10:00 Plenary lecture: INVITED TALK II

Sarit Kraus:

Real-time cooperation: Adversarial domains vs. cooperative domains


10:00 - 10:30: Coffee break

Theorem proving and logic programs

Combinatorial data analysis (invited session)

10:30

D. Cenzer, A.K.C.S. Vanderbilt: Common Derivations in Locally Determined Logic Programs

Khaled Elbassioni: Learning monotone binary functions in products of lattices

11:00

S. Colton, G.Sutcliffe: Automatic Generation of Benchmark Problems for Automated Theorem Proving Systems

Alex Kogan: Inferring Minimal Functional Dependencies in Horn and q-Horn Theories

11:30

E. Maclean, Jacques Fleuriot, Alain Smaill: Proof planning Non-standard Analysis

Mutsunori Yaguira: On the Number of Patterns with Large Coverage in LAD

12:00

Endre Boros: Handling categorical variables in machine learning


12:30 - 14:00: Lunch (on your own)

14:00 - 15:00 Plenary lecture: INVITED TALK III

György Turan:

On theory revision


15:00 - 15:15: Closing -- END OF MEETING