Program of the Sixth International Symposium on Artificial Intelligence and Mathematics

Thursday, January 6, 2000


SAT + Theorem Proving I

(invited session)

Probabilistic Reasoning


A parallel approach to resolution-refutation proofs, by Monroe Newborn

Reasoning with BKBs - Algorithms and Complexity, by Tzachi Rosen, Eugene Santos Jr., and Solomon Eyal Shimony


Practical Heuristics for Solving Problems for Serializable Subgoals </I, by Mohammed Almulla and A. El-Sheikh

A deductive approach for solving probabilistic logic problems, by B. Jaumard, S. Lemaire, A. Parreira


Qualitative Theorem Proving in Linear Constraints , by Vijay Chandru, Catherine Lassez, and Jean-Louis Lassez

Belief Combination by means of Frame Transformations, by Sergio A. Alvarez

10:30 - 11:00 Coffee break


SAT + Theorem Proving II
(invited session)

Machine Learning I


Some results about the probabilistic SAT problem, by Daniele Pretolani and Kim Allan Andersen

Terminal distinguishable languages, by Henning Fernau


Solving some SAT instances by cutting planes , Ming Ouyang

From disagreement sets to divergence levels in ILP, by Gilles Richard

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


SAT + Theorem Proving III (invited session)

Qualitative Reasoning


Semi-definite relaxations of 2+p-SAT problems; another phase-transition?, by Hans van Maaren and Lucie Aarts

Qualitative Reasoning with Quantified Assertions, by Mohamed Yasser Khayata and Daniel Pacholczyk


The mechanics of upper and lower bound arguments related to the probabilistic complexity of resolution-based algorithms on random k-SAT formulas, by John Franco

Using Topology for Spatial Reasoning, by Boi Faltings

14:30 - 15:00: Coffee break


SAT + Theorem Proving IV
(invited session)

Stochastic Algorithms


 A Satisfiability Formulation of problems of Level graphs, by E. Speckenmeyer

 Inhomogeneous Markov Chains Applied to Pattern Classification, by A. Albrecht and C.K. Wong



 A Measure of Combinational Landscape Difficulty for the Metropolis = Algorithm, by Meriema Belaidouni and Jin Kao Hao

16:00 - 16:30 Coffee break


Propositional Reasoning

Knowledge Exploration I
(invited session)


An improved version of width restricted resolution, by Oliver Kullmann

Prediction of ecotoxicity of pesticides: comparison of multivariate analysis, neural networks, and classifiers, by G. Gini, M. Balestri, E. Benfenati, and S. Pelagatti


Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination, by Fumiaki Okushi and Allen Van Gelder

Knowledge Exploration for Toxicity Prediction by Using Genetic Optimized B-Spline Networks, by Adolf Grauel, Ingo Renners, and Lars A. Ludwig