-
Notifications
You must be signed in to change notification settings - Fork 3
/
domains.rkt
169 lines (153 loc) · 5.06 KB
/
domains.rkt
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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
#lang racket
(require "solver.rkt")
(require "facts.rkt")
(require "generation.rkt")
(require "equations.rkt")
(require "ternary.rkt")
(require "sorting.rkt")
(require "fraction.rkt")
; Definition of all implemented domains.
; Domains come in pairs: domain should be used for training and learning,
; and domain/test should be used for evaluation.
; For now, only equations-ct has any difference between train and test,
; but in the future we'll use the test domains to test for systematic
; generalization (i.e. problems requiring longer solutions, which can be
; obtained by tweaking the difficulty parameter in the generator).
(define EquationsDomain
(Domain
"equations"
generate-problem
fact-solves-goal?
d:equations))
(define EquationsTestDomain
(Domain
"equations/test"
generate-problem
fact-solves-goal?
d:equations))
; Equations domain where problems come from the Cognitive Tutor logs.
; We take the last 90 templates to be a 'test set', and the
; remaining to be the 'training set' (there are 290 in total).
(define EquationsCTDomain
(Domain
"equations-ct"
(generator-from-templates (take-right cognitive-tutor-templates 90))
fact-solves-goal?
d:equations))
; Equations domain where problems come from the Cognitive Tutor logs.
(define EquationsCTTestDomain
(Domain
"equations-ct/test"
(generator-from-templates (drop-right cognitive-tutor-templates 90))
fact-solves-goal?
d:equations))
(define TernaryAdditionDomain
(Domain
"ternary-addition"
generate-ternary-addition-problem
is-ternary-number-simplified?
d:ternary))
(define TernaryAdditionTestDomain
(Domain
"ternary-addition/test"
generate-ternary-addition-problem
is-ternary-number-simplified?
d:ternary))
(define SortingDomain
(Domain
"sorting"
generate-sorting-problem
is-sorting-list-sorted?
d:sorting))
(define SortingTestDomain
(Domain
"sorting/test"
generate-sorting-problem
is-sorting-list-sorted?
d:sorting))
(define FractionDomain
(Domain
"fraction"
generate-fraction-problem
is-fraction-simplified?
d:fraction))
(define AllDomains
(list
EquationsDomain EquationsTestDomain
EquationsCTDomain EquationsCTTestDomain
TernaryAdditionDomain TernaryAdditionTestDomain
SortingDomain SortingTestDomain
FractionDomain
))
(define (get-domain-by-name name)
(or
(findf (lambda (d) (equal? (Domain-name d) name)) AllDomains)
(raise-user-error (format "Cannot find domain '~a' ~a"
name
(map Domain-name AllDomains)))))
; Serialization utils.
; Returns a unique string representing each axiom.
(define (axiom->string a)
(match a
[(== 'assumption) "assumption"]
[(== a:flip-equality) "a:flip-equality"]
[(== a:commutativity) "a:commutativity"]
[(== a:subtraction-commutativity) "a:subtraction-commutativity"]
[(== a:subtraction-same) "a:subtraction-same"]
[(== a:associativity) "a:associativity"]
[(== a:binop-eval) "a:binop-eval"]
[(== a:add-zero) "a:add-zero"]
[(== a:mul-zero) "a:mul-zero"]
[(== a:mul-one) "a:mul-one"]
[(== a:distributivity) "a:distributivity"]
[(== a:substitute-both-sides) "a:substitute-both-sides"]
[(== a:op-both-sides) "a:op-both-sides"]
[(== td:add-consecutive) "td:add-consecutive"]
[(== td:swap) "td:swap"]
[(== td:erase-zero) "td:erase-zero"]
[(== sd:swap) "sd:swap"]
[(== sd:reverse) "sd:reverse"]
[(== fd:cancel-common-factor) "fd:cancel-common-factor"]
[(== fd:factorize) "fd:factorize"]
[(== fd:merge-two-fractions) "fd:merge-two-fractions"]
[(== fd:mul-scaling-factor) "fd:mul-scaling-factor"]
[(== fd:binop-eval) "fd:binop-eval"]
[(== fd:convert-into-fraction) "fd:convert-into-fraction"]
[(== fd:commutativity) "fd:commutativity"]
))
; Inverts axiom->string.
(define (string->axiom s)
(match s
[(== "assumption") 'assumption]
[(== "a:flip-equality") a:flip-equality]
[(== "a:commutativity") a:commutativity]
[(== "a:subtraction-commutativity") a:subtraction-commutativity]
[(== "a:subtraction-same") a:subtraction-same]
[(== "a:associativity") a:associativity]
[(== "a:binop-eval") a:binop-eval]
[(== "a:add-zero") a:add-zero]
[(== "a:mul-zero") a:mul-zero]
[(== "a:mul-one") a:mul-one]
[(== "a:distributivity") a:distributivity]
[(== "a:substitute-both-sides") a:substitute-both-sides]
[(== "a:op-both-sides") a:op-both-sides]
[(== "td:add-consecutive") td:add-consecutive]
[(== "td:swap") td:swap]
[(== "td:erase-zero") td:erase-zero]
[(== "sd:swap") sd:swap]
[(== "sd:reverse") sd:reverse]
[(== "fd:cancel-common-factor") fd:cancel-common-factor]
[(== "fd:factorize") fd:factorize]
[(== "fd:merge-two-fractions") fd:merge-two-fractions]
[(== "fd:mul-scaling-factor") fd:mul-scaling-factor]
[(== "fd:binop-eval") fd:binop-eval]
[(== "fd:convert-into-fraction") fd:convert-into-fraction]
[(== "fd:commutativity") fd:commutativity]
))
(provide
EquationsDomain
TernaryAdditionDomain
AllDomains
get-domain-by-name
axiom->string
string->axiom)