838 search results - page 28 / 168 » From Natural Language to Formal Proof Goal |
GRAMMARS
2002
13 years 8 months ago
2002
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
KR
1998
Springer
14 years 22 days ago
1998
Springer
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot,...
ICCBR
2010
Springer
14 years 5 days ago
2010
Springer
This paper addresses the issue of adapting cases represented by plain text with the help of formal concept analysis and natural language processing technologies. The actual cases r...
CAV
1998
Springer
14 years 23 days ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
PLDI
2006
ACM
14 years 2 months ago
2006
ACM
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...