Decision network semantics of branching constraint satisfaction problems

K. Brown; P. Lucas; D. Fowler

doi:10.1007/978-3-540-45062-7_19

Decision network semantics of branching constraint satisfaction problems

K. Brown
, P. Lucas
, D. Fowler

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	230-242
Number of pages	13
Journal	Lecture Notes in Computer Science
Volume	2711
DOIs	https://doi.org/10.1007/978-3-540-45062-7_19
Publication status	Published - 2003
Event	7th European Conference, ECSQARU 2003 - Aalborg, Denmark Duration: 2 Jul 2003 → 5 Jul 2003

Access to Document

10.1007/978-3-540-45062-7_19

Cite this

@article{eff0f55bf30d4afdb33979582267a85d,

title = "Decision network semantics of branching constraint satisfaction problems",

abstract = "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.",

author = "K. Brown and P. Lucas and D. Fowler",

year = "2003",

doi = "10.1007/978-3-540-45062-7\_19",

language = "English",

volume = "2711",

pages = "230--242",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "7th European Conference, ECSQARU 2003 ; Conference date: 02-07-2003 Through 05-07-2003",

}

TY - JOUR

T1 - Decision network semantics of branching constraint satisfaction problems

AU - Brown, K.

AU - Lucas, P.

AU - Fowler, D.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/8344276736

U2 - 10.1007/978-3-540-45062-7_19

DO - 10.1007/978-3-540-45062-7_19

M3 - Article

AN - SCOPUS:8344276736

SN - 0302-9743

VL - 2711

SP - 230

EP - 242

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 7th European Conference, ECSQARU 2003

Y2 - 2 July 2003 through 5 July 2003

ER -

Decision network semantics of branching constraint satisfaction problems

Abstract

Access to Document

Other files and links

Fingerprint

Cite this