-
Notifications
You must be signed in to change notification settings - Fork 1
/
Max.hs
228 lines (187 loc) · 7.71 KB
/
Max.hs
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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
{-# LANGUAGE ApplicativeDo #-}
{-# LANGUAGE FlexibleContexts #-}
{-# language RecordWildCards #-}
{-# LANGUAGE NamedFieldPuns #-}
module LogicTasks.Semantics.Max where
import Control.OutputCapable.Blocks (
GenericOutputCapable (..),
LangM,
OutputCapable,
english,
german,
translate,
translations,
localise,
)
import Data.List ((\\))
import Data.Maybe (fromMaybe)
import Test.QuickCheck (Gen)
import Config (BaseConfig(..), CnfConfig(..), MaxInst(..), MinMaxConfig(..))
import Formula.Util (hasEmptyClause, isEmptyCnf, mkClause, mkCnf)
import Formula.Table (readEntries)
import Formula.Types (Cnf, Formula, Literal(..), amount, atomics, genCnf, getClauses, getTable)
import LogicTasks.Helpers (formulaKey, example, extra)
import Util (checkTruthValueRange, pairwiseCheck, prevent, preventWithHint, tryGen, withRatio, checkCnfConf)
import Control.Monad (when)
import Formula.Parsing.Delayed (Delayed, withDelayed, displayParseError, withDelayedSucceeding)
import Formula.Parsing (Parse(..))
genMaxInst :: MinMaxConfig -> Gen MaxInst
genMaxInst MinMaxConfig {cnfConf = CnfConfig {baseConf = BaseConfig{..},..},..} = do
cnf <- cnfInRange
pure $ MaxInst {
cnf
, showSolution = printSolution
, addText = extraText
, unicodeAllowed = offerUnicodeInput
}
where
getCnf = genCnf (minClauseAmount, maxClauseAmount) (minClauseLength, maxClauseLength) usedLiterals
cnfInRange = tryGen getCnf 100 $ withRatio $ fromMaybe (0,100) percentTrueEntries
description :: OutputCapable m => MaxInst -> LangM m
description MaxInst{..} = do
paragraph $ do
translate $ do
german "Betrachten Sie die folgende Wahrheitstafel:"
english "Consider the following truth table:"
indent $ code $ show $ getTable cnf
pure ()
paragraph $ translate $ do
german "Geben Sie eine zu der Tafel passende Formel in konjunktiver Normalform an. Verwenden Sie dazu Max-Terme."
english "Provide a formula in conjunctive normal form, that corresponds to the table. Use maxterms to do this."
formulaKey unicodeAllowed
-- jscpd:ignore-start
paragraph $ indent $ do
translate $ do
let formulaStr = show $ mkCnf [mkClause [Literal 'A', Not 'B'], mkClause [Not 'C', Not 'D']]
german $ unwords ["Ein Lösungsversuch für Formel", formulaStr, "könnte beispielsweise so aussehen: "]
english $ unwords ["A solution attempt for the formula", formulaStr, "could look like this: "]
translatedCode $ flip localise $ translations exampleCode
pure ()
-- jscpd:ignore-end
extra addText
pure ()
where
exampleCode | unicodeAllowed = do
german "(A ∨ ¬B) und (nicht C oder nicht D)"
english "(A ∨ ¬B) and (not C or not D)"
| otherwise = do
german "(A oder nicht B) und (nicht C oder nicht D)"
english "(A or not B) and (not C or not D)"
verifyStatic :: OutputCapable m => MaxInst -> LangM m
verifyStatic MaxInst{..}
| isEmptyCnf cnf || hasEmptyClause cnf =
refuse $ indent $ translate $ do
german "Geben Sie bitte eine nicht-triviale Formel an."
english "Please give a non-trivial formula."
| otherwise = pure()
verifyQuiz :: OutputCapable m => MinMaxConfig -> LangM m
verifyQuiz MinMaxConfig{..} = do
checkTruthValueRange (low,high)
checkCnfConf cnfConf
pure ()
where
(low,high) = fromMaybe (0,100) percentTrueEntries
start :: Cnf
start = mkCnf [mkClause [Literal 'A']]
partialMinMax :: (OutputCapable m, Formula f) => [Literal] -> f -> f -> Bool -> Bool -> LangM m
partialMinMax correctLits correct solution allValidTerms isMaxTermTask = do
preventWithHint (not $ null extraLiterals)
(translate $ do
german "Angegebene Literale kommen in Aufgabe vor?"
english "Given literals are used in task?"
)
(paragraph $ do
translate $ do
german "Es sind unbekannte Literale enthalten. Diese Literale kommen in der korrekten Lösung nicht vor: "
english "Your submission contains unknown literals. These do not appear in a correct solution: "
itemizeM $ map (text . show) extraLiterals
pure ()
)
preventWithHint (not $ null missing)
(translate $ do
german "Alle Literale kommen vor?"
english "All literals are contained in solution?"
)
(paragraph $ do
translate $ do
german "Es fehlen Literale. Fügen Sie diese Literale der Abgabe hinzu: "
english "Some literals are missing. Add these literals to your submission: "
itemizeM $ map (text . show) missing
pure ()
)
prevent allValidTerms $
translate $ do
german $ "Alle " ++ gSubElements ++ " sind " ++ gTerms ++ "?"
english $ "All " ++ eSubElements ++ " are " ++ eTerms ++ "?"
preventWithHint (solLen < corrLen)
(translate $ do
german $ "Genügend " ++ gTerms ++ " in Lösung?"
english $ "Solution contains enough " ++ eTerms ++ "?"
)
(paragraph $ do
translate $ do
german $ "Die angegebene Formel enthält zu wenige " ++ gTerms ++ ". Fügen sie "
english $ "The formula does not contain enough " ++ eTerms ++ ". Add "
text diff
translate $ do
german " hinzu!"
english "!"
pure ()
)
preventWithHint (solLen > corrLen)
(translate $ do
german $ "Nicht zu viele " ++ gTerms ++ " in Lösung?"
english $ "Not too many " ++ eTerms ++ " in solution?"
)
(paragraph $ do
translate $ do
german $ " Die angegebene Formel enthält zu viele " ++ gTerms ++ ". Entfernen sie "
english $ "The formula contains too many " ++ eTerms ++ ". Remove "
text $ diff ++ "!"
pure ()
)
pure ()
where
solLits = atomics solution
extraLiterals = solLits \\ correctLits
missing = correctLits \\ solLits
table = getTable correct
corrLen = length $ filter (== Just False) (readEntries table)
solLen = amount solution
diff = show $ abs (solLen - corrLen)
(gTerms, gSubElements, eTerms, eSubElements)= if isMaxTermTask
then ("Maxterme", "Klauseln", "maxterms", "clauses") -- no-spell-check
else ("Minterme", "Konjunktionen", "minterms", "conjunctions") -- no-spell-check
partialGrade :: OutputCapable m => MaxInst -> Delayed Cnf -> LangM m
partialGrade inst = (partialGrade' inst `withDelayed` parser) displayParseError
partialGrade' :: OutputCapable m => MaxInst -> Cnf -> LangM m
partialGrade' MaxInst{..} sol = partialMinMax corLits cnf sol allMaxTerms True
where
corLits = atomics cnf
allMaxTerms = not $ all (\c -> amount c == length corLits) $ getClauses sol
completeMinMax :: (OutputCapable m, Formula f, Show f) => Bool -> f -> f -> LangM m
completeMinMax showSolution correct solution =
preventWithHint (not $ null diff)
(translate $ do
german "Lösung liefert korrekte Wahrheitstabelle?"
english "Solution gives correct truth table?"
)
(do
paragraph $ do
translate $ do
german "Es existieren falsche Einträge in den folgenden Tabellenzeilen: "
english "The following rows are not correct: "
itemizeM $ map (text . show) diff
pure ()
when showSolution $ example (show correct) $ do
english "A possible solution for this task is:"
german "Eine mögliche Lösung für die Aufgabe ist:"
pure ()
)
where
solTable = getTable solution
(_,diff) = pairwiseCheck (zip3 (readEntries solTable) (readEntries $ getTable correct) [1..])
completeGrade :: OutputCapable m => MaxInst -> Delayed Cnf -> LangM m
completeGrade inst = completeGrade' inst `withDelayedSucceeding` parser
completeGrade' :: OutputCapable m => MaxInst -> Cnf -> LangM m
completeGrade' MaxInst{..} = completeMinMax showSolution cnf