### Monday, July 13

## MS13

Applications of Interval Computations

2:00 PM-4:00 PM

*Room: Sidney Smith 1087*

It is often important to have guaranteed results from computation. Usually, exact values are impossible, so we must produce intervals that contain the desired values. Computations leading to such guaranteed intervals are called interval computations.

The speakers in this minisymposium will discuss applications to robotics, where we must guarantee that robots do not bump into things; quantum mechanics, where we want guaranteed predictions of atomic properties; computer graphics, where we want graphical features only if data dictates them; and expert systems, where we don't want to deviate from the expert opinion range.

**Organizers: Vladik Kreinovich and Scott A. Starks**

*NASA PACES Center, Pan-American Center for Earth and Environmental Studies, *

University of Texas, El Paso
**2:00 Interval-valued Epistemic (IVE) Fluents in Robotics and Animation**
- John Funge, Intel Corporation, Santa Clara, California
**2:30 Validated Geometric Primitives**
*Jon G. Rokne*, University of Calgary, Canada; and Helmut Ratschek, University of Düsseldorf, Germany
**3:00 Interval Computations in Quantum Mechanics**
*Luis A. Seco*, University of Toronto, Canada; and Charles L. Fefferman, Princeton University
**3:30 Sets Logics and Measures**
- I. Burhan Turksen, University of Toronto, Canada

LMH Created: 3/17/98; MMD Updated: 5/27/98