6 papers
NILE: Formalizing Natural-Language Descriptions of Formal Languages
Tristan Kneisel, Marko Schmellenkamp, Fabian Vehlken +1
This paper explores how natural-language descriptions of formal languages can be compared to their formal representations and how semantic differences can be explained. This is mot…
Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas
Fabian Vehlken, Thomas Zeume, Emilio Carrasco Bustamante +2
First-order logic is the basis for many knowledge representation formalisms and methods. Providing technological support for learning to write first-order formulas for natural lang…
Logical Modelling in CS Education: Bridging the Natural Language Gap
Tristan Kneisel, Fabian Vehlken, Thomas Zeume
An important learning objective for computer science students is to learn how to formalize descriptions of real world scenarios in order to subsequently solve real world challenges…
Learning Tree Pattern Transformations
Daniel Neider, Leif Sabellek, Johannes Schmidt +2
Explaining why and how a tree structurally differs from another tree is a question that is encountered throughout computer science, including in understanding tree-st…
Tool-Assisted Learning of Computational Reductions
Tristan Kneisel, Elias Radtke, Marko Schmellenkamp +2
Computational reductions are an important and powerful concept in computer science. However, they are difficult for many students to grasp. In this paper, we outline a concept for…
Specification and Automatic Verification of Computational Reductions
Julien Grange, Fabian Vehlken, Nils Vortmeier +1
We are interested in the following validation problem for computational reductions: for algorithmic problems and , is a given candidate reduction indeed a reduction fr…