681 search results - page 38 / 137 » Combining Theorem Proving with Natural Language Processing |
ENTCS
2002
14 years 9 months ago
2002
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
RANLP
2003
14 years 11 months ago
2003
Existing statistical approaches to natural language problems are very coarse approximations to the true complexity of language processing. As such, no single technique will be bes...
TPHOL
2005
IEEE
15 years 3 months ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
APLAS
2005
ACM
14 years 11 months ago
2005
ACM
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
102
click to vote
WOODPECKER
2001
14 years 11 months ago
2001
Ensuring that specifications are consistent is an important part of specification development and testing. In this paper we introduce the ConsVISor tool for consistency checking o...