Probabilistic Continuous Constraint Satisfaction Problems

被引:3
|
作者
Carvalho, Elsa [1 ]
Cruz, Jorge [1 ]
Barahona, Pedro [1 ]
机构
[1] Univ Nova Lisboa, Ctr Inteligencia Artificial, P-1200 Lisbon, Portugal
关键词
D O I
10.1109/ICTAI.2008.75
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncertainty among the variables of the problem, thus only eliminating values that assuredly do not belong to any solution. However, to play safe, these intervals may be very wide and lead to poor propagation. In this paper we present a framework for probabilistic constraint solving that assumes that uncertain values are not all equally likely. Hence, in addition to initial intervals, a priori probability distributions (within these intervals) are defined and propagated through the constraints. This provides a posteriori conditional probabilities for the variables values, thus enabling the user to select the most likely scenarios.
引用
收藏
页码:155 / 162
页数:8
相关论文
共 50 条
  • [41] Structuring techniques for constraint satisfaction problems
    Weigel, R
    Faltings, BV
    IJCAI-97 - PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 1997, : 418 - 423
  • [42] Solving fuzzy constraint satisfaction problems
    Meseguer, P
    Larrosa, J
    PROCEEDINGS OF THE SIXTH IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS I - III, 1997, : 1233 - 1238
  • [43] Parameterized complexity of constraint satisfaction problems
    Dániel Marx
    computational complexity, 2005, 14 : 153 - 183
  • [44] On the tractability of smooth constraint satisfaction problems
    Kumar, TKS
    INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, 2005, 3524 : 304 - 319
  • [45] Tractability in constraint satisfaction problems: a survey
    Clément Carbonnel
    Martin C. Cooper
    Constraints, 2016, 21 : 115 - 144
  • [46] ROBUSTNESS IN DYNAMIC CONSTRAINT SATISFACTION PROBLEMS
    Climent, Laura
    Salido, Miguel A.
    Barber, Federico
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2012, 8 (04): : 2513 - 2532
  • [47] Argumentation Frameworks as Constraint Satisfaction Problems
    Amgoud, Leila
    Devred, Caroline
    SCALABLE UNCERTAINTY MANAGEMENT, 2011, 6929 : 110 - +
  • [48] Constraint satisfaction problems and finite algebras
    Bulatov, AA
    Krokhin, AA
    Jeavons, P
    AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 272 - 282
  • [49] Testing Assignments to Constraint Satisfaction Problems
    Chen, Hubie
    Valeriote, Matt
    Yoshida, Yuichi
    2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 525 - 534
  • [50] Discrete Temporal Constraint Satisfaction Problems
    Bodirsky, Manuel
    Martin, Barnaby
    Mottet, Antoine
    JOURNAL OF THE ACM, 2018, 65 (02)