In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these ty...
The advent of proof-carrying code has generated significant interest in reasoning about low-level languages. It is widely believed that low-level languages with jumps must be diff...
Learning tasks from a single demonstration presents a significant challenge because the observed sequence is inherently an incomplete representation of the procedure that is speci...
Hyuckchul Jung, James F. Allen, Nathanael Chambers...
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
Explaining how engineering devices work is important to students, engineers, and operators. In general, machine generated explanations have been produced from a particular perspec...