Fifth International Symposium on 
Artificial Intelligence and Mathematics 
January 4-6, 1998, Fort Lauderdale, Florida 

Electronic Proceedings
with a foreword by the Program Co-Chairs

Papers are listed in alphabetical order by the last name of the first author.
 
Edoardo Amaldi School of Operations Research and Theory Center, Cornell University, Ithaca, NY 14853.
On the complexity of designing compact perceptrons and some consequences.

Short abstract.
Zippora Arzi­Gonczarowski Typographics, Ltd. Jerusalem, Israel.
Perceive This as That -- Analogical Cognitive Transitions with Categorical Tools.

Short abstract.
Philippe Besnard, CNRS, IRISA, Campus de Beaulieu, F-35042 Rennes Cedex, France, and Torsten Schaub, Institut fur Informatik, Universitat Potsdam, Postfach 60 15 53, D-14415 Potsdam, Germany.
Characterization of non-monotone non-constructive systems.

Short abstract.
Stefano Bistarelli, and Francesca Rossi, Dipartimento di Informatica, Corso Italia 40, 56125 Pisa, Italy.
About arc-consistency in semiring-based constraint problems.

Short abstract.
Thomas Bittner Department of Geoinformation, Technical University of Vienna and National Center of Geographic Information and Analysis, NCGIA.
A model theory for Figure Ground Location.

Short abstract.
Patrick Blackburn, and Miroslava Tzakova, Max-Planck Institute fur Informatik, Im Stadtwald, 66123 Saarbrucken, Germany.
A Hybrid Concept Language.

Short abstract.
Endre Boros, and Tonguç Ünlüyurt, RUTCOR, Rutgers University.
Diagnosing Double Regular Systems.

Short abstract.
Hans Kleine Büning, University of Paderborn, Department of Mathematics and Computer Science, D-33095 Paderborn, Germany.
On the structure of some classes of minimal unsatisfiable formulas in CNF.

Short abstract.
Sylvie Coste-Marquis and Pierre Marquis, CRIL, Université d'Artois & IUT de Lens, rue de l'Université ­ S.P. 16 ­ F­62307 Lens Cedex, France.
Characterizing consistency based diagnosis.

Short abstract.
Rina Dechter and Dan Frost, Information and Computer Science Dept., University of California, Irvine, Irvine, CA 92717.
Optimizing with constraints: a case study in scheduling maintenance of electric power units.

Short abstract.
Oya Ekin, Peter L. Hammer, and Alexander Kogan, RUTCOR, Rutgers University, New Jersey.
Convexity and Logical Analysis of Data.

Short abstract.
Allen Van Gelder and Fumiaki Kamiya Okushi, University of California, Santa Cruz.
A Propositional Theorem Prover to Solve Planning and Other Problems.

Short abstract.
Allen Van Gelder, University of California, Santa Cruz.
Propositional Search with k-Clause Introduction Can be Polynomially Simulated by Resolution.

Short abstract.
Allen Van Gelder and Fumiaki Kamiya Okushi University of California, Santa Cruz.
Lemma and Cut Strategies for Propositional Model Elimination.

Short abstract.
Gavin Gibson Biomathematics and Statistics Scotland, Cathy Z. W. Hassell Sweatman, and Bernard Mulgrew Department of Electrical Engineering, University of Edinburgh, UK.
Exact Classification with 2-Layer Neural Nets: Theoretical Results and Open Problems.

Short abstract.
Vu Ha, and Peter Haddawy, Dept of EE & CS, University of Wisconsin-Milwaukee.
Geometric Foundations for Interval-Based Probabilities.

Short abstract.
Joseph Y. Halpern Dept. Computer Science, Cornell University, Ithaca, NY 14853.
Set­Theoretic Completeness for Epistemic and Conditional Logic.

Short abstract.
Jin­Kao Hao, and Jerome Pannier LGI2P/EMA­EERIE, Parc Scientifique Georges Besse, F­30000 Nimes, France.
Simulated Annealing and Tabu Search for Constraint Solving.

Short abstract.
Toshihide Ibaraki, Department of Applied Mathematics and Physics, Graduate School of Engineering, Kyoto University, Kyoto 606, Japan, Alexander Kogan, Faculty of Management and RUTCOR, Rutgers University, New Jersey, and Kazuhisa Makino, Department of Systems and Human Science, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka 560, Japan.
Functional Dependencies in Horn Theories.

Short abstract.
Gabriel Istrate, and Mitsunori Ogihara, Department of Computer Science, University of Rochester, Rochester, NY 14627.
The phase transition in random Horn satisfiability (Revised version: March 25, 1998).

Short abstract.
Peter Jeavons, and David Cohen, Department of Computer Science, Royal Holloway, University of London, UK, and Justin Pearson Department of Information Technology Mid Sweden University, S­851 70 Sundsvall, Sweden.
Constraints and Universal Algebra.

Short abstract.
Claire Kenyon, LRI, Universite de Paris-Sud, France, and Hélène Paugam-Moisy, LIP, Ecole Normale Superieure de Lyon, France.
Multilayer neural nerworks and polyhedral dichotomies.

Short abstract.
Richard Krajcoviech, and Margareta Kotocova, Slovak University of Technology, Ilkovicova 3, 812 19 Bratislava, Slovak Republic.
Gains from Concurrenting of the Constraint Solving.

Short abstract.
Mark Last, and Oded Maimon, Department of Industrial Engineering, Tel-Aviv University, Tel-Aviv 69978, Israel.
An Information-Theoretic Approach to Data Mining.

Short abstract.
Joerg C. Lemm, Institut fuer Theoretische Physik I, Wilhelm-Klemm Str.9, D-48149 Muenster, Germany.
Nonlinear Regularization.

Short abstract.
Xiaodong Li, School of Environmental and Information Sciences, Charles Sturt University, Albury, NSW 2640, Australia, and Martin Purvis Computer and Information Science, University of Otago Dunedin, New Zealand.
Computational Learning by an Optical Thin­Film Model .

Short abstract.
Wolfgang Maass, and Michael Schmitt, Institute for Theoretical Computer Science, Technische Universität Graz, Klosterwiesgasse 32/2, A--8010 Graz, Austria.
On the Complexity of Computing and Learning with Networks of Spiking Neurons.

Short abstract.
Larry Manevitz, and Dan Givoli, Department of Computer Science, University of Haifa, Israel.
Automating the Finite Element Method: a Test Bed for Soft Computing Methods.

Short abstract.
D. Morgan Mangeas, National Research Institute on Transport and Security, France.
Forecasting electricity demand using gated neural networks and statistical pruning.

Short abstract.
Eddy Mayoraz IDIAP, Switzerland.
On the computational complexity of recognizing regions classifiable by a 2-layer perceptron.

Short abstract.
Erica Melis, Universität des Saarlandes, Fachbereich Informatik,  D-66041 Saarbrücken, Germany.
Planning and Presenting Construction Proofs.

Short abstract.
José Meseguer, Computer Science Laboratory, SRI International, Menlo Park, CA 94025.
Formal Interoperability.

Short abstract.
Bernard Moulin, and Driss Kettani, Computer Science Department, Pouliot Building, and Research Center of Geomatics, Casault Building, Laval University, Ste Foy (QC) G1K 7P4, Canada.
Combining a logical and an analogical framework for route generation and description.

Short abstract.
Fumiaki Kamiya Okushi, University of California at Santa Cruz.
Parallel Cooperative Propositional Theorem Proving.

Short abstract.
Robert Rodosek, IC-Park, Imperial College, London SW7 2AZ, England.
Generation and comparison of decision strategies for solving satisfiability problems.

Short abstract.
Joao Marques Silva, Cadence European Laboratories, IST/INESC, R. Alves Redol, 9, 1, 1000 Lisboa, Portugal.
An Overview of Backtrack Search Satisfiability Algorithms.

Short abstract.
Yoram Singer, AT&T Labs, Room A277, 180 Park Avenue, Florham Park, NJ 07932.
Switching Portfolios.

Short abstract.
Israel A. Wagner, IBM Haifa Research Lab, Haifa, Israel, and Michael Lindenbaum, and Alfred M. Bruckstein, Technion, Haifa, Israel.
Efficient Graph Search by a Smell-Oriented Vertex Process.

Short abstract.
Manfred Warmuth and Arun Jagota Department of Computer Science, University of California at Santa Cruz.
Continuous And Discrete-Time Nonlinear Gradient Descent Relative Loss Bounds and Convergence.

Short abstract.
Janusz Wnek, and Robert Price, Science Applications International Corporation, 1953 Gallows Road, Vienna, VA 22182.
An Automated Conversion of Documents Containing Math into SGML.

Short abstract.