838 search results - page 2 / 168 » From Natural Language to Formal Proof Goal |
IWFM
1998
13 years 7 months ago
1998
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
IFL
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
KCAP
2005
ACM
13 years 11 months ago
2005
ACM
An ultimate goal of AI is to build end-to-end systems that interpret natural language, reason over the resulting logical forms, and perform actions based on that reasoning. This r...
CIE
2008
Springer
13 years 7 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
COGSYS
2005
Springer
13 years 7 months ago
2005
Springer
Abstract. Natural language interaction between a student and a tutoring or an assistance system for mathematics is a new multi-disciplinary challenge that requires the interaction ...