Sciweavers

681 search results - page 1 / 137
» Combining Theorem Proving with Natural Language Processing
Sort
View
CADE
2008
Springer
14 years 4 months ago
Combining Theorem Proving with Natural Language Processing
Abstract. The LogAnswer system is an application of automated reasoning to the field of open domain question-answering, the retrieval of answers to natural language questions regar...
Björn Pelzer, Ingo Glöckner
ICFP
2005
ACM
14 years 4 months ago
Combining programming with theorem proving
Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support of practical programming. In ATS, the definition of ...
Chiyan Chen, Hongwei Xi
ACL
1990
13 years 5 months ago
Algorithms for Generation in Lambek Theorem Proving
We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This stra...
Erik-Jan van der Linden, Guido Minnen
EACL
1989
ACL Anthology
13 years 5 months ago
Lambek Theorem Proving And Feature Unification
CT Feature Unification can be integrated with Lambek Theorem Proving in a simple and straightforward way. Two principles determine all distribution of features in LTP. It is not ne...
Erik-Jan van der Linden
ACL
1996
13 years 5 months ago
Higher-Order Coloured Unification and Natural Language Semantics
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interfac...
Claire Gardent, Michael Kohlhase