681 search results - page 44 / 137 » Combining Theorem Proving with Natural Language Processing |
171
click to vote
POPL
2008
ACM
16 years 3 days ago
2008
ACM
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
IFL
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Parser combinators, often monadic, are a venerable and widelyused solution to read data from some external format. However, the capability to return a partial parse has, ...
IDEAS
1997
IEEE
15 years 4 months ago
1997
IEEE
The ROL system is a novel deductive object-oriented database system that has been implemented at the University of Regina. It provides a uniform rule-based declarative language fo...
TLCA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
TDM
2004
15 years 1 months ago
2004
Document-centric XML collections contain text-rich documents, marked up with XML tags. The tags add lightweight semantics to the text. Querying such collections calls for a hybrid...