距离的大小比较顺序
Order of Magnitude Comparisons of Distance
摘要:
数量级推理-通过粗略比较数量的大小进行推理-通常被称为“信封后计算”,其含义是计算虽然近似但很快。本文展示了一类有趣的约束集的数量级推理是证明快速。具体来说,我们提出了一个多项式时间算法,可以解决一组形式的约束“点a和b比点c和d更接近。“我们证明,如果‘靠得更近’被解释为指的是尺度上的无限差异或指的是尺度上的有限差异,只要尺度上的差异大于约束集中的变量数,则可以应用该算法。我们还证明了在这样的约束下的一阶理论是可判定的。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。