AIwiki

Let's assume our knowledge base in Prolog consists of the following facts and rules:

correct_answer(question_1, a). correct_answer(question_2, b).
student(anna). student(michael).
answered(anna, question_1, b). answered(anna, question_2, b).
answered(michael, question_1, a). answered(anna, question_2, a).
 
passes_exam(Student) :- 
    correct_answer(question_1, A1), 
    answered(Student, question_1, A1),
    correct_answer(question_2, A2),
    answered(Student, question_2, A2).
 

1. Does any student pass the exam according to the KB? (1p)
2. Write a modified version of the passes_exam/1 predicate, so it requires only 50% to pass the exam. (2p)
3. Rewrite the KB in CLIPS (still, 50% should be enough) (3p)

What are the three reasoning modes supported by HeaRTDroid? (3p) Describe every of them in 1-2 sentences. (3p)

Assign every concept to one of the five technologies: Drools, Prolog, Clips, HeaRTDroid, GDL (there may be more than one correct answer) (3p)

1. Closed-World-Assumption: ……..
2. Backward Chaining: ……..
3. Certainty Factors: ……..
4. Fact Type: ……..
5. Fluent: ……..
6. HMR: ……..

Choose and describe shortly three of them. (3p)

Look at the following GDL program and answer following questions:

role(white)
role(black)
 
base(p)
base(q)
base(r)
 
input(R,a) :- role(R)
input(R,b) :- role(R)
input(R,c) :- role(R)
 
init(p)
 
legal(white,a)
legal(white,b)
legal(black,b)
legal(black,c).
 
next(p) :- does(white,a) & ~true(p)
next(p) :- ~does(white,a) & true(p)
next(q) :- does(white,b) & true(p)
next(q) :- does(white,c) & true(r)
next(q) :- ~does(white,b) & ~does(white,c) & true(q)
next(r) :- does(white,c) & true(q)
next(r) :- ~does(white,c) & true(r)
 
goal(white,100) :- terminal
goal(white,0) :- ~terminal
goal(black,100) :- terminal
goal(black,0) :- ~terminal
 
terminal :- true(p) & true(q) & true(r)

1. Ordered List Item