838 search results - page 132 / 168 » From Natural Language to Formal Proof Goal |
178
click to vote
APPROX
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
193
click to vote
TLDI
2010
ACM
15 years 6 months ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
203
Voted
TLDI
2003
ACM
15 years 11 months ago
2003
ACM
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
205
click to vote
ECCC
2007
15 years 6 months ago
2007
Is it possible for two intelligent beings to communicate meaningfully, without any common language or background? This question has interest on its own, but is especially relevant...
133
click to vote
SYNASC
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract. This paper is a first step towards a systematic evaluation of the possibilities to use membrane computing as a modeling framework for economics. Membrane computing is a ...