681 search results - page 11 / 137 » Combining Theorem Proving with Natural Language Processing |
EACL
2006
ACL Anthology
13 years 9 months ago
2006
ACL Anthology
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
CICLING
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents a method for cross-language question answering. The method combines multiple query translations in order to improve the answering precision. The combination of ...
TPHOL
1999
IEEE
14 years 9 hour ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
LORI
2009
Springer
14 years 2 months ago
2009
Springer
Arrow’s Theorem is a central result in social choice theory. It states that, under certain natural conditions, it is impossible to aggregate the preferences of a finite set of i...
CICLING
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Polarities are used to sanction grammar fragment combination in high level tree-based formalisms such as eXtenssible MetaGrammar (XMG) and polarized unification grammars...