The Tenth International Symposium on Artificial Intelligence and Mathematics
| # Fort Lauderdale, Florida January 2-4, 2008
| Rasa 3 © Marjorie Mikasen 2000

| # Special Sessions ## ISAIM 2008 will feature three special sessions:
Logic in Artificial Intelligence: Special Session in Honor of the 65th Birthday of Victor W. Marek
Computation and Social Choice
Effective Exploration in Active Learning and Reinforcement Learning
## Organizers and invited speakers of the special sessions:
Logic in Artificial Intelligence: Special Session in Honor of the 65th Birthday of Victor W. Marek
Organizers: Michael Kaminski (Technion) and Miroslaw Truszczynski (University of Kentucky)
Speakers: Howard Blair (Syracuse University) Hybrid Programs: Symmetrically Combining Natively Discrete and Continuous Truth-values Alex Bochman (Holon Academic Institute of Technology) Default Logic Generalized and Simplified Thomas Eiter (Technische Universität Wien) Exploiting Conjunctive Queries in Description Logic Programs Mel Fitting (City University of New York) Explicit Logics of Knowledge and Conservativity Michael Gelfond (Texas Tech University) Integrating Answer Programming and Constraint Logic Programming Michael Kaminski (Technion) A Non-Preferential Semantics of Non-Monotonic Modal Logic Johann Makowsky (Technion) From Hilbert's Program to a Logic Toolbox Ilkka Niemela (Helsinki University of Technology) Stable Models and Difference Logic Jeff Remmel (University of California at San Diego) A Mathematician Looks at Answer Set Programming John Schlipf (University of Cincinnati) and Marc Denecker (Katholieke Universiteit Leuven) Complexity of First Order ID-Logic Marian Srebrny (Polish Academy of Sciences) SAT as a programming environment for linear algebra and cryptography Miroslaw Truszczynski (University of Kentucky) Hyperequivalence of programs and operators
Computation and Social Choice
Organizer: Toby Walsh (NICTA and University of New South Wales)
Speakers: Vincent Conitzer (Duke University) Comparing Multiagent Systems Research in Combinatorial Auctions and Voting Edith Elkind (University of Southampton) Weighted voting games: manipulation, control, and computational complexity Ulle Endriss (University of Amsterdam) Fairness and Efficiency in Multiagent Resource Allocation John Hooker (Carnegie Mellon University) Optimality Conditions for Distributive Justice Arkadii Slinko (University of Auckland) TBA Toby Walsh (NICTA and University of New South Wales) Complexity Issues in Preference Elicitation and Manipulation
Effective Exploration in Active Learning and Reinforcement Learning
Organizer: Pascal Poupart (University of Waterloo)
Speakers: Sanjoy Dasgupta (University of California, San Diego) Agnostic Active Learning Algorithm Joelle Pineau (McGill University) Bayes-Adaptive POMDPs: A New Perspective on the Explore-Exploit Tradeoff in Partially Observable Domains Doina Precup (McGill University) Approaches to Bayesian Exploration in Markov Decision Processes Pascal Poupart (University of Waterloo) Bayesian Reinforcement Learning in Partially Observable Domains Irina Rish (IBM Research) Active Collaborative Prediction with Maximum Margin Matrix Factorization Alexander L. Strehl (Yahoo Research) Probably Approximately Correct (PAC) Exploration in Reinforcement Learning

Last updated: December 12, 2007.