1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
# coding=utf-8
from operator import itemgetter
import socket
import prolog.engine
import prolog.util
from server.hints import Hint, HintSequence
import server.problems
id = 94
group = 'family_relations'
number = 1
visible = True
facts = 'family_relations'
solution = '''\
mother(X, Y) :-
parent(X, Y),
female(X).
'''
hint_type = {
'general_hint': HintSequence('general_hint', 3),
'or_instead_of_and': Hint('or_instead_of_and'),
'x_must_be_female': Hint('x_must_be_female'),
'x_must_be_parent': Hint('x_must_be_parent'),
'y_can_be_of_any_gender': Hint('y_can_be_of_any_gender'),
'y_need_not_be_parent': Hint('y_need_not_be_parent'),
}
test_cases = [
('mother(X, _)',
[{'X': 'ana'}, {'X': 'elaine'}, {'X': 'estelle'}, {'X': 'helen'},
{'X': 'jill'}, {'X': 'joanne'}, {'X': 'margaret'}, {'X': 'nevia'},
{'X': 'patricia'}, {'X': 'sally'}, {'X': 'tina'}, {'X': 'vanessa'}]),
('mother(_, X)',
[{'X': 'aleksander'}, {'X': 'alessandro'}, {'X': 'andrew'},
{'X': 'anna'}, {'X': 'daniela'}, {'X': 'george'}, {'X': 'jerry'},
{'X': 'joanne'}, {'X': 'john'}, {'X': 'kramer'}, {'X': 'luana'},
{'X': 'melanie'}, {'X': 'nevia'}, {'X': 'steve'}, {'X': 'susan'},
{'X': 'william'}]),
('mother(joanne, X)',
[{'X': 'steve'}]),
]
def test(program, solved_problems):
code = (program + '\n' +
server.problems.solutions_for_problems('prolog', solved_problems) + '\n' +
server.problems.load_facts('prolog', facts).facts)
engine_id = None
try:
engine_id, output = prolog.engine.create(code=code, timeout=1.0)
if not engine_id or 'error' in map(itemgetter(0), output):
# Engine creation failed, or syntax error in code.
return 0, len(test_cases)
n_correct = 0
for query, answers in test_cases:
# Limit inferences for each solution to curb unbounded recursion.
limited = 'call_with_inference_limit(({}), 100000, _)'.format(query)
if prolog.engine.check_answers(engine_id, query=limited, answers=answers, timeout=1.0):
n_correct += 1
finally:
if engine_id:
prolog.engine.destroy(engine_id)
return n_correct, len(test_cases)
def hint(program, solved_problems):
tokens = prolog.util.tokenize(program)
code = (program + '\n' +
server.problems.solutions_for_problems('prolog', solved_problems) + '\n' +
server.problems.load_facts('prolog', facts).facts)
engine_id = None
try:
engine_id, output = prolog.engine.create(code=code, timeout=1.0)
if not engine_id:
raise Exception('Prolog engine failed to create.')
# OR (;) instead of AND (,)
# this hint has to be before the next two
# as otherwise those two would always override it
# and not convey the same (amount of) help/information
if prolog.util.Token('SEMI', ';') in tokens and prolog.engine.ask_truth(engine_id,
'findall(_, mother(X, Y), L1), length(L1, N), \
findall(_, (parent(X, Y) ; female(X)), L2), length(L2, N)'):
return [{'id': 'or_instead_of_and'}]
# X must be female
if prolog.engine.ask_truth(engine_id, 'male(X), mother(X, _)'):
return [{'id': 'x_must_be_female'}]
# X must be a parent
if prolog.engine.ask_truth(engine_id,
'mother(X, _), \+ parent(X, _)'):
return [{'id': 'x_must_be_parent'}]
# Y can be of any gender, incl. male
if prolog.engine.ask_one(engine_id,
'mother(_, Y), male(Y)') == 'false':
return [{'id': 'y_can_be_of_any_gender'}]
# Y does not necessarily need to be a parent
if prolog.engine.ask_one(engine_id,
'mother(_, Y), \+ parent(Y, _)') == 'false':
return [{'id': 'y_need_not_be_parent'}]
except socket.timeout as ex:
pass
finally:
if engine_id:
prolog.engine.destroy(engine_id)
return None
|
