681 search results - page 29 / 137 » Combining Theorem Proving with Natural Language Processing |
JCSS
2010
14 years 8 months ago
2010
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
LFCS
2007
Springer
15 years 3 months ago
2007
Springer
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikk...
CSFW
1997
IEEE
15 years 1 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
66
Voted
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
NLPRS
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we present a computational view of an automatic summary generator based on a discourse model that combines semantic, rhetorical and intentional knowledge in order to...