229 search results - page 24 / 46 » Natural Language Proof Explanation |
PPDP
2009
Springer
14 years 1 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
CSL
1999
Springer
13 years 11 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
IUI
2003
ACM
14 years 18 hour ago
2003
ACM
Computational humor will be needed in interfaces, no less than other cognitive capabilities. There are many practical settings where computational humor will add value. Among them...
CORR
2002
Springer
13 years 6 months ago
2002
Springer
An important component of any generation system is the mapping dictionary, a lexicon of elementary semantic expressions and corresponding natural language realizations. Typically,...
ECOOP
2006
Springer
13 years 10 months ago
2006
Springer
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...