Order of magnitude comparisons of distance

Research output: Contribution to journalArticle

Abstract

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 sets. We also prove that the first-order theory over such constraints is decidable.

Original languageEnglish (US)
Pages (from-to)1-38
Number of pages38
JournalJournal of Artificial Intelligence Research
Volume10
StatePublished - Jan 1999

Fingerprint

Polynomials

ASJC Scopus subject areas

  • Artificial Intelligence
  • Control and Systems Engineering

Cite this

Order of magnitude comparisons of distance. / Davis, Ernest.

In: Journal of Artificial Intelligence Research, Vol. 10, 01.1999, p. 1-38.

Research output: Contribution to journalArticle

@article{7b291a611f8d49c3bc7abd92f5b7d521,
title = "Order of magnitude comparisons of distance",
abstract = "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 sets. We also prove that the first-order theory over such constraints is decidable.",
author = "Ernest Davis",
year = "1999",
month = "1",
language = "English (US)",
volume = "10",
pages = "1--38",
journal = "Journal of Artificial Intelligence Research",
issn = "1076-9757",
publisher = "Morgan Kaufmann Publishers, Inc.",

}

TY - JOUR

T1 - Order of magnitude comparisons of distance

AU - Davis, Ernest

PY - 1999/1

Y1 - 1999/1

N2 - 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 sets. We also prove that the first-order theory over such constraints is decidable.

AB - 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 sets. We also prove that the first-order theory over such constraints is decidable.

UR - http://www.scopus.com/inward/record.url?scp=0033349023&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033349023&partnerID=8YFLogxK

M3 - Article

VL - 10

SP - 1

EP - 38

JO - Journal of Artificial Intelligence Research

JF - Journal of Artificial Intelligence Research

SN - 1076-9757

ER -