Order of Magnitude Comparisons of Distance

Details Order of Magnitude Comparisons of Distance Order of Magnitude Comparisons of Distance

2011-05-27

arxiv.org/abs/1105.5448v1

Journal Of Artificial Intelligence Research, Volume 10, pages 1-38, 1999

Computer Science

Artificial Intelligence

Scientific paper

10.1613/jair.520

Order of magnitude reasoning - reasoning by rough comparisons of the sizes of quantities - is often called 'back of the envelope calculation', with the implication that the calculations are quick though approximate. This paper exhibits an interesting class of constraint sets in which order of magnitude reasoning is demonstrably fast. Specifically, we present a polynomial-time algorithm that can solve a set of constraints of the form 'Points a and b are much closer together than points c and d.' We prove that this algorithm can be applied if `much closer together' is interpreted either as referring to an infinite difference in scale or as referring to a finite difference in scale, as long as the difference in scale is greater than the number of variables in the constraint set. We also prove that the first-order theory over such constraints is decidable.

Affiliated with

Also associated with

No associations

Rating

Order of Magnitude Comparisons of Distance does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Order of Magnitude Comparisons of Distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Order of Magnitude Comparisons of Distance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-664441