%0 Conference Paper %D 2005 %T Going far, logically %A Yaman,F. %A Nau, Dana S. %A V.S. Subrahmanian %X There are numerous applications where we need toensure that multiple moving objects are sufficiently far apart. Furthermore, in many moving object do- mains, there is positional indeterminacy — we are not 100% sure exactly when a given moving object will be at a given location. [Yaman et al., 2004] provided a logic of motion but did not provide algo- rithms to ensure that moving objects are kept suf- ficiently far apart. In this paper, we extend their logic to include a “far” predicate. We develop the CheckFar algorithm that checks if any given two objects will always be sufficiently far apart at dur- ing a time interval. We have run a set of experi- ments showing that our CheckFar algorithm scales very well. %V 19 %P 615 - 615 %8 2005/// %G eng %U http://www.cs.umd.edu/~nau/papers/yaman2005going.pdf