unit 11 binary decision diagrams bdds
play

Unit-11: Binary Decision Diagrams (BDDs) B. Srivathsan Chennai - PowerPoint PPT Presentation

Nov 24, 2023 •25 likes •835 views

Unit-11: Binary Decision Diagrams (BDDs) B. Srivathsan Chennai Mathematical Institute NPTEL-course July - November 2015 1 / 24 Module 1: Introduction to BDDs 2 / 24 Model-checking Transition Systems + Properties + NuSMV State-space Bchi

  1. Unit-11: Binary Decision Diagrams (BDDs) B. Srivathsan Chennai Mathematical Institute NPTEL-course July - November 2015 1 / 24

  2. Module 1: Introduction to BDDs 2 / 24

  3. Model-checking Transition Systems + Properties + NuSMV State-space Büchi LTL CTL Automata Automata explosion properties properties Unit: 4 Unit: 5,6 Unit: 7,8 Unit: 9 Unit: 10 3 / 24

  4. In this unit: An efficient data structure for representing transition systems ◮ Module 1: Introduction to the data structure: Binary Decision Diagrams (BDDs) ◮ Module 2: Operations on BDDs ◮ Module 3: Using BDDs in the model-checking process 4 / 24

  5. In this unit: An efficient data structure for representing transition systems ◮ Module 1: Introduction to the data structure: Binary Decision Diagrams (BDDs) ◮ Module 2: Operations on BDDs ◮ Module 3: Using BDDs in the model-checking process Reference: Logic in Computer Science, 2 nd edition, by Huth and Ryan , Section 6.1 - 6.3 4 / 24

  6. Boolean functions 5 / 24

  7. x , y : Boolean variables 6 / 24

  8. x , y : Boolean variables f ( x , y ) = x + y Boolean function 6 / 24

  9. x , y : Boolean variables f ( x , y ) = x + y Boolean function 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 1 6 / 24

  10. x , y : Boolean variables f ( x , y ) = x + y Boolean function 0 + 0 = 0 Logical OR 0 + 1 = 1 1 + 0 = 1 1 + 1 = 1 6 / 24

  11. x , y : Boolean variables f ( x , y ) = x + y Boolean function 0 + 0 = 0 Logical OR 0 + 1 = 1 1 + 0 = 1 1 + 1 = 1 y x f ( x , y ) 0 0 0 0 1 1 Truth table 1 0 1 1 1 1 6 / 24

  12. x , y : Boolean variables 7 / 24

  13. x , y : Boolean variables f ( x , y ) = x · y Boolean function 7 / 24

  14. x , y : Boolean variables f ( x , y ) = x · y Boolean function 0 · 0 = 0 0 · 1 = 0 1 · 0 = 0 1 · 1 = 1 7 / 24

  15. x , y : Boolean variables f ( x , y ) = x · y Boolean function 0 · 0 = 0 Logical AND 0 · 1 = 0 1 · 0 = 0 1 · 1 = 1 7 / 24

  16. x , y : Boolean variables f ( x , y ) = x · y Boolean function 0 · 0 = 0 Logical AND 0 · 1 = 0 1 · 0 = 0 1 · 1 = 1 y x f ( x , y ) 0 0 0 0 1 0 Truth table 1 0 0 1 1 1 7 / 24

  17. x : Boolean variable 8 / 24

  18. x : Boolean variable f ( x ) = x Boolean function 8 / 24

  19. x : Boolean variable f ( x ) = x Boolean function 0 = 1 1 = 0 8 / 24

  20. x : Boolean variable f ( x ) = x Boolean function 0 = 1 Logical NOT 1 = 0 8 / 24

  21. x : Boolean variable f ( x ) = x Boolean function 0 = 1 Logical NOT 1 = 0 x f ( x ) 0 1 Truth table 1 0 8 / 24

  22. x 1 , x 2 ,..., x n : Boolean variables f : { x 1 , x 2 ,..., x n } �→ { 0,1 } Boolean function · Boolean operations + 9 / 24

  23. x 1 , x 2 ,..., x n : Boolean variables f : { x 1 , x 2 ,..., x n } �→ { 0,1 } Boolean function · Boolean operations + Examples: f 1 ( x , y ) = x + y , f 2 ( x , y , z ) = x · y + y · z , f 3 ( x , y , z ) = x + y · z 9 / 24

  24. Representing boolean functions 10 / 24

  25. f ( x , y , z ) = x · y + y · z y x z f 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1 Truth table 11 / 24

  26. f ( x , y , z ) = x · y + y · z y x z f x 0 0 0 0 0 0 1 1 y y 0 1 0 0 0 1 1 0 z z z z 1 0 0 0 1 0 1 1 1 1 0 1 0 1 0 0 0 1 1 1 1 1 1 1 Truth table 11 / 24

  27. f ( x , y , z ) = x · y + y · z y x z f x 0 0 0 0 0 0 1 1 y y 0 1 0 0 0 1 1 0 z z z z 1 0 0 0 1 0 1 1 1 1 0 1 0 1 0 0 0 1 1 1 1 1 1 1 Binary Decision Tree Truth table 11 / 24

  28. Operations on truth tables 12 / 24

  29. g ( x , y , z ) = f ( x , y , z ) = x · y + y · z y x z f 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1 13 / 24

  30. g ( x , y , z ) = f ( x , y , z ) = x · y + y · z y y g x z f x z 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 0 1 0 0 1 1 0 0 1 1 1 0 0 0 1 0 0 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 13 / 24

  31. g ( x , y , z ) = f ( x , y , z ) = x · y + y · z y y g x z f x z 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 0 1 0 0 0 1 0 0 1 1 0 0 1 1 1 0 0 0 1 0 0 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 13 / 24

  32. g ( x , y , z ) = f ( x , y , z ) = x · y + y · z y y g x z f x z 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 1 0 0 1 1 0 0 1 1 1 0 0 0 1 0 0 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 13 / 24

  33. g ( x , y , z ) = f ( x , y , z ) = x · y + y · z y y g x z f x z 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 0 0 0 1 0 0 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 13 / 24

  34. g ( x , y , z ) = f ( x , y , z ) = x · y + y · z y y g x z f x z 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 13 / 24

  35. g ( x , y , z ) = f ( x , y , z ) = x · y + y · z y y g x z f x z 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 13 / 24

  36. g ( x , y , z ) = f ( x , y , z ) = x · y + y · z y y g x z f x z 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 1 1 0 1 0 1 1 0 1 1 1 0 1 1 1 1 1 1 1 13 / 24

  37. g ( x , y , z ) = f ( x , y , z ) = x · y + y · z y y g x z f x z 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 1 1 0 1 0 1 1 0 1 1 1 0 0 1 1 1 1 1 1 1 13 / 24

  38. g ( x , y , z ) = f ( x , y , z ) = x · y + y · z y y g x z f x z 0 0 0 0 0 0 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 0 0 1 0 0 1 1 0 1 1 1 0 1 0 1 1 0 1 1 1 0 0 1 1 1 1 1 1 1 0 13 / 24

  39. y x z f f ( x , y , z ) = x · y + y · z 0 0 0 0 0 0 1 1 g ( x , y , z ) = x · y 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1 y g x z 0 0 0 1 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 0 14 / 24

  40. y x z f f ( x , y , z ) = x · y + y · z 0 0 0 0 0 0 1 1 g ( x , y , z ) = x · y 0 1 0 0 0 1 1 0 h ( x , y , z ) = f ( x , y , z ) + g ( x , y , z ) 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1 y g x z 0 0 0 1 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 0 14 / 24

  41. y x z f f ( x , y , z ) = x · y + y · z 0 0 0 0 0 0 1 1 g ( x , y , z ) = x · y 0 1 0 0 0 1 1 0 h ( x , y , z ) = f ( x , y , z ) + g ( x , y , z ) 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1 y x z 0 0 0 0 0 1 0 1 0 y g x z 0 1 1 0 0 0 1 1 0 0 0 0 1 1 1 0 1 0 1 0 0 1 1 0 0 1 1 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 0 14 / 24

  42. y x z f f ( x , y , z ) = x · y + y · z 0 0 0 0 0 0 1 1 g ( x , y , z ) = x · y 0 1 0 0 0 1 1 0 h ( x , y , z ) = f ( x , y , z ) + g ( x , y , z ) 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1 y x z h 0 0 0 0 0 1 0 1 0 y g x z 0 1 1 0 0 0 1 1 0 0 0 0 1 1 1 0 1 0 1 0 0 1 1 0 0 1 1 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 0 14 / 24

  43. y x z f f ( x , y , z ) = x · y + y · z 0 0 0 0 0 0 1 1 g ( x , y , z ) = x · y 0 1 0 0 0 1 1 0 h ( x , y , z ) = f ( x , y , z ) + g ( x , y , z ) 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1 y x z h 0 0 0 1 0 0 1 0 1 0 y g x z 0 1 1 0 0 0 1 1 0 0 0 0 1 1 1 0 1 0 1 0 0 1 1 0 0 1 1 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 0 14 / 24

  44. y x z f f ( x , y , z ) = x · y + y · z 0 0 0 0 0 0 1 1 g ( x , y , z ) = x · y 0 1 0 0 0 1 1 0 h ( x , y , z ) = f ( x , y , z ) + g ( x , y , z ) 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1 y x z h 0 0 0 1 0 0 1 1 0 1 0 y g x z 0 1 1 0 0 0 1 1 0 0 0 0 1 1 1 0 1 0 1 0 0 1 1 0 0 1 1 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 0 14 / 24

  45. y x z f f ( x , y , z ) = x · y + y · z 0 0 0 0 0 0 1 1 g ( x , y , z ) = x · y 0 1 0 0 0 1 1 0 h ( x , y , z ) = f ( x , y , z ) + g ( x , y , z ) 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1 y x z h 0 0 0 1 0 0 1 1 0 1 0 0 y g x z 0 1 1 0 0 0 1 1 0 0 0 0 1 1 1 0 1 0 1 0 0 1 1 0 0 1 1 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 0 14 / 24

  46. y x z f f ( x , y , z ) = x · y + y · z 0 0 0 0 0 0 1 1 g ( x , y , z ) = x · y 0 1 0 0 0 1 1 0 h ( x , y , z ) = f ( x , y , z ) + g ( x , y , z ) 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1 y x z h 0 0 0 1 0 0 1 1 0 1 0 0 y g x z 0 1 1 0 0 0 0 1 1 0 0 0 0 1 1 1 0 1 0 1 0 0 1 1 0 0 1 1 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 0 14 / 24

Recommend

Formal Verifjcation Lecture 8: Operations on Binary Decision Diagrams (BDDs) Jacques Fleuriot

Formal Verifjcation Lecture 8: Operations on Binary Decision Diagrams (BDDs) Jacques Fleuriot

Formal Verifjcation Lecture 8: Operations on Binary Decision Diagrams (BDDs) Jacques Fleuriot jdf@inf..ac.uk Diagrams from Huth & Ryan, LiCS, 2nd Ed. Recap reduce , apply , restrict , exists Previously: (Reduced, Ordered) Binary

567 views • 33 slides
Formal Verifjcation Lecture 7: Introduction to Binary Decision Diagrams (BDDs) Jacques Fleuriot

Formal Verifjcation Lecture 7: Introduction to Binary Decision Diagrams (BDDs) Jacques Fleuriot

Formal Verifjcation Lecture 7: Introduction to Binary Decision Diagrams (BDDs) Jacques Fleuriot jdf@inf.ac.uk Diagrams from Huth & Ryan, 2nd Ed. Recap Previously: CTL and LTL Model Checking algorithms Tiis time: Binary

232 views • 21 slides
Binary decision diagrams (BDDs) Compact representation of a logic function ROBDDs

Binary decision diagrams (BDDs) Compact representation of a logic function ROBDDs

Binary decision diagrams (BDDs) Compact representation of a logic function ROBDDs (reduced ordered BDDs) are a canonical representation: equivalence of ROBDDs implies that the functions are identical Example: f = abc +

161 views • 4 slides
Planning and Optimization B7. Symbolic Search: Binary Decision Diagrams Malte Helmert and Thomas

Planning and Optimization B7. Symbolic Search: Binary Decision Diagrams Malte Helmert and Thomas

Planning and Optimization B7. Symbolic Search: Binary Decision Diagrams Malte Helmert and Thomas Keller Universit at Basel October 14, 2019 Motivation Data Structures for State Sets Binary Decision Diagrams BDDs as Canonical

750 views • 36 slides
Planning and Optimization E1. Symbolic Search: BDDs Malte Helmert and Gabriele R oger

Planning and Optimization E1. Symbolic Search: BDDs Malte Helmert and Gabriele R oger

Planning and Optimization E1. Symbolic Search: BDDs Malte Helmert and Gabriele R oger Universit at Basel December 15, 2016 Motivation Binary Decision Diagrams BDD Implementation Summary Motivation Motivation Binary Decision Diagrams

930 views • 45 slides
2 Binary Decision Diagrams 2. Binary Decision Diagrams Verification Technology Content 2.1 BDD

2 Binary Decision Diagrams 2. Binary Decision Diagrams Verification Technology Content 2.1 BDD

Fachgebiet Rechnersysteme 2. Binary Decision Diagrams 1 2 Binary Decision Diagrams 2. Binary Decision Diagrams Verification Technology Content 2.1 BDD concepts 2 2 Variable orderings 2.2 Variable orderings 2.3 OBDD algorithms 2 4 FDDs

1.76k views • 165 slides
ECE 3060 VLSI and Advanced Digital Design Lecture 11 Binary Decision Diagrams Outline

ECE 3060 VLSI and Advanced Digital Design Lecture 11 Binary Decision Diagrams Outline

ECE 3060 VLSI and Advanced Digital Design Lecture 11 Binary Decision Diagrams Outline Binary Decision Diagrams (BDDs) Ordered (OBDDs) and Reduced Ordered (ROBDDs) Tautology check Containment check ECE 3060 Lecture 112

213 views • 18 slides
Semantics and Verification 2005 Lecture 13 boolean expressions and normal forms binary decision

Semantics and Verification 2005 Lecture 13 boolean expressions and normal forms binary decision

Boolean Logic Binary Decision Diagrams Algorithms on ROBDDs Semantics and Verification 2005 Lecture 13 boolean expressions and normal forms binary decision diagrams (BDDs) algorithms on BDDs Lecture 13 Semantics and Verification 2005

484 views • 24 slides
Using Binary Decision Diagrams to Enumerate Inductive Logic Programming Solutions 1 Key

Using Binary Decision Diagrams to Enumerate Inductive Logic Programming Solutions 1 Key

Hikaru Shindo*, Masaaki Nishino**, Akihiro Yamamoto* September 4, 2018 * Graduate School of Informatics, Kyoto University ** NTT Communication Science Laboratories Using Binary Decision Diagrams to Enumerate Inductive Logic Programming

438 views • 27 slides
1 Mux Representation of Boolean Functions MUX circuit to implement logic 1 0 x1 x2 x3

1 Mux Representation of Boolean Functions MUX circuit to implement logic 1 0 x1 x2 x3

ECE 474A/57A Computer-Aided Logic Design Lecture 11 Binary Decision Diagrams (BDDs) ECE 474a/575a 1 of 31 Susan Lysecky Boolean Logic Functions Representations Function can be represented in different ways Truth table, equation, K-map,

457 views • 12 slides
Binary Decision Diagrams INF5140 1 Motivation Fig 1. Polynomial representation Boolean

Binary Decision Diagrams INF5140 1 Motivation Fig 1. Polynomial representation Boolean

Binary Decision Diagrams INF5140 1 Motivation Fig 1. Polynomial representation Boolean functions Extremely useful Some areas of application: Cryptography Propositional logic Verification/model checking Fig

322 views • 16 slides
Symbolic Model Checking Binary Decision Diagrams 2 Combinatorial Circuits 3 Eight Queen

Symbolic Model Checking Binary Decision Diagrams 2 Combinatorial Circuits 3 Eight Queen

1 Randal Bryant 86 Ken McMillan 90 Symbolic Model Checking Binary Decision Diagrams 2 Combinatorial Circuits 3 Eight Queen Combinatorial Problems Sudoku Control Programs A Train Simulator, visualSTATE (VVS) 1421 machines 11102

993 views • 71 slides
Binary Decision Diagrams Hao Zheng Department of Computer Science and Engineering University of

Binary Decision Diagrams Hao Zheng Department of Computer Science and Engineering University of

Binary Decision Diagrams Hao Zheng Department of Computer Science and Engineering University of South Florida Tampa, FL 33620 Email: zheng@cse.usf.edu Phone: (813)974-4757 Fax: (813)974-5456 Hao Zheng (CSE, USF) Comp Sys Verification 1 /

851 views • 47 slides
Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams Martin Jon a s Jan

Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams Martin Jon a s Jan

Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams Martin Jon a s Jan Strej cek Masaryk University, Brno, Czech Republic Brussels September 7, 2016 1 / 13 Quantified bit-vector formulas x 32 y 32 ( y

208 views • 20 slides
Redundancy-free Residual Dispatch Using Ordered Binary Decision Diagrams for Efficient Dispatch

Redundancy-free Residual Dispatch Using Ordered Binary Decision Diagrams for Efficient Dispatch

Formula-based Dispatch BDD-based Dispatch Assessment Redundancy-free Residual Dispatch Using Ordered Binary Decision Diagrams for Efficient Dispatch Andreas Sewe Christoph Bockisch Mira Mezini Seventh International Workshop on Foundations

408 views • 39 slides
Ordered Binary Decision Diagrams Altin Qeriqi, altinq@ifi.uio.no University of Oslo 2015 2 / 21

Ordered Binary Decision Diagrams Altin Qeriqi, altinq@ifi.uio.no University of Oslo 2015 2 / 21

1 / 21 Ordered Binary Decision Diagrams Altin Qeriqi, altinq@ifi.uio.no University of Oslo 2015 2 / 21 Problem with CTL In CTL, each state has an explicit representation by the predecessor and successor list. State space can be too big

1.28k views • 21 slides
- proof equivalence is Logspace-complete, MALL via binary decision diagrams TLCA 2015 , Warszawa,

- proof equivalence is Logspace-complete, MALL via binary decision diagrams TLCA 2015 , Warszawa,

- proof equivalence is Logspace-complete, MALL via binary decision diagrams TLCA 2015 , Warszawa, Polska M arc B agnol University of Ottawa Rule permutations and the equivalence problem Permutations: in sequent calculus presentation of a

468 views • 10 slides
Reduced Ordered Binary Decision Diagrams Lecture #13 of Advanced Model Checking Joost-Pieter

Reduced Ordered Binary Decision Diagrams Lecture #13 of Advanced Model Checking Joost-Pieter

Reduced Ordered Binary Decision Diagrams Lecture #13 of Advanced Model Checking Joost-Pieter Katoen Lehrstuhl 2: Software Modeling & Verification E-mail: katoen@cs.rwth-aachen.de June 16, 2014 c JPK Advanced model checking Basic

797 views • 40 slides
EM over Binary Decision Diagrams for Probabilistic Logic Programs Elena Bellodi Fabrizio Riguzzi

EM over Binary Decision Diagrams for Probabilistic Logic Programs Elena Bellodi Fabrizio Riguzzi

EM over Binary Decision Diagrams for Probabilistic Logic Programs Elena Bellodi Fabrizio Riguzzi ENDIF University of Ferrara, Italy elena.bellodi@unife.it, fabrizio.riguzzi@unife.it Bellodi, Riguzzi (University of Ferrara) EMBLEM 1 / 20

487 views • 20 slides
Formal Specification and Verification 10.05.2012 Viorica Sofronie-Stokkermans e-mail:

Formal Specification and Verification 10.05.2012 Viorica Sofronie-Stokkermans e-mail:

Formal Specification and Verification 10.05.2012 Viorica Sofronie-Stokkermans e-mail: sofronie@uni-koblenz.de 1 Binary Decision Diagrams Formulae Boolean functions f F : { 0, 1 } n { 0, 1 } F ( n Prop.Var) Binary decision

405 views • 39 slides
Data Representation and Efficient Solution: A Decision Diagram Approach Gianfranco Ciardo

Data Representation and Efficient Solution: A Decision Diagram Approach Gianfranco Ciardo

Data Representation and Efficient Solution: A Decision Diagram Approach Gianfranco Ciardo University of California, Riverside PART: FILE: . 2 Decision diagrams: a static view PART: FILE:BDD/binary-decision-diagramsMOD.tex (Reduced

1.14k views • 96 slides
1 Baysian networks for decision analysis The TV show problem as a BN Problems More than

1 Baysian networks for decision analysis The TV show problem as a BN Problems More than

Several names Decision graphs Decision trees Influence diagrams Decision graphs I A certain kind of strictly symmetric decision trees Decisions and utilities No forgetting assumption LIMIDs Limited Memory

596 views • 6 slides
1 Baysian networks for decision analysis The TV show problem as a BN Problems Choice 1

1 Baysian networks for decision analysis The TV show problem as a BN Problems Choice 1

Several names Decision graphs Decision trees Influence diagrams Decision graphs I A certain kind of strictly symmetric decision trees Decisions and utilities No forgetting assumption LIMIDs Limited Memory

185 views • 6 slides
CS 188: Artificial Intelligence Lecture 19: Decision Diagrams Pieter Abbeel --- UC Berkeley Many

CS 188: Artificial Intelligence Lecture 19: Decision Diagrams Pieter Abbeel --- UC Berkeley Many

CS 188: Artificial Intelligence Lecture 19: Decision Diagrams Pieter Abbeel --- UC Berkeley Many slides over this course adapted from Dan Klein, Stuart Russell, Andrew Moore Decision Networks MEU: choose the action which maximizes the

469 views • 8 slides

More recommend