Reasoning with Deterministic and Probabilistic graphical models Class 2: Inference in Constraint Networks Rina Dechter
|
|
- Brett Cole
- 5 years ago
- Views:
Transcription
1 Reasoning with Deterministic and Probabilistic graphical models Class 2: Inference in Constraint Networks Rina Dechter
2 Road Map n Graphical models n Constraint networks Model n Inference n Search n Probabilistic Networks
3 Constraint Networks Example: map coloring Variables - countries (A,B,C,etc.) Values - colors (red, green, blue) Constraints: A B, A D, D E, etc. A Constraint graph A B red green red yellow green red green yellow yellow green yellow red A B C D G E F B A D E G F C
4 Constraint Satisfaction Tasks Example: map coloring Variables - countries (A,B,C,etc.) Values - colors (e.g., red, green, yellow) Constraints: A B, A D, D E, etc. Are the constraints consistent? Find a solution, find all solutions Count all solutions Find a good (optimal) solution
5 Constraint Network n A constraint network is: R=(X,D,C) n X variables n D domain n C constraints X = { X 1,..., X n } D = { D,..., Dn}, Di = { v1,... v C = { C 1,... C } n R expresses allowed tuples C = over ( S, Rscopes ) 1 k n A solution is an assignment to all variables that satisfies all constraints (join of all relations). n Tasks: consistency?, one or all solutions, counting, optimization i i i t }
6 Crossword puzzle n Variables: x1,, x13 n Domains: letters n Constraints: words from {HOSES, LASER, SHEET, SNAIL, STEER, ALSO, EARN, HIKE, IRON, SAME, EAT, LET, RUN, SUN, TEN, YES, BE, IT, NO, US}
7 The Queen problem The network has four variables, all with domains Di = {1, 2, 3, 4}. (a) The labeled chess board. (b) The constraints between variables.
8 Constraint s representations n Relation: allowed tuples n Algebraic expression: n Propositional formula: X 1 2 Y 3 1 Z 2 3 n Semantics: by a relation X 2 + Y 10, X Y ( a b) c
9 Partial solutions Not all consistent instantiations are part of a solution: (a) A consistent instantiation that is not part of a solution. (b) The placement of the queens corresponding to the solution (2, 4, 1, 3). (c) The placement of the queens corresponding to the solution (3, 1, 4, 2).
10 Constraint Graphs (primal) Queen problem
11 Constraint Graphs: Primal, Dual and Hypergraphs A (primal) constraint graph: a node per variable arcs connect constrained variables. A dual constraint graph: a node per constraint s scope, an arc connect nodes sharing variables =hypergraph
12 Graph Concepts Reviews: Primal, Hyper and Dual Graphs n A hypergraph n Dual graphs n A primal graph
13 Propositional Satisfiability ϕ = {( C), (A v B v C), ( A v B v E), ( B v C v D)}.
14 Constraint graphs of 3 instances of the Radio frequency assignment problem in CELAR s benchmark
15 Operations With Relations n Intersection n Union n Difference n Selection n Projection n Join n Composition
16 Combination Local Functions f g n Join : = n Logical AND: f g =
17 Global View of the Problem C1 C2 Global View = What about counting? TASK true is 1 false is 0 logical AND? Number of true tuples Sum over all the tuples
18 Road Map n Graphical models n Constraint networks Model n Inference n Variable elimination: n Tree-clustering n Constraint propagation n Search n Probabilistic Networks
19 Bucket Elimination Adaptive Consistency (Dechter & Pearl, 1987) = = Bucket E: E D, E C Bucket D: D A Bucket C: C B Bucket B: B A Bucket A: D = C A C B = A contradiction Complexity : O(n exp(w * w - induced width * ))
20 The Idea of Elimination eliminating E C R DBC = RED REB REC DBC D RDBC B Eliminate variable E joinand project value assignment 3
21 Bucket Elimination Adaptive Consistency (Dechter & Pearl, 1987) {1,2} D A E {1,2} { 1,2} {1,2,3 } C B {1,2} Bucket( E) : Bucket( D) : Bucket( C) : Bucket( B) : Bucket( A) : Bucket( A) : Bucket( D) : Bucket( C) : Bucket( B) : Bucket( E) : E D, D A C B B A RA RDCB RACB RAB A D, A B D E RDB C B, C E B E RDBE RCBE, RE * Complexity : O(n exp(w (d))), * w (d) - induced widthalong ordering d E C, E B E D C B A A D C B E
22
23 Adaptive Consistency, Bucket-elimination Initialize: partition constraints into bucket 1,...,bucket n For i=n down to 1 along d // process in reverse order for all relations R do // join all relations,..., 1 R m bucket and project-out i R new ( R R new ( X ) j j If is not empty, add it to where k is the largest variable index in Else problem is unsatisfiable Return the set of all relations (old and new) in the buckets i ) X i bucket k, k < i, R new
24 Properties of bucket-elimination (adaptive consistency) n Adaptive consistency generates a constraint network that is backtrack-free (can be solved without deadends). n The time and space complexity of adaptive consistency along ordering d is exponential in w*. n Therefore, problems having bounded induced width are tractable (solved in polynomial time). n trees ( w*=1), n series-parallel networks ( w*=2 ), n and in general k-trees ( w*=k).
25 Solving Trees (Mackworth and Freuder, 1985) Adaptive consistency is linear for trees and equivalent to enforcing directional arc-consistency (recording only unary constraints)
26 Tree Solving is Easy T Z 1,2,3 X < 1,2,3 1,2,3 R Y < 1,2,3 1,2,3 1,2,3 1,2,3 S U
27 Tree Solving is Easy T Z 1,2,3 X < 1,2,3 1,2,3 R Y < 1,2,3 1,2,3 1,2,3 1,2,3 S U
28 Tree Solving is Easy T Z R 1,2,3 X < 1,2 1,2 Y < 1,2,3 1,2,3 1,2,3 1,2,3 S U
29 Tree Solving is Easy T Z R 1,2,3 X < 1,2 1,2 Y < 1,2,3 1,2,3 1,2,3 1,2,3 S U
30 Tree Solving is Easy T Z R 1 X < 1,2 1,2 Y < 1,2,3 1,2,3 1,2,3 1,2,3 S U
31 Tree Solving is Easy T Z R 1 X < 2 2 Y < 1,2,3 1,2,3 1,2,3 1,2,3 S U
32 Tree Solving is Easy T Z R 1 X < 2 2 S Y < U
33 Tree Solving is Easy T Z R 1 X < 2 2 S Y < U Constraint propagation Solves trees in linear time
34 Road Map n Graphical models n Constraint networks Model n Inference n Variable elimination: n Tree-clustering n Constraint propagation n Search n Probabilistic Networks
35 Tree Decomposition A B R(a), R(b,a), R(c,a,b) R(d,b), R(f,c,d) R(e,b,f), R(g,e,f) 1 2 A B C R(a), R(b,a), R(c,a,b) BC B C D F R(d,b), R(f,c,d) Each function in a cluster C F D E 3 BF B E F R(e,b,f) Satisfy running intersection property G 4 EF E F G R(g,e,f)
36 Cluster Tree Elimination sep(2,3)={b,f} elim(2,3)={c,d} A B C R(a), R(b,a), R(c,a,b) BC B C D F R(d,b), R(f,c,d),h(1,2)(b,c) BF B E F R(e,b,f), h(2,3)(b,f) h( 1,2) ( b, c) = a R( a) R( b, a) R( c, a, b) h( 2,3) ( b, f ) = c, d R( d, b) R( f, c, d ) h(1,2 ) ( b, c) 4 EF E F G R(g,e,f) Computes the minimal domains
37 CTE: Cluster Tree Elimination A 1 ABC h( 1,2) ( b, c) = a R( a) R( b, a) R( c, a, b) C B D E 2 BC BCDF BF h( 2,1) ( b, c) = d, f R( d, b) R( f, c, d ) h(3,2) ( b, f ) h( 2,3) ( b, f ) = c, d R( d, b) R( f, c, d ) h(1,2 ) ( b, c) F 3 BEF h( 3,2) ( b, f ) = e R( e, b, f ) h(4,3) ( e, f ) Time: O ( exp(w*+1 )) Space: O ( exp(sep)) G 4 EF EFG h( 3,4) ( e, f ) = b R( e, b, f ) h(2,3) ( b, f ) h( 4,3) ( e, f ) = g R( g, e, f ) Computes the minimal domains
38 Tree decompositions A B C R(a), R(b,a), R(c,a,b) A tree decomposition for R =< X,D,C > is a triple < T, χ, ψ >, where T = (V,E) is a tree and χ and ψ are labelings over vertex v V χ(v) X and ψ(v) C satisfying : 1. For each function C C ψ(v) and scope(c i 2. For each variable X i i C there is exactly one vertex such that i ) χ(v) X the set {v V X connected subtree (running intersection property) A i χ(v)} forms a BC B C D F R(d,b), R(f,c,d) BF B E F R(e,b,f) EF Belief network C B F D E E F G R(g,e,f) Tree decomposition G
39 Induced-width and Tree-width Induced-width Of ordering D E C A B DCBA EDCB Tree-width =3 ADB DBE Tree-width =2 CBE Tree-width of a graph = smallest cluster in a cluster-tree Path-width of a graph = smallest cluster in a cluster-path
40 Road Map n Graphical models n Constraint networks Model n Inference n Variable elimination: n Tree-clustering n Constraint propagation n Search n Probabilistic Networks
41 Sudoku Approximation: Constraint Propagation Constraint Propagation Inference Variables: empty slots Domains = {1,2,3,4,5,6,7,8,9} Constraints: 27 all-different Each row, column and major block must be alldifferent Well posed if it has unique solution: 27 constraints
42 Approximating Inference: Local Constraint Propagation n Problem: bucket-elimination/tree-clustering algorithms are intractable when induced width is large n Approximation: bound the size of recorded dependencies, i.e. perform local constraint propagation (local inference)
43 From Global to Local Consistency
44 Arc-consistency A binary constraint R(X,Y) is arc-consistent w.r.t. X is every value In x s domain has a match in y s domain. RX = {1,2,3}, RY = {1,2,3}, constraint X < Y Only domains are reduced: R X X RXY DY
45 Arc-consistency 1 X, Y, Z, T 3 X < Y Y = Z T < Z X T X 1, 2, 3 Y 1, 2, 3 1, 2, 3 1, 2, 3 T < < Z =
46 Arc-consistency 1 X, Y, Z, T 3 X < Y Y = Z T < Z X T X T < Y 1 3 = 2 3 < R X Z X RXY DY
47 From Arc-consistency to relational arc-consistency A B 1 1 n Sound 2 3 A < B 2 3 n Incomplete n Always converges (polynomial) < = D 1 2 D < C C
48 Relational Distributed Arc- Consistency Primal Dual A B A B 2 3 AB B BC A C D D C C AD D DC
49 AC-3 O( ek 3 )
50 Arc-consistency Algorithms O( nek n AC-1: brute-force, distributed n AC-3, queue-based O( ek 3 ) n AC-4, context-based, optimal n AC-5,6,7,. O( ek 2 Good in special cases n Important: applied at every node of search n (n number of variables, e=#constraints, k=domain size) n Mackworth and Freuder (1977,1983), Mohr and Anderson, (1985) 3 ) )
51 Path-consistency n A pair (x, y) is path-consistent relative to Z, if every consistent assignment (x, y) has a consistent extension to z.
52 Example: path-consistency
53 Path-consistency Algorithms n Apply Revise-3 (O(k^3)) until no change R R π ( R D Rkj n Path-consistency ij ij (3-consistency) ij ik k adds binary constraints. n PC-1: n PC-2: O( n 5 k 5 ) n PC-4 optimal: O( n 3 k 5 ) O( n 3 k 3 ) )
54 Local i-consistency i-consistency: Any consistent assignment to any i-1 variables is consistent with at least one value of any i-th variable
55 Gausian and Boolean Propagation, Resolution n Linear inequalities x + y + z 15, z n Boolean constraint x, y propagation, unit resolution ( A B C),( B) ( A C)
56 Directional Resolution ó Adaptive Consistency * bucket i = O(exp( w )) DR time and space : O( n exp( w * ))
57 Directional i-consistency D A E C B D C B E D C E B D C B E E : D : C : B : E D, E C, E D C, D A C B A B B Adaptive R DCB R d-path, DC R DB R CB d-arc R D R C R D A :
58 Greedy Algorithms for Induced-Width n Min-width ordering n Min-induced-width ordering n Max-cardinality ordering n Min-fill ordering n Chordal graphs n Hypergraph partitionings (Project: present papers on induced-width, run algorithms for inducedwidth on new benchmarks )
59 Min-width ordering Proposition: algorithm min-width finds a min-width ordering of a graph Complexity:? O(e)
60 Greedy orderings heuristics min-induced-width (miw) input: a graph G = (V;E), V = {v1; :::; vn} output: A miw ordering of the nodes d = (v1; :::; vn). 1. for j = n to 1 by -1 do 2. r ß a node in V with smallest degree. 3. put r in position j. 4. connect r's neighbors: E ß E union {(vi; vj) (vi; r) in E; (vj ; r) 2 in E}, 5. remove r from the resulting graph: V ß V - {r}. Theorem: A graph is a tree iff it has both width and induced-width of 1. min-fill (min-fill) input: a graph G = (V;E), V = {v1; :::; vn} output: An ordering of the nodes d = (v1; :::; vn). 1. for j = n to 1 by -1 do 2. r ß a node in V with smallest fill edges for his parents. 3. put r in position j. 4. connect r's neighbors: E ß E union {(vi; vj) (vi; r) 2 E; (vj ; r) in E}, 5. remove r from the resulting graph: V ß V {r}.
61 Example We see again that G in the Figure (a) is not chordal since the parents of A are not connected in the maxcardinality ordering in Figure (d). If we connect B and C, the resulting induced graph is chordal.
62 Cordal Graphs; Max-Cardinality Ordering n A graph is cordal if every cycle of length at least 4 has a chord n Finding w* over chordal graph is easy using the max-cardinality ordering n If G* is an induced graph it is chordal n K-trees are special chordal graphs. n Finding the max-clique in chordal graphs is easy (just enumerate all cliques in a max-cardinality ordering
63 Max-cardinality ordering
64 Graph Concepts: Hypergraphs and Dual Graphs n A hypergraph is H = (V,S), V= {v_1,..,v_n} and a set of subsets Hyperegdes: S={S_1,..., S_l }. n Dual graphs of a hypergaph: The nodes are the hyperedges and a pair of nodes is connected if they share vertices in V. The arc is labeled by the shared vertices. n A primal (Markov, moral) graph of a hypergraph H = (V,S) has V as its nodes, and any two nodes are connected by an arc if they appear in the same hyperedge. n Factor Graphs..
65 Which greedy algorithm is best? n MinFill, prefers a node who add the least number of fill-in arcs. n Empirically, fill-in is the best among the greedy algorithms (MW,MIW,MF,MC) n Complexity of greedy orderings? n MW is O(?), MIW: O(?) MF (?) MC is O(mn)
66 Road Map n Graphical models n Constraint networks Model n Inference n Variable elimination: n Tree-clustering n Constraint propagation n Search n Probabilistic Networks
Exact Inference Algorithms Bucket-elimination
Exact Inference Algorithms Bucket-elimination COMPSCI 276, Spring 2011 Class 5: Rina Dechter (Reading: class notes chapter 4, Darwiche chapter 6) 1 Belief Updating Smoking lung Cancer Bronchitis X-ray
More informationConsistency algorithms. Chapter 3
Consistency algorithms Chapter Fall 00 Consistency methods pproximation of inference: rc, path and i-consistecy Methods that transform the original network into tighter and tighter representations Fall
More informationCOMPSCI 276 Fall 2007
Exact Inference lgorithms for Probabilistic Reasoning; OMPSI 276 Fall 2007 1 elief Updating Smoking lung ancer ronchitis X-ray Dyspnoea P lung cancer=yes smoking=no, dyspnoea=yes =? 2 Probabilistic Inference
More informationConsistency algorithms
Consistency algorithms Chapter SQ 00 rc-consistency X, Y, Z, T X Y Y = Z T Z X T X,, Y,,,,,, T = Z SQ 00 rc-consistency X, Y, Z, T X Y Y = Z T Z X T X T Y Z = SQ 00 rc-consistency Sound < < Incomplete
More informationArtificial Intelligence
Artificial Intelligence Constraint Satisfaction Vibhav Gogate The University of Texas at Dallas Some material courtesy of Rina Dechter, Alex Ihler and Stuart Russell Constraint Satisfaction Problems The
More informationExact Inference Algorithms Bucket-elimination
Exact Inference Algorithms Bucket-elimination COMPSCI 276, Spring 2013 Class 5: Rina Dechter (Reading: class notes chapter 4, Darwiche chapter 6) 1 Belief Updating Smoking lung Cancer Bronchitis X-ray
More informationOn finding minimal w-cutset problem
On finding minimal w-cutset problem Bozhena Bidyuk and Rina Dechter Information and Computer Science University Of California Irvine Irvine, CA 92697-3425 Abstract The complexity of a reasoning task over
More informationGraph structure in polynomial systems: chordal networks
Graph structure in polynomial systems: chordal networks Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology
More informationGraph structure in polynomial systems: chordal networks
Graph structure in polynomial systems: chordal networks Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology
More informationVariable Elimination (VE) Barak Sternberg
Variable Elimination (VE) Barak Sternberg Basic Ideas in VE Example 1: Let G be a Chain Bayesian Graph: X 1 X 2 X n 1 X n How would one compute P X n = k? Using the CPDs: P X 2 = x = x Val X1 P X 1 = x
More informationSearch and Lookahead. Bernhard Nebel, Julien Hué, and Stefan Wölfl. June 4/6, 2012
Search and Lookahead Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg June 4/6, 2012 Search and Lookahead Enforcing consistency is one way of solving constraint networks:
More informationIntroduction to Arti Intelligence
Introduction to Arti Intelligence cial Lecture 4: Constraint satisfaction problems 1 / 48 Constraint satisfaction problems: Today Exploiting the representation of a state to accelerate search. Backtracking.
More informationA new Evaluation of Forward Checking and its Consequences on Efficiency of Tools for Decomposition of CSPs
2008 20th IEEE International Conference on Tools with Artificial Intelligence A new Evaluation of Forward Checking and its Consequences on Efficiency of Tools for Decomposition of CSPs Philippe Jégou Samba
More informationMin-Max Message Passing and Local Consistency in Constraint Networks
Min-Max Message Passing and Local Consistency in Constraint Networks Hong Xu, T. K. Satish Kumar, and Sven Koenig University of Southern California, Los Angeles, CA 90089, USA hongx@usc.edu tkskwork@gmail.com
More informationMethods that transform the original network into a tighter and tighter representations
hapter pproximation of inference: rc, path and i-consistecy Methods that transform the original network into a tighter and tighter representations all 00 IS 75 - onstraint Networks rc-consistency X, Y,
More informationThe core of solving constraint problems using Constraint Programming (CP), with emphasis on:
What is it about? l Theory The core of solving constraint problems using Constraint Programming (CP), with emphasis on: l Modeling l Solving: Local consistency and propagation; Backtracking search + heuristics.
More informationA Hybrid Tractable Class for Non-Binary CSPs
A Hybrid Tractable Class for Non-Binary CSPs Achref El Mouelhi Philippe Jégou Cyril Terrioux LSIS - UMR CNRS 7296 Aix-Marseille Université Avenue Escadrille Normandie-Niemen 13397 Marseille Cedex 20 (France)
More informationBayesian Networks: Representation, Variable Elimination
Bayesian Networks: Representation, Variable Elimination CS 6375: Machine Learning Class Notes Instructor: Vibhav Gogate The University of Texas at Dallas We can view a Bayesian network as a compact representation
More informationChordal networks of polynomial ideals
Chordal networks of polynomial ideals Diego Cifuentes Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology Joint work with Pablo
More informationCompiling Knowledge into Decomposable Negation Normal Form
Compiling Knowledge into Decomposable Negation Normal Form Adnan Darwiche Cognitive Systems Laboratory Department of Computer Science University of California Los Angeles, CA 90024 darwiche@cs. ucla. edu
More informationCS281A/Stat241A Lecture 19
CS281A/Stat241A Lecture 19 p. 1/4 CS281A/Stat241A Lecture 19 Junction Tree Algorithm Peter Bartlett CS281A/Stat241A Lecture 19 p. 2/4 Announcements My office hours: Tuesday Nov 3 (today), 1-2pm, in 723
More informationAnnouncements. Solution to Assignment 3 is posted Assignment 4 is available. c D. Poole and A. Mackworth 2017 CPSC 322 Lecture 8 1 / 25
Announcements Solution to Assignment 3 is posted Assignment 4 is available c D. Poole and A. Mackworth 2017 CPSC 322 Lecture 8 1 / 25 Review: So far... Constraint satisfaction problems defined in terms
More informationLinear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs Nathan Lindzey, Ross M. McConnell Colorado State University, Fort Collins CO 80521, USA Abstract. Tucker characterized
More informationClique trees & Belief Propagation. Siamak Ravanbakhsh Winter 2018
Graphical Models Clique trees & Belief Propagation Siamak Ravanbakhsh Winter 2018 Learning objectives message passing on clique trees its relation to variable elimination two different forms of belief
More informationExact Inference I. Mark Peot. In this lecture we will look at issues associated with exact inference. = =
Exact Inference I Mark Peot In this lecture we will look at issues associated with exact inference 10 Queries The objective of probabilistic inference is to compute a joint distribution of a set of query
More informationLecture 12: May 09, Decomposable Graphs (continues from last time)
596 Pat. Recog. II: Introduction to Graphical Models University of Washington Spring 00 Dept. of lectrical ngineering Lecture : May 09, 00 Lecturer: Jeff Bilmes Scribe: Hansang ho, Izhak Shafran(000).
More informationMessage Passing and Junction Tree Algorithms. Kayhan Batmanghelich
Message Passing and Junction Tree Algorithms Kayhan Batmanghelich 1 Review 2 Review 3 Great Ideas in ML: Message Passing Each soldier receives reports from all branches of tree 3 here 7 here 1 of me 11
More informationCS/COE
CS/COE 1501 www.cs.pitt.edu/~nlf4/cs1501/ P vs NP But first, something completely different... Some computational problems are unsolvable No algorithm can be written that will always produce the correct
More informationChapter 6 Constraint Satisfaction Problems
Chapter 6 Constraint Satisfaction Problems CS5811 - Artificial Intelligence Nilufer Onder Department of Computer Science Michigan Technological University Outline CSP problem definition Backtracking search
More informationCapturing Independence Graphically; Undirected Graphs
Capturing Independence Graphically; Undirected Graphs COMPSCI 276, Spring 2017 Set 2: Rina Dechter (Reading: Pearl chapters 3, Darwiche chapter 4) 1 Outline Graphical models: The constraint network, Probabilistic
More informationRevisiting the Limits of MAP Inference by MWSS on Perfect Graphs
Revisiting the Limits of MAP Inference by MWSS on Perfect Graphs Adrian Weller University of Cambridge CP 2015 Cork, Ireland Slides and full paper at http://mlg.eng.cam.ac.uk/adrian/ 1 / 21 Motivation:
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationConstraint Satisfaction 101
Constraint Satisfaction 101 Berthe Y. Choueiry (Shu-we-ri) Nov 14, 2006 Constraint Satisfaction 101 1 Constraint Processing Constraint Satisfaction Computational problem Constraint Satisfaction Problem
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationSums of Products. Pasi Rastas November 15, 2005
Sums of Products Pasi Rastas November 15, 2005 1 Introduction This presentation is mainly based on 1. Bacchus, Dalmao and Pitassi : Algorithms and Complexity results for #SAT and Bayesian inference 2.
More informationInference and Representation
Inference and Representation David Sontag New York University Lecture 5, Sept. 30, 2014 David Sontag (NYU) Inference and Representation Lecture 5, Sept. 30, 2014 1 / 16 Today s lecture 1 Running-time of
More information1 Primals and Duals: Zero Sum Games
CS 124 Section #11 Zero Sum Games; NP Completeness 4/15/17 1 Primals and Duals: Zero Sum Games We can represent various situations of conflict in life in terms of matrix games. For example, the game shown
More informationTHE topic of this paper is the following problem:
1 Revisiting the Linear Programming Relaxation Approach to Gibbs Energy Minimization and Weighted Constraint Satisfaction Tomáš Werner Abstract We present a number of contributions to the LP relaxation
More informationThe exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 188 Fall 2015 Introduction to Artificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
More informationVariable Elimination: Algorithm
Variable Elimination: Algorithm Sargur srihari@cedar.buffalo.edu 1 Topics 1. Types of Inference Algorithms 2. Variable Elimination: the Basic ideas 3. Variable Elimination Sum-Product VE Algorithm Sum-Product
More informationChapter 4: Computation tree logic
INFOF412 Formal verification of computer systems Chapter 4: Computation tree logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 CTL: a specification
More informationProbabilistic Graphical Models (I)
Probabilistic Graphical Models (I) Hongxin Zhang zhx@cad.zju.edu.cn State Key Lab of CAD&CG, ZJU 2015-03-31 Probabilistic Graphical Models Modeling many real-world problems => a large number of random
More informationGeneralized Micro-Structures for Non-Binary CSP
Generalized Micro-Structures for Non-Binary CSP Achref El Mouelhi LSIS - UMR CNRS 7296 Aix-Marseille Université Avenue Escadrille Normandie-Niemen 13397 Marseille Cedex 20 (France) achref.elmouelhi@lsis.org
More informationBayesian Networks Factor Graphs the Case-Factor Algorithm and the Junction Tree Algorithm
Bayesian Networks Factor Graphs the Case-Factor Algorithm and the Junction Tree Algorithm 1 Bayesian Networks We will use capital letters for random variables and lower case letters for values of those
More informationVariable Elimination: Algorithm
Variable Elimination: Algorithm Sargur srihari@cedar.buffalo.edu 1 Topics 1. Types of Inference Algorithms 2. Variable Elimination: the Basic ideas 3. Variable Elimination Sum-Product VE Algorithm Sum-Product
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More informationBinary Decision Diagrams
Binary Decision Diagrams Literature Some pointers: H.R. Andersen, An Introduction to Binary Decision Diagrams, Lecture notes, Department of Information Technology, IT University of Copenhagen Tools: URL:
More informationNP-Completeness. Andreas Klappenecker. [based on slides by Prof. Welch]
NP-Completeness Andreas Klappenecker [based on slides by Prof. Welch] 1 Prelude: Informal Discussion (Incidentally, we will never get very formal in this course) 2 Polynomial Time Algorithms Most of the
More informationChapter 7 R&N ICS 271 Fall 2017 Kalev Kask
Set 6: Knowledge Representation: The Propositional Calculus Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask Outline Representing knowledge using logic Agent that reason logically A knowledge based agent Representing
More informationThe minimum G c cut problem
The minimum G c cut problem Abstract In this paper we define and study the G c -cut problem. Given a complete undirected graph G = (V ; E) with V = n, edge weighted by w(v i, v j ) 0 and an undirected
More informationGraphical Model Inference with Perfect Graphs
Graphical Model Inference with Perfect Graphs Tony Jebara Columbia University July 25, 2013 joint work with Adrian Weller Graphical models and Markov random fields We depict a graphical model G as a bipartite
More informationProf. Dr. Lars Schmidt-Thieme, L. B. Marinho, K. Buza Information Systems and Machine Learning Lab (ISMLL), University of Hildesheim, Germany, Course
Course on Bayesian Networks, winter term 2007 0/31 Bayesian Networks Bayesian Networks I. Bayesian Networks / 1. Probabilistic Independence and Separation in Graphs Prof. Dr. Lars Schmidt-Thieme, L. B.
More informationPredicate Calculus. Formal Methods in Verification of Computer Systems Jeremy Johnson
Predicate Calculus Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. Motivation 1. Variables, quantifiers and predicates 2. Syntax 1. Terms and formulas 2. Quantifiers, scope
More informationPropositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel
Propositional Logic Testing, Quality Assurance, and Maintenance Winter 2018 Prof. Arie Gurfinkel References Chpater 1 of Logic for Computer Scientists http://www.springerlink.com/content/978-0-8176-4762-9/
More informationCOMP538: Introduction to Bayesian Networks
COMP538: Introduction to ayesian Networks Lecture 4: Inference in ayesian Networks: The VE lgorithm Nevin L. Zhang lzhang@cse.ust.hk Department of Computer Science and Engineering Hong Kong University
More informationIntroduction to Solving Combinatorial Problems with SAT
Introduction to Solving Combinatorial Problems with SAT Javier Larrosa December 19, 2014 Overview of the session Review of Propositional Logic The Conjunctive Normal Form (CNF) Modeling and solving combinatorial
More informationMulti-Agent Systems. Bernhard Nebel, Felix Lindner, and Thorsten Engesser. Summer Term Albert-Ludwigs-Universität Freiburg
Multi-Agent Systems Albert-Ludwigs-Universität Freiburg Bernhard Nebel, Felix Lindner, and Thorsten Engesser Summer Term 2017 Course outline 1 Introduction 2 Agent-Based Simulation 3 Agent Architectures
More informationInterleaved Alldifferent Constraints: CSP vs. SAT Approaches
Interleaved Alldifferent Constraints: CSP vs. SAT Approaches Frédéric Lardeux 3, Eric Monfroy 1,2, and Frédéric Saubion 3 1 Universidad Técnica Federico Santa María, Valparaíso, Chile 2 LINA, Université
More informationUndirected Graphical Models: Markov Random Fields
Undirected Graphical Models: Markov Random Fields 40-956 Advanced Topics in AI: Probabilistic Graphical Models Sharif University of Technology Soleymani Spring 2015 Markov Random Field Structure: undirected
More informationThe Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks Johan H.P. Kwisthout and Hans L. Bodlaender and L.C. van der Gaag 1 Abstract. Algorithms for probabilistic inference in Bayesian
More informationCS Lecture 4. Markov Random Fields
CS 6347 Lecture 4 Markov Random Fields Recap Announcements First homework is available on elearning Reminder: Office hours Tuesday from 10am-11am Last Time Bayesian networks Today Markov random fields
More informationUNDERSTANDING BELIEF PROPOGATION AND ITS GENERALIZATIONS
UNDERSTANDING BELIEF PROPOGATION AND ITS GENERALIZATIONS JONATHAN YEDIDIA, WILLIAM FREEMAN, YAIR WEISS 2001 MERL TECH REPORT Kristin Branson and Ian Fasel June 11, 2003 1. Inference Inference problems
More informationExample: multivariate Gaussian Distribution
School of omputer Science Probabilistic Graphical Models Representation of undirected GM (continued) Eric Xing Lecture 3, September 16, 2009 Reading: KF-chap4 Eric Xing @ MU, 2005-2009 1 Example: multivariate
More informationLogic: Propositional Logic Truth Tables
Logic: Propositional Logic Truth Tables Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06
More informationOutline What are CSPs? Standard search and CSPs Improvements. Constraint Satisfaction. Introduction. Introduction
Constraint Satisfaction CS 86/686 May 6, 006 University of Waterloo Outline What are CSPs? Standard search and CSPs Improvements acktracking acktracking + heuristics Forward checking Introduction In the
More informationMock Exam Künstliche Intelligenz-1. Different problems test different skills and knowledge, so do not get stuck on one problem.
Name: Matriculation Number: Mock Exam Künstliche Intelligenz-1 January 9., 2017 You have one hour(sharp) for the test; Write the solutions to the sheet. The estimated time for solving this exam is 53 minutes,
More informationDoes Better Inference mean Better Learning?
Does Better Inference mean Better Learning? Andrew E. Gelfand, Rina Dechter & Alexander Ihler Department of Computer Science University of California, Irvine {agelfand,dechter,ihler}@ics.uci.edu Abstract
More informationTemporal Constraint Networks
Ch. 5b p.1/49 Temporal Constraint Networks Addition to Chapter 5 Ch. 5b p.2/49 Outline Temporal reasoning Qualitative networks The interval algebra The point algebra Quantitative temporal networks Reference:
More informationNP-COMPLETE PROBLEMS. 1. Characterizing NP. Proof
T-79.5103 / Autumn 2006 NP-complete problems 1 NP-COMPLETE PROBLEMS Characterizing NP Variants of satisfiability Graph-theoretic problems Coloring problems Sets and numbers Pseudopolynomial algorithms
More informationPredicate Calculus. CS 270 Math Foundations of Computer Science Jeremy Johnson
Predicate Calculus CS 270 Math Foundations of Computer Science Jeremy Johnson Presentation uses material from Huth and Ryan, Logic in Computer Science: Modelling and Reasoning about Systems, 2nd Edition
More informationDatabase Theory VU , SS Ehrenfeucht-Fraïssé Games. Reinhard Pichler
Database Theory Database Theory VU 181.140, SS 2018 7. Ehrenfeucht-Fraïssé Games Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Pichler 15
More informationThe Extendable-Triple Property: a new CSP Tractable Class beyond BTP
The Extendable-Triple Property: a new CSP Tractable Class beyond BTP Philippe Jégou and Cyril Terrioux Aix-Marseille Université, CNRS LSIS UMR 7296 Avenue Escadrille Normandie-Niemen 13397 Marseille Cedex
More informationCapturing Independence Graphically; Undirected Graphs
Capturing Independence Graphically; Undirected Graphs COMPSCI 276, Spring 2014 Set 2: Rina Dechter (Reading: Pearl chapters 3, Darwiche chapter 4) 1 Constraint Networks Example: map coloring Variables
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets
More informationChordal structure and polynomial systems
Chordal structure and polynomial systems Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology Joint work with
More informationInference as Optimization
Inference as Optimization Sargur Srihari srihari@cedar.buffalo.edu 1 Topics in Inference as Optimization Overview Exact Inference revisited The Energy Functional Optimizing the Energy Functional 2 Exact
More informationGAV-sound with conjunctive queries
GAV-sound with conjunctive queries Source and global schema as before: source R 1 (A, B),R 2 (B,C) Global schema: T 1 (A, C), T 2 (B,C) GAV mappings become sound: T 1 {x, y, z R 1 (x,y) R 2 (y,z)} T 2
More informationOn the Relationship between Sum-Product Networks and Bayesian Networks
On the Relationship between Sum-Product Networks and Bayesian Networks by Han Zhao A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of
More information8. INTRACTABILITY I. Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley. Last updated on 2/6/18 2:16 AM
8. INTRACTABILITY I poly-time reductions packing and covering problems constraint satisfaction problems sequencing problems partitioning problems graph coloring numerical problems Lecture slides by Kevin
More informationCS311 Computational Structures. NP-completeness. Lecture 18. Andrew P. Black Andrew Tolmach. Thursday, 2 December 2010
CS311 Computational Structures NP-completeness Lecture 18 Andrew P. Black Andrew Tolmach 1 Some complexity classes P = Decidable in polynomial time on deterministic TM ( tractable ) NP = Decidable in polynomial
More informationConstraint Satisfaction [RN2] Sec [RN3] Sec Outline
Constraint Satisfaction [RN2] Sec 5.1-5.2 [RN3] Sec 6.1-6.3 CS 486/686 Lecture 4: Jan 12, 2012 University of Waterloo 1 Outline What are CSPs? Standard search and CSPs Improvements Backtracking Backtracking
More informationBounded Inference Non-iteratively; Mini-Bucket Elimination
Bounded Inference Non-iteratively; Mini-Bucket Elimination COMPSCI 276,Spring 2018 Class 6: Rina Dechter Reading: Class Notes (8, Darwiche chapters 14 Outline Mini-bucket elimination Weighted Mini-bucket
More informationA brief introduction to Logic. (slides from
A brief introduction to Logic (slides from http://www.decision-procedures.org/) 1 A Brief Introduction to Logic - Outline Propositional Logic :Syntax Propositional Logic :Semantics Satisfiability and validity
More informationNP Completeness and Approximation Algorithms
Chapter 10 NP Completeness and Approximation Algorithms Let C() be a class of problems defined by some property. We are interested in characterizing the hardest problems in the class, so that if we can
More informationReview CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.
CHAPTER 2 Review 2.1 Definitions in Chapter 2 2.1 Set; Element; Member; Universal Set 2.2 Subset 2.3 Proper Subset 2.4 The Empty Set, 2.5 Set Equality 2.6 Cardinality; Infinite Set 2.7 Complement 2.8 Intersection
More informationα-acyclic Joins Jef Wijsen May 4, 2017
α-acyclic Joins Jef Wijsen May 4, 2017 1 Motivation Joins in a Distributed Environment Assume the following relations. 1 M[NN, Field of Study, Year] stores data about students of UMONS. For example, (19950423158,
More informationUndirected Graphical Models
Outline Hong Chang Institute of Computing Technology, Chinese Academy of Sciences Machine Learning Methods (Fall 2012) Outline Outline I 1 Introduction 2 Properties Properties 3 Generative vs. Conditional
More informationCS 301: Complexity of Algorithms (Term I 2008) Alex Tiskin Harald Räcke. Hamiltonian Cycle. 8.5 Sequencing Problems. Directed Hamiltonian Cycle
8.5 Sequencing Problems Basic genres. Packing problems: SET-PACKING, INDEPENDENT SET. Covering problems: SET-COVER, VERTEX-COVER. Constraint satisfaction problems: SAT, 3-SAT. Sequencing problems: HAMILTONIAN-CYCLE,
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Chapter 5 AIMA2e Slides, Stuart Russell and Peter Norvig, Completed by Kazim Fouladi, Fall 2008 Chapter 5 1 Outline CSP examples Backtracking search for CSPs Problem structure
More informationChapter 3: Proving NP-completeness Results
Chapter 3: Proving NP-completeness Results Six Basic NP-Complete Problems Some Techniques for Proving NP-Completeness Some Suggested Exercises 1.1 Six Basic NP-Complete Problems 3-SATISFIABILITY (3SAT)
More informationConstraint Satisfaction
Constraint Satisfaction CS 486/686 May 16, 2006 University of Waterloo 1 Outline What are CSPs? Standard search and CSPs Improvements Backtracking Backtracking + heuristics Forward checking 2 Introduction
More informationDynamic Programming. Shuang Zhao. Microsoft Research Asia September 5, Dynamic Programming. Shuang Zhao. Outline. Introduction.
Microsoft Research Asia September 5, 2005 1 2 3 4 Section I What is? Definition is a technique for efficiently recurrence computing by storing partial results. In this slides, I will NOT use too many formal
More information5. Sum-product algorithm
Sum-product algorithm 5-1 5. Sum-product algorithm Elimination algorithm Sum-product algorithm on a line Sum-product algorithm on a tree Sum-product algorithm 5-2 Inference tasks on graphical models consider
More informationWeighted Heuristic Anytime Search
Weighted Heuristic Anytime Search Flerova, Marinescu, and Dechter 1 1 University of South Carolina April 24, 2017 Basic Heuristic Best-first Search Blindly follows the heuristic Weighted A Search For w
More informationA Little Logic. Propositional Logic. Satisfiability Problems. Solving Sudokus. First Order Logic. Logic Programming
A Little Logic International Center for Computational Logic Technische Universität Dresden Germany Propositional Logic Satisfiability Problems Solving Sudokus First Order Logic Logic Programming A Little
More informationTemporal Constraint Networks
Ch. 6b p.1/49 Temporal Constraint Networks Addition to Chapter 6 Ch. 6b p.2/49 Outline Temporal reasoning Qualitative networks The interval algebra The point algebra Quantitative temporal networks Reference:
More informationDatalog and Constraint Satisfaction with Infinite Templates
Datalog and Constraint Satisfaction with Infinite Templates Manuel Bodirsky 1 and Víctor Dalmau 2 1 CNRS/LIX, École Polytechnique, bodirsky@lix.polytechnique.fr 2 Universitat Pompeu Fabra, victor.dalmau@upf.edu
More informationThe Bayesian Ontology Language BEL
Journal of Automated Reasoning manuscript No. (will be inserted by the editor) The Bayesian Ontology Language BEL İsmail İlkan Ceylan Rafael Peñaloza Received: date / Accepted: date Abstract We introduce
More informationBernhard Nebel, Julien Hué, and Stefan Wölfl. June 27 & July 2/4, 2012
Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg June 27 & July 2/4, 2012 vs. complexity For some restricted constraint languages we know some polynomial time algorithms
More information