Decision network semantics of branching constraint satisfaction problems

被引：0
|
作者：
Brown, K [1 ]
Lucas, P
Fowler, D
机构：
[1] Natl Univ Ireland Univ Coll Cork, Cork Constraint Computat Ctr, Dept Comp Sci, Cork, Ireland
[2] Univ Nijmegen, Inst Comp & Informat Sci, NL-6525 ED Nijmegen, Netherlands
[3] Univ Aberdeen, Dept Comp Sci, Aberdeen AB24 3EU, Scotland
来源：
SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, PROCEEDING | 2003年 / 2711卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Branching Constraint Satisfaction Problems (BCSPs) have been introduced to model dynamic resource allocation subject to constraints and uncertainty. We give BCSPs a formal probability semantics by showing how they can be mapped to a certain class of Bayesian decision networks. This allows us to describe logical and probabilistic constraints in a uniform fashion. We also discuss extensions to BCSPs and decision networks suggested by the relationship between the two formalisms.
引用
收藏
页码：230 / 242
页数：13
相关论文
共 50 条
  • [1] Branching Constraint Satisfaction Problems and Markov Decision Problems Compared
    David W. Fowler
    Kenneth N. Brown
    Annals of Operations Research, 2003, 118 : 85 - 100
  • [2] Branching constraint satisfaction problems and Markov decision problems compared
    Fowler, DW
    Brown, KN
    ANNALS OF OPERATIONS RESEARCH, 2003, 118 (1-4) : 85 - 100
  • [3] Adaptive Branching for Constraint Satisfaction Problems
    Balafoutis, Thanasis
    Stergiou, Kostas
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 855 - 860
  • [4] Lazy Branching for Constraint Satisfaction
    Mehta, Deepak
    O'Sullivan, Barry
    Kotthoff, Lars
    Malitsky, Yuri
    2013 IEEE 25TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2013, : 1012 - 1019
  • [5] Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems
    Pesant, Gilles
    Quimper, Claude-Guy
    Zanarini, Alessandro
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2012, 43 : 173 - 210
  • [6] Branching Schemes and Variable Ordering Heuristics for Constraint Satisfaction Problems: Is There Something to Learn?
    Ortiz-Bayliss, Jose Carlos
    Terashima-Marin, Hugo
    Enrique Conant-Pablos, Santiago
    NATURE INSPIRED COOPERATIVE STRATEGIES FOR OPTIMIZATION (NICSO 2013), 2014, 512 : 329 - +
  • [7] Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems
    Loeffler, Sven
    Liu, Ke
    Hofstedt, Petra
    PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE (ICAART), VOL 2, 2019, : 755 - 761
  • [8] NETWORK-BASED HEURISTICS FOR CONSTRAINT-SATISFACTION PROBLEMS
    DECHTER, R
    PEARL, J
    ARTIFICIAL INTELLIGENCE, 1987, 34 (01) : 1 - 38
  • [9] Temporal Constraint Satisfaction Problems and Difference Decision Diagrams: a Compilation Map
    Fargier, Helene
    Maris, Frederic
    Roger, Vincent
    2015 IEEE 27TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2015), 2015, : 429 - 436
  • [10] Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge
    Fargier, H
    Lang, J
    Schiex, T
    PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, 1996, : 175 - 180
12345