The P-Box CDF-Intervals: A Reliable Constraint Reasoning with Quantifiable Information

DOI10.1017/S1471068414000143zbMath1307.68021arXiv1405.2801OpenAlexW2135774324MaRDI QIDQ2931255

Thom Frühwirth, Carmen Gervet, Aya Saad

Publication date: 25 November 2014

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.2801

zbMATH Keywords

uncertaintyconstraint satisfaction problemconstraint programmingprobability boxconvex structuresconstraint reasoningcdf intervalreliable constraint reasoning

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Cites Work

• A single-period inventory model with fuzzy random variable demand
• Stochastic constraint programming: A scenario-based approach
• Computing the distribution of the product of two continuous random variables
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Applying interval arithmetic to real, integer, and boolean constraints

This page was built for publication: The P-Box CDF-Intervals: A Reliable Constraint Reasoning with Quantifiable Information