Committee login






Small thumbnail

Secure Connected Objects

Small thumbnail

Banach, Fréchet, Hilbert and Neumann Spaces

Analysis for PDEs Set – Volume 1

Small thumbnail

Semi-Markov Migration Models for Credit Risk

Stochastic Models for Insurance Set – Volume 1

Small thumbnail

Human Exposure to Electromagnetic Fields

From Extremely Low Frequency (ELF) to Radio Frequency

Small thumbnail

Enterprise Interoperability


Small thumbnail

Data Treatment in Environmental Sciences

Multivaried Approach

Small thumbnail

From Pinch Methodology to Pinch-Exergy Integration of Flexible Systems

Thermodynamics – Energy, Environment, Economy Set

Small thumbnail

Exterior Algebras

Elementary Tribute to Grassmann's Ideas

Small thumbnail

Nonlinear Theory of Elastic Plates

Small thumbnail

Cognitive Approach to Natural Language Processing

Small thumbnail

Sequential Decision-making Problems

Representation and Solution

Céric Pralet, ONERA, France Gérard Verfaillie, ONERA, France Thomas Schiex, INRA Toulouse, France

ISBN: 9781848211742

Publication Date: November 2009   Hardback   352 pp.

165.00 USD

Add to cart




Numerous formalisms have been designed to model and solve decision-making problems. Some formalisms, such as constraint networks, can express “simple” decision problems, while others take into account uncertainties (probabilities, possibilities...), unfeasible decisions, and utilities (additive or not).
In the first part of this book, we introduce a generic algebraic framework that encompasses and unifies a large number of such formalisms. This formalism, called the Plausibility–Feasibility–Utility (PFU) framework, is based on algebraic structures, graphical models, and sequences of quantifications. This work on knowledge representation is completed by a work on algorithms for answering queries formulated in the PFU framework. The algorithms defined are based on variable elimination or tree search, and work on a new generic architecture for local computations called multi-operator cluster DAGs.


Part I. Representing Decision-Making Problems in the PFU Framework
1. Background Notation and Definitions.
2. A Guided Tour of Frameworks for Decision Making.
3. A Generic Algebraic Structure for Sequential Decision Making under Uncertainty.
4. Plausibility–Feasibility–Utility Networks.
5. Queries on a PFU Network.
Part II. Generic Algorithms for Answering PFU Queries
6. First Generic Algorithms.
7. Structuring Multi-operator Queries.
8. A Generic Structured Tree Search on the MCDAG Architecture.
9. A Generic Solver for Answering PFU Queries.
10. Conclusion.

About the Authors

Cédric Pralet, a graduate from a French engineering school with a PhD in Computer Sciences, is now working as a research engineer at ONERA (French Aerospace Lab).
Thomas Schiex is working at INRA (French Institute for Agronomical Research) on algorithms for constraint networks and graphical models, and their applications in computational biology.
Gérard Verfaillie's research activity at ONERA is related to models, methods, and tools for combinatorial optimization and constrained optimization, especially for planning and decision-making.


DownloadTable of Contents - PDF File - 81 Kb

Related Titles

0.08457 s.