Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1132119,
author = {Vaculík, Karel and Popelínský, Lubomír and Mráková, Eva and Jurčo, Juraj},
address = {Sophia Antipolis, France},
booktitle = {Proceedings of the 12th European Conference on e-Learning ECEL 2013},
editor = {Mélanie Ciussi, Marc Augier},
keywords = {graph mining; logic proofs; resolution; automatic evaluation; frequent subgraphs; classification},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Sophia Antipolis, France},
isbn = {978-1-909507-84-5},
pages = {495-502},
publisher = {Academic Conferences and Publishing International},
title = {Tutoring and Automatic Evaluation of Logic Proofs},
year = {2013}
}
TY - JOUR
ID - 1132119
AU - Vaculík, Karel - Popelínský, Lubomír - Mráková, Eva - Jurčo, Juraj
PY - 2013
TI - Tutoring and Automatic Evaluation of Logic Proofs
PB - Academic Conferences and Publishing International
CY - Sophia Antipolis, France
SN - 9781909507845
KW - graph mining
KW - logic proofs
KW - resolution
KW - automatic evaluation
KW - frequent subgraphs
KW - classification
N2 - Tutoring of logic proofs is an important part of undergraduate courses of logic. Commonly, a tutor trains and tests students’ skills to build correct logic proofs. We introduce a system for training of students’ ability to construct correct proofs in propositional or predicate logic. In addition to common techniques including presentations supported by slides and exercises we use animations which are based on carefully selected demonstrative examples and their step-by-step solutions. Animations are interactive so that a student may choose a particular step, a sequence of steps, and/or a particular task. In order to test students’ knowledge, we prepared a questionnaire that captures the entire process of a logic proof construction. A student constructs a proof and then answers questions from the questionnaire. We describe the design of the questionnaire and discuss its dis/advantages. We then apply frequent subgraph mining together with supervised machine learning algorithms to perform an automatic evaluation of correctness of the proofs. In addition to classifying the proofs as correct or incorrect, a report containing the summary of errors and suggested penalty points is produced.
ER -
VACULÍK, Karel, Lubomír POPELÍNSKÝ, Eva MRÁKOVÁ a Juraj JURČO. Tutoring and Automatic Evaluation of Logic Proofs. Online. In Mélanie Ciussi, Marc Augier. \textit{Proceedings of the 12th European Conference on e-Learning ECEL 2013}. Sophia Antipolis, France: Academic Conferences and Publishing International, 2013, s.~495-502. ISBN~978-1-909507-84-5.
|
