Automatically Generating Problems and Solutions for Natural Deduction
نویسندگان
چکیده
Natural deduction, which is a method for establishing validity of propositional type arguments, helps develop important reasoning skills and is thus a key ingredient in a course on introductory logic. We present two core components, namely solution generation and practice problem generation, for enabling computer-aided education for this important subject domain. The key enabling technology is use of an offline-computed data-structure called Universal Proof Graph (UPG) that encodes all possible applications of inference rules over all small propositions abstracted using their bitvector-based truth-table representation. This allows an efficient forward search for solution generation. More interestingly, this allows generating fresh practice problems that have given solution characteristics by performing a backward search in UPG. We obtained around 300 natural deduction problems from various textbooks. Our solution generation procedure can solve many more problems than the traditional forward-chaining based procedure, while our problem generation procedure can efficiently generate several variants with desired characteristics.
منابع مشابه
Automated Generation of User Guidance by Combining Computation and Deduction
Herewith a fairly old concept is published first time and named “Lucas-Interpretation”, which has been implemented in a prototype, which has been proved useful in educational practice and which gains academic relevance with an emerging generation of educational math assistants (EMA) based on Computer Theorem Proving (CTP). Automated Theorem Proving (ATP), i.e. deduction is the appropriate techn...
متن کاملSimulation and Synthesis of Deduction Calculi
This paper gives an overview of two methods for automatically or semi-automatically generating deduction calculi from the semantic specification of a logic. One approach is based on simulating deduction approaches with techniques of automated reasoning and first-order resolution. The second approach synthesises sound, complete and terminating tableau calculi directly from the semantic specifica...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملAutomated Generation of Geometry Questions for High School Mathematics
We describe a framework that combines a combinatorial approach, pattern matching and automated deduction to generate and solve geometry problems for high school mathematics. Such a system would help teachers to quickly generate large numbers of questions on a geometry topic. Students can explore and revise specific topics covered in classes and textbooks based on generated questions. The system...
متن کامل$n$-factorization Property of Bilinear Mappings
In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...
متن کامل