Unformatted text preview: E 1 ,...,E n1 correspond to the directions of these edges and take values { left,right } . I 1 ,...,I n2 can take values { T,F } . O 1 ,...,O n2 can take values { T,F } . Constraints: Intuitively, we want I i to be T if X i → X i +1 ← X i +2 , i.e. the triple X i ,X i +1 ,X i +2 is inactive. Also, we want O i to be T if either I i or O i1 is T, i.e. if the current triple is inactive or if any of the prior triples was inactive. Finally, we want O n2 to be T which would imply that there is some inactive triple. ( I i ,E i ,E i +1 ) ∈ { ( T,right,left ) , ( F,right,right ) , ( F,left,right ) , ( F,left,left ) } for i ∈ { 1 ,...,n2 } . ( I 1 ,O 1 ) ∈ { ( T,T ) , ( F,F ) } ( O i1 ,I i ,O i ) ∈ { ( F,F,F ) , ( F,T,T ) , ( T,F,T ) , ( T,T,T ) } for i ∈ { 2 ,...,n2 } O n2 = true...
View
Full
Document
This note was uploaded on 08/30/2009 for the course CS 188 taught by Professor Staff during the Spring '08 term at Berkeley.
 Spring '08
 Staff
 Artificial Intelligence, Strain

Click to edit the document details