{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:52:41Z","timestamp":1771703561183,"version":"3.50.1"},"reference-count":24,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T00:00:00Z","timestamp":1405900800000},"content-version":"unspecified","delay-in-days":20,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2014,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper introduces a new constraint domain for reasoning about data with uncertainty. It extends convex modeling with the notion of p-box to gain additional quantifiable information on the data whereabouts. Unlike existing approaches, the p-box envelops an unknown probability instead of approximating its representation. The p-box bounds are uniform cumulative distribution functions (<jats:italic>cdf<\/jats:italic>) in order to employ linear computations in the probabilistic domain. The reasoning by means of p-box <jats:italic>cdf<\/jats:italic>-intervals is an interval computation which is exerted on the real domain then it is projected onto the <jats:italic>cdf<\/jats:italic> domain. This operation conveys additional knowledge represented by the obtained probabilistic bounds. The empirical evaluation of our implementation shows that, with minimal overhead, the output solution set realizes a full enclosure of the data along with tighter bounds on its probabilistic distributions.<\/jats:p>","DOI":"10.1017\/s1471068414000143","type":"journal-article","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T07:52:50Z","timestamp":1405929170000},"page":"461-475","source":"Crossref","is-referenced-by-count":6,"title":["The P-Box CDF-Intervals: A Reliable Constraint Reasoning with Quantifiable Information"],"prefix":"10.1017","volume":"14","author":[{"given":"AYA","family":"SAAD","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"THOM","family":"FR\u00dcHWIRTH","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CARMEN","family":"GERVET","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,7,21]]},"reference":[{"key":"S1471068414000143_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(03)00182-8"},{"key":"S1471068414000143_ref7","unstructured":"ECRC. 1994. Eclipse (a) user manual, (b) extensions of the user manual. Tech. rep., ECRC."},{"key":"S1471068414000143_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55844-6_141"},{"key":"S1471068414000143_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2004.08.007"},{"key":"S1471068414000143_ref23","unstructured":"Walsh T. 2002. Stochastic constraint programming. Proceedings of the 15th Eureopean Conference on Artificial Intelligence, 111\u2013115."},{"key":"S1471068414000143_ref8","unstructured":"Fargier H. , Lang J. , and Schiex T. 1996. Mixed constraint satisfaction: A framework for decision problems under incomplete knowledge. In Proceedings of the National Conference on Artificial Intelligence. 175\u2013180."},{"key":"S1471068414000143_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0925-5273(96)00014-X"},{"key":"S1471068414000143_ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026441215081"},{"key":"S1471068414000143_ref14","doi-asserted-by":"publisher","DOI":"10.1145\/41625.41635"},{"key":"S1471068414000143_ref2","first-page":"1","volume-title":"Proceedings of the 2002 ACM symposium on Applied computing","author":"Bistarelli","year":"2002"},{"key":"S1471068414000143_ref12","unstructured":"Halpern J. 2003. Reasoning about uncertainty."},{"key":"S1471068414000143_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(02)00234-7"},{"key":"S1471068414000143_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(96)00142-2"},{"key":"S1471068414000143_ref9","unstructured":"Ferson S. , Kreinovich V. , Ginzburg L. , Myers D. , and Sentz K. 2003. Constructing Probability Boxes and Dempster-Shafer structures, Sandia National Laboratories. Tech. rep., SANDD2002-4015."},{"key":"S1471068414000143_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-006-6849-7"},{"key":"S1471068414000143_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0024181"},{"key":"S1471068414000143_ref17","unstructured":"Saad A. , Gervet C. , and Abdennadher S. 2010. Constraint Reasoning with Uncertain Data Using CDF-Intervals. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 292\u2013306."},{"key":"S1471068414000143_ref11","unstructured":"Gum I. 1995. Guide to the expression of uncertainty in measurement. BIPM, IEC, IFCC, ISO, IUPAP, IUPAC, OIML."},{"key":"S1471068414000143_ref18","unstructured":"Saad A. , Gervet C. , and Fruehwirth T. 2012. CDF-Intervals Revisited. The Eleventh International Workshop on Constraint Modelling and Reformulation - ModRef2012."},{"key":"S1471068414000143_ref20","unstructured":"Smith W. and La Poutre H. 1992. Approximation of staircases by staircases. Tech. rep., 92-109-3-0058-8 NEC Research Institute Inc., New Jersey."},{"key":"S1471068414000143_ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1459010.1459013"},{"key":"S1471068414000143_ref19","unstructured":"Schiex T. , Fargier H. , and Verfaillie G. 1995. Valued constraint satisfaction problems: Hard and easy problems. In International Joint Conference on Artificial Intelligence. Vol. 14. 631\u2013639."},{"key":"S1471068414000143_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF00132735"},{"key":"S1471068414000143_ref4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1613\/jair.4126","article-title":"Robustness and stability in constraint programming under dynamism and uncertainty.","volume":"49","author":"Climent","year":"2014","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068414000143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T15:04:14Z","timestamp":1555945454000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068414000143\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":24,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["S1471068414000143"],"URL":"https:\/\/doi.org\/10.1017\/s1471068414000143","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7]]}}}