[isaim2008] Call for Participation: Tenth Int'l Symp. on AI and Math (ISAIM 2008)

   [Apologies if you receive multiple copies of this announcement]

			CALL FOR PARTICIPATION

		   Tenth International Symposium on
	       ARTIFICIAL INTELLIGENCE and MATHEMATICS
			      ISAIM 2008
		       http://isaim2008.unl.edu

			  January 2-4, 2008
		       Fort Lauderdale, Florida

       EARLY REGISTRATION DEADLINE: Thursday, December 20, 2007


CONTENT:
- ABOUT THE SYMPOSIUM
- INVITED SPEAKERS
- SPECIAL TOPIC INVITED SESSIONS
- REGISTRATION
- HOTEL RESERVATION (book your room ASAP)
- ORGANIZERS
- PROGRAM COMMITTEE
- ADVISORY COMMITTEE
- SPONSORS
- LIST OF ACCEPTED PAPERS


ABOUT THE SYMPOSIUM:=20

The International Symposium on Artificial Intelligence and Mathematics
(ISAIM) is a biennial meeting that fosters interactions between
mathematics, theoretical computer science, and artificial
intelligence.  This is the tenth Symposium in the series, which is
sponsored by Annals of Mathematics and Artificial Intelligence.
Traditionally, the Symposium attracts participants from a variety of
disciplines, thereby providing a unique forum for scientific exchange.
The three-day Symposium includes invited speakers, presentations of
technical papers, and special topic sessions.


INVITED SPEAKERS:

o  David McAllester, Toyota Technological Institute at Chicago, USA
   "Mathematical Problems from Machine Learning"=20
o  Francesca Rossi, Padova University, Italy
   "Preference Reasoning"
o  Naftali Tishby, The Hebrew University, Israel
   "Extracting Relevant Information from Samples"


SPECIAL TOPIC INVITED SESSIONS: =20

o Logic in Artificial Intelligence
    -Special Session in Honor of the 65th Birthday of Victor Marek
    -Organized by Michael Kaminski and Mirek Truszczynski.

    SPEAKERS:
    * Howard Blair (Syracuse University)
      Hybrid Programs: Symmetrically Combining Natively Discrete and
      Continuous Truth-values in a Single Logic Programming Formalism

    * Alex Bochman (Holon Academic Institute of Technology)
      Default Logic: Representation and Computation

    * Marc Denecker (Katholieke Universiteit Leuven) and John Schlipf=20
      (University of Cincinnati)
      Complexity of First Order ID Logic

    * Thomas Eiter (Technische Universit=E4t 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)
      Integrated inference engine for Answer Set Prolog - preliminary rep=
ort

    * Georg Gottlob (Oxford University)
      Asymptotic Conditional Probability in Modal Logic: A
      Probabilistic Reconstruction of Nonmonotonic Logic

    * Johann Makowsky (Technion)
      From Hilbert's program to a logic toolbox: Reflections on
      teaching logic to Computer Science students

    * Ilkka Niemela (Helsinki University of Technology)
      Answer Set Programming and Difference Logic

    * Jeff Remmel (University of California at San Diego)
      A Mathematician Looks at Answer Set Programming

o Computation and Social Choice
    -Organized by Toby Walsh, NICTA and University of New South Wales

    SPEAKERS:
    * Vincent Conitzer (Duke University)

    * Edith Elkind (University of Southampton)

    * Ulle Endriss (University of Amsterdam)

    * John Hooker (Carnegie Mellon University)

    * Arkadii Slinko (University of Auckland)

o Effective Exploration in Active Learning and Reinforcement Learning
    -Organized by Pascal Poupart, University of Waterloo

    SPEAKERS:
    * Sanjoy Dasgupta (University of California, San Diego)

    * Joelle Pineau (McGill University)

    * Doina Precup (McGill University)

    * Irina Rish (IBM Research)

    * Alexander L. Strehl (Yahoo Research)


REGISTRATION:
For registration information, please see the website:
https://fauf.fau.edu/ISAIM2008

The deadline for early registration is December 20, 2007.


HOTEL RESERVATION:
For hotel information information, please see the website:
http://embassysuites.hilton.com/en/es/groups/personalized/fllsoes_dms/ind=
ex.
jhtml

The block reservation cutoff date at the Symposium hotel is December
2nd, 2007.  Please note that rooms will be difficult to find because
of the Orange Bowl.  We strongly recommend making your room
reservations as early as possible.


ORGANIZERS:

o General Chair:     Martin Charles Golumbic, University of Haifa
o Conference Chair:  Frederick Hoffman, Florida Atlantic University
o Program Co-Chairs: Berthe Y. Choueiry, University of Nebraska-Lincoln
                     and Bob Givan, Purdue University
o Publicity Chair:   Mehran Sahami, Stanford University


PROGRAM COMMITTEE:

Michael Bowling       University of Alberta
Ronen Brafman         Ben-Gurion University
Yixin Chen            Washington University in St Louis
Vincent Conitzer      Duke University
Rina Dechter          University of California, Irvine
Thomas Eiter          Technische Universitaet Wien
Alan Fern             Oregon State University
Hector Geffner        Universitat Pompeu Fabra
Carla P. Gomes        Cornell University
Georg Gottlob         Oxford University
Eric Hansen	          Mississipi State University
Milos Hauskrecht      University of Pittsburgh
Malte Helmert         Albert-Ludwigs-Universitat Freiburg
Michael Kaminski      Technion
Kristian Kersting     Massachusetts Institute of Technology
Roni Khardon          Tufts University
Sven Koenig           University of Southern California
Richard Korf          University of California, Los Angeles
Manolis Koubarakis    National and Kapodistrian University of Athens
Gerhard Lakemeyer     Aachen University of Technology
Guy Lebanon           Purdue University-West Lafayette
Hector Levesque       University of Toronto
Kevin Leyton-Brown    University of British Columbia
Karl Lieberherr	    Northeastern University
Vladimir Lifschitz    University of Texas, Austin
Alan K. Mackworth     University of British Columbia
Michela Milano        Universita di Bologna
Brian Milch           Massachusetts Institute of Technology
Bernhard Nebel        Albert-Ludwigs-Universitat Freiburg
David Page            University of Wisconsin, Madison
Ronald Parr           Duke University
Pascal Poupart        University of Waterloo
Henri Prade           IRIT and Universite de Toulouse
Steven Prestwich      Cork Constraint Computation Center
Jussi Rintanen        NICTA
Jeff Rosenschein      The Hebrew University of Jerusalem
Wheeler Ruml          University of New Hampshire=20
Andrea Schaerf        University of Udine
Bart Selman           Cornell University
Meinolf Sellmann      Brown University
Jude W. Shavlik       University of Wisconsin, Madison
Thomas Stuetzle       Universite Libre de Bruxelles
Miroslaw Truszczynski University of Kentucky
Hudson Turner         University of Minnesota, Duluth
Peter van Beek        University of Waterloo
Toby Walsh            NICTA and University of New South Wales
Nic Wilson            Cork Constraint Computation Center
Michael Wooldridge    University of Liverpool
Neil Yorke-Smith      SRI International
Luke Zettlemoyer      Massachusetts Institute of Technology
Weixiong Zhang        Washington University
Shlomo Zilberstein    University of Massachusetts, Amherst


ADVISORY COMMITTEE:=20

The Editor-in-Chief (Martin Charles Golumbic) and the members of the
Editorial Board of Annals of Mathematics and Artificial Intelligence
serve as the permanent Advisory Committee of the Symposium.


SPONSORS:=20

The Symposium is partially supported by:
o Annals of Mathematics and Artificial Intelligence
o Caesarea Rothschild Institute at the University of Haifa
o Florida Atlantic University (Department of Mathematical Sciences)
o Florida-Israel Institute
o Google Inc.
o Intelligent Information Systems Institute (IISI) at Cornell University=20
o Microsoft Research
ISAIM 2008 is held in cooperation with AAAI.

Send inquiries and requests: isaim2008 AT cse.unl.edu.
Check symposium web-page: http://isaim2008.unl.edu.
Join [email protected] to receive announcements related to ISAIM.


LIST OF ACCEPTED PAPERS:

Estimating the Number of Local Maxima for k-SAT Instances=20
Andreas Albrecht, Peter Lane , Kathleen Steinhoefel=20

Hard Sat and CSP Instances with Expander Graphs=20
Carlos Ansotegui, Ramon Bejar, Cesar Fernandez, Carles Mateu=20

More Flexible Term Schematisations via Extended Primal Grammars=20
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier=20

Formalising Interaction-Situated Semantic Alignment: The Communication
Product=20
Manuel Atencia, Marco Schorlemmer

Scalable Action Respecting Embedding=20
Michael Biggs, Ali Ghodsi, Dana Wilkinson, Michael Bowling=20

A Lazy Approach to Online Learning with Constraints=20
Kveton Branislav, Jia Yuan Yu, Georgios Theocharous, Shie Mannor=20

Continuous-State POMDPs with Hybrid Dynamics=20
Emma Brunskill, Leslie Kaelbling, Tomas Lozano-Perez, Nicholas Roy=20

A Connection between Cantor-Bendixson Derivatives and the Well-Founded=20
Semantics of Logic Programs=20
Douglas Cenzer, Jeffrey Remmel=20

An Interpretation of Consistent Belief Functions in terms of=20
Simplicial Complexes
Fabio Cuzzolin=20

Boolean and Matroidal Independence in Uncertainty Theory=20
Fabio Cuzzolin =09

Tradeoffs in Backdoor Detection for Sat and Unsat Formulas=20
Bistra Dilkina, Carla Gomes, Ashish Sabharwal=20

Paired Sampling in Density-Sensitive Active Learning=20
Pinar Donmez, Jaime Carbonell=20

Reinforcement Learning with Limited Reinforcement: Using Bayes Risk=20
for Active Learning in POMDPs=20
Finale Doshi, Joelle Pineau, Nicholas Roy=20

Best-First Search with Maximum Edge Cost Functions=20
P. Alex Dow, Richard Korf=20

Sampling for Approximate Inference in Continuous Time Bayesian Networks=20
Yu Fan, Christian Shelton=20

A Fast Way to Produce Optimal Fixed-Depth Decision Trees=20
Alireza Farhangfar, Russell Greiner, Martin Zinkevich=20

Practical Methods for Exploiting Bounds on Change in the Margin=20
Andrew Guillory, Jeff Bilmes=20

Planning Aims for a Network of Horizontal and Overhead Sensors=20
Erik Halvorson, Ronald Parr=20

Rare Class Discovery Based on Active Learning=20
Jingrui He, Jaime Carbonell=20

Minimal Residual Approaches for Learning to Predict in Large=20
Sparse Markov Chains
Yao Hengshuai, Liu Zhiqiang=20

On The Power of Clause Learning=20
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, Daniel Zabawa =09

Classifier Utility Visualization by Distance-Preserving Projection=20
of High Dimensional Performance D=20
Nathalie Japkowicz, Pritika Sanghi, Peter Tischer =09

Solving Structured Continuous-Time Markov Decision Processes=20
Kin Fai Kan, Christian Shelton=20

A Bayesian Approach to Cluster Validation=20
Hoyt Koepke, Bertrand Clarke=20

Leveraging Belief Propagation, Backtrack Search, and Statistics for=20
Model Counting=20
Lukas Kroc, Bart Selman, Ashish Sabharwal=20

Combinatorial problems for Horn clauses=20
Marina Langlois, Dhruv Mubayi, Robert Sloan, Gyorgy Turan=20

Efficient Value-Function Approximation via Online Linear Regression=20
Lihong Li, Michael Littman=20

A Refutation Approach to Local Interchangeability in CSPs=20
Chavalit Likitvivatanavong, Roland Yap

A Polynomial-time Nash Equilibrium Algorithm for Repeated Stochastic Game=
s=20
Enrique Munoz de Cote, Michael Littman=20

Approximate Solutions of Interactive POMDPs Using Point Based Value
Iteration=20
Dennis Perez, Prashant Doshi=20

Order-based Discriminative Structure Learning for Bayesian Network
Classifiers=20
Franz Pernkopf, Jeff Bilmes=20

A Successive Approximation Algorithm for Coordination Problems=20
Marek Petrik, Shlomo Zilbertstein=20

Approximation Techniques for Space-Efficient Compilation in=20
Abductive Inference
Gregory Provan=20

Extending the Bellman equation for MDPs to Continuous Actions and Continu=
ous

Time in the Discounted Case=20
Emmanuel Rachelson, Fr=E9d=E9rick Garcia=20

Predictive Linear-Gaussian Models of Dynamical Systems with=20
Vector-Valued Actions and Observations=20
Matthew Rudary, Satinder Singh=20

On the Relationship between Hybrid Probabilistic Logic Programs
and Stochastic Satisfiability=20
Emad Saad=20

Lifting Techniques for Weighted Constraint Satisfaction Problems=20
T. K. Satish Kumar=20

Probabilistic Sequential Diagnosis by Compilation=20
Sajjad Siddiqi, Jinbo Huang=20

Approximation strategies for Routing in Stochastic Dynamic Networks=20
Tomas Singliar, Milos Hauskrecht=20

Using Abstraction for Generalized Planning=20
Siddharth Srivastava, Neil Immerman, Shlomo Zilbertstein=20

Building Incomplete but Accurate Models=20
Erik Talvitie, Britton Wolfe, Satinder Singh=20

Declarative Programming of Search Problems with Built-in Arithmetic=20
Eugenia Ternovska, David Mitchell=20

Verifying RUP Proofs of Propositional Unsatisfiability=20
Allen Van Gelder
=20

_______________________________________________
isaim2008 mailing list
[email protected]
https://mailman.stanford.edu/mailman/listinfo/isaim2008