838 search results - page 67 / 168 » From Natural Language to Formal Proof Goal |
166
click to vote
SEMWEB
2009
Springer
16 years 20 days ago
2009
Springer
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
150
click to vote
NLPRS
2001
Springer
15 years 10 months ago
2001
Springer
This article reports the results of an analysis of translation equivalents in six languages from different language families, extracted from an on-line parallel corpus of George O...
140
click to vote
HRI
2007
ACM
15 years 10 months ago
2007
ACM
In many settings, such as home care or mobile environments, demands on users' attention, or users' anticipated level of formal training, or other on-site conditions will...
157
click to vote
IEEEARES
2008
IEEE
16 years 17 days ago
2008
IEEE
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
162
click to vote
SIGSOFT
2010
ACM
15 years 4 months ago
2010
ACM
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...