One particular type of question which was made the focus of its own subtask within the TREC2003 QA track was the definition question (“What is X?” or “Who is X?”). One of the main problems with this type of question is how to discriminate in vast text collections between definitional and non-definitional text passages about a particular definiendum (i.e., the term to be defined). A method will ...

In this paper, we argue that, in order to account for the apparently substantive nature of definitional disputes, a commitment what call ‘Socratic essentialism’ is needed. We defend Socratic essentialism against prominent neo-Carnapian challenge according which disputes always some way trace back disagreements over how expressions belonging particular language or concepts certain conceptual sch...

Isabelle/HOL has recently acquired new versions of definitional packages for inductive datatypes and primitive recursive functions. In contrast to its predecessors and most other implementations, Isabelle/HOL datatypes may be mutually and indirect recursive, even infinitely branching. We also support inverted datatype definitions for characterizing existing types as being inductive ones later. ...

providing a high-quality service for transmission and playing real-time voice conversations (voice streaming) over wireless ad-hoc networks is no mean feat. buffering together with adjusting the playout time of the packets is a receiver-side solution to overcome this challenge. in this paper, a new adaptive playout adjustment algorithm is proposed to stream the voice conversations over wireless...

We present a mechanized proof of the metatheory of LF, i.e. the decidability of typechecking and the existence and uniqueness of canonical forms. We use a syntactic approach in which we define a translation from LF to its canonical forms presentation (in which only beta-short, eta-long terms are well-formed) and prove soundness and completeness of the translation, establishing that definitional...