Description

Book Synopsis
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.

Sequential Decision-Making Problems:

    Product form

    £150.05

    Includes FREE delivery

    RRP £157.95 – you save £7.90 (5%)

    Order before 4pm today for delivery by Tue 28 Jul 2026.

    A Hardback by Cédric Pralet, Thomas Schiex, Gérard Verfaillie

    10 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Sequential Decision-Making Problems: by Cédric Pralet

      Publisher: ISTE Ltd and John Wiley & Sons Inc
      Publication Date: 06/11/2009
      ISBN13: 9781848211742, 978-1848211742
      ISBN10: 1848211740
      Also in:
      Operational research

      Description

      Book Synopsis
      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.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account