{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:12:03Z","timestamp":1759032723464},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,8]]},"abstract":"<jats:p>Our goal is to measure the likelihood of the satisfaction of numerical\nconstraints in the absence of prior information.  We study expressive\nconstraints, involving arithmetic and complex numerical functions, and\neven quantification over numbers. Such problems arise in processing\nincomplete data, or analyzing conditions in programs without a priori\nbounds on variables.  We show that for constraints on n variables,\nthe proper way to define such a measure is as the limit of the part of\nthe n-dimensional ball that consists of points satisfying the\nconstraints, when the radius increases. We prove that the existence of\nsuch a limit is closely related to the notion of o-minimality from\nmodel theory. Thus, for constraints definable with the usual\narithmetic and exponentiation, the likelihood is well defined, but\nadding trigonometric functions is problematic. We look at computing\nand approximating such likelihoods for order and linear\nconstraints, and prove an impossibility result for approximating with\nmultiplicative error. However, as the\nlikelihood is a number between 0 and 1, an approximation scheme with\nadditive error is acceptable, and we give it for arbitrary\nlinear constraints.<\/jats:p>","DOI":"10.24963\/ijcai.2019\/229","type":"proceedings-article","created":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T03:46:05Z","timestamp":1564285565000},"page":"1654-1660","source":"Crossref","is-referenced-by-count":2,"title":["Measuring the Likelihood of Numerical Constraints"],"prefix":"10.24963","author":[{"given":"Marco","family":"Console","sequence":"first","affiliation":[{"name":"School of Informatics, University of Edinburgh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Hofer","sequence":"additional","affiliation":[{"name":"School of Informatics, University of Edinburgh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid","family":"Libkin","sequence":"additional","affiliation":[{"name":"School of Informatics, University of Edinburgh"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"28","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2019","name":"Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}","start":{"date-parts":[[2019,8,10]]},"theme":"Artificial Intelligence","location":"Macao, China","end":{"date-parts":[[2019,8,16]]}},"container-title":["Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T03:47:43Z","timestamp":1564285663000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2019\/229"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2019\/229","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}