summaryrefslogtreecommitdiff
path: root/aied2017/method.tex
diff options
context:
space:
mode:
authorTimotej Lazar <timotej.lazar@fri.uni-lj.si>2017-02-07 15:27:49 +0100
committerTimotej Lazar <timotej.lazar@fri.uni-lj.si>2017-02-07 15:27:49 +0100
commit5bb37737d5867e4770251e67dca7cf85b9872d0b (patch)
treeef8ef5e2c66427d9adfcaf388efe20cdb24e9004 /aied2017/method.tex
parent2eab11fe49bfa3b065bf178537ac3ff1afc79541 (diff)
Add conclusion
Diffstat (limited to 'aied2017/method.tex')
-rw-r--r--aied2017/method.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/aied2017/method.tex b/aied2017/method.tex
index 5b7614b..f3606c0 100644
--- a/aied2017/method.tex
+++ b/aied2017/method.tex
@@ -64,7 +64,7 @@ Even though our main interest is discovery of patterns, we can still use induced
\subsection{Generating hints}
-Once we have induced the rules for a given problem, we can use them to provide hints based on buggy or missing patterns. To generate a hint for an incorrect program, each rule is considered in turn.
+Once we have induced the rules for a given problem, we can use them to provide hints based on buggy or missing patterns. To generate a hint for an incorrect program, each rule is considered in turn. We consider two types of feedback: \emph{buggy} hints based on I-rules, and \emph{intent} hints based on C-rules.
First, all I-rules are checked to find any known incorrect patterns in the program. To find the most likely incorrect patterns, the rules are considered in the order of decreasing quality. If all patterns in the rule “$p_1 ∧ ⋯ ∧ p_k ⇒ \mathsf{incorrect}$” match, we highlight the relevant leaf nodes. As an aside, we found that most I-rules are based on a single pattern. For the incorrect \code{sum} program from the previous section, our method produces the following highlight: