Please put your answers on this form:

YOUR NAME:                    please put your name on each page

Question 1: 
==================================================

UNKNOWN1 = DI

UNKNOWN2 = Aspect

UNKNOWN3 = end

UNKNOWN4 = ParameterDI

UNKNOWN5 = Cd_Graph

UNKNOWN6 = CList(Declaration)

UNKNOWN7 = : Strategy | Traversal| Constraints.

UNKNOWN8 = = "declare strategy"

UNKNOWN9 = = "declare traversal"

UNKNOWN10 = = "declare constraints"

UNKNOWN11 = Cd_Graph <maps> List(Map)

UNKNOWN12 = CList

UNKNOWN13 = 

Cd_Graph = < adjacencies > Cd_Adj_List .
Cd_Adj_List ~ { Cd_Adjacency } .
Cd_Adjacency = < source > Cd_Vertex < ns > Cd_Neighbors "." .
Cd_Neighbors :  Cd_Construct | Cd_Alternat
   *common* < construct_ns > Cd_LV_List .
Cd_Construct = "=" .
Cd_Alternat = ":" < alternat_ns > Cd_V_BarList .
Cd_LV_List ~ { Cd_LVertex } .
Cd_V_BarList ~ Cd_Vertex { "|" Cd_Vertex } .
Cd_LVertex = ["<" < label_name > Cd_Label ">"] < vertex > Cd_Vertex .
Cd_Label = Ident.
Cd_ClassName = Ident.






Question 2: 
==================================================

UNKNOWN1 = Decide

UNKNOWN2 = !v4 !v6 !v2 !v8 !v1 !v9 !v3 !v7 
UNKNOWN2 = !v1 !v2 !v3 !v4 !v6 !v7 !v8 !v9 

UNKNOWN3 = Unit Propagate* = several Unit Propagate

UNKNOWN4 = 22(v1 v2 v3) [or 22(v7 v8 v9) or 22(v1 v4 v7) or 22(v3 v6 v9) or 22(v3 v5 v7)]

UNKNOWN5 = v5* !v4 !v6 !v2 !v8 !v1 !v9 !v3 !v7
UNKNOWN5 = v5* !v1 !v2 !v3 !v4 !v6 !v7 !v8 !v9

UNKNOWN6 = 240(!v5)

UNKNOWN7 = Restart

UNKNOWN8 = !v7 !v8 !v3 !v6 !v1 v2 v4 
UNKNOWN8 = !v1 v2 !v3 v4 !v6 !v7 !v8 

UNKNOWN9 = 22(v3 v5 v7)

UNKNOWN10 = !v7 !v8 !v3 !v6 !v1 v2 v4
UNKNOWN10 = !v1 v2 !v3 v4 !v6 !v7 !v8 

UNKNOWN11 = 240(!v9 )

UNKNOWN12 =  Semi-Super Resolution

UNKNOWN13 = Restart

UNKNOWN14 = !v5 !v9 v1 !v2 !v3 !v4 !v7 v6 v8
UNKNOWN14 = v1 !v2 !v3 !v4 !v5 v6 !v7 v8 !v9

UNKNOWN15 = 240(!v9 )

UNKNOWN16 = 22(v3 v5 v7)

UNKNOWN17 (v1) = 1

UNKNOWN18 (v2) = 0

UNKNOWN19 (v3) = 0

UNKNOWN20 (v4) = 0

UNKNOWN21 (v5) = 0

UNKNOWN22 (v6) = 1

UNKNOWN23 (v7) = 0

UNKNOWN24 (v8) = 1

UNKNOWN25 (v9) = 0

Other solutions for 17-25 are possible:
0 0 1 0 1 0 1 0 0
0 1 0 1 0 0 0 0 1
1 0 0 0 0 1 0 1 0 (from above)







Question 3: 
==================================================

UNKNOWN1 = Defined objects



UNKNOWN2 = Used objects



UNKNOWN3 = Defined predicates



UNKNOWN4 = Used predicates



UNKNOWN5 =

List l = cg.gather(this,"from Plan via ->*,operators,* to Op");
System.out.println(l.size());

or

System.out.println(this.get_operators().size());














UNKNOWN6 =
Battery1

UNKNOWN7 =
Battery2

UNKNOWN8 =
Cap

UNKNOWN9 =
Flashlight

UNKNOWN10 = On

UNKNOWN11 = In


Question 4:
=============================

1. Step: set-up of CSP

introduce 81 variables:
x11 to x99 each with domain {1,2,3,4,5,6,7,8,9}
variable xij is in row i and column j of a two dimensional matrix.

Introduce a relation D(x,y) = x != y

For each column introduce binomial(9,2) constraints using D.
For each row introduce binomial(9,2) constraints using D.
For each 3 by 3 region introduce binomial(9,2) constraints using D.

2. Step: Prepare for our solvers
Use 4 bits to encode each of the 9 values.
D(p1 p2 p3 p4, q1 q2 q3 q4)= p1 != q1 and p2 != q2 and p3 != q3 and p4 != q4
Forbid 0, 10,11,12,13,14,15
E.g., F(p1 p2 p3 p4)= !(p1=0 and p2=0 and p3=0 and p4=0)
Introduce auxiliary variables to reduce all relations to rank 3.