838 search results - page 63 / 168 » From Natural Language to Formal Proof Goal |
133
click to vote
ENTCS
2002
15 years 6 months ago
2002
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...
178
click to vote
ECML
2003
Springer
15 years 11 months ago
2003
Springer
Context-free grammars cannot be identified in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...
233
click to vote
POPL
2012
ACM
14 years 1 months ago
2012
ACM
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
164
click to vote
TCS
2010
15 years 4 months ago
2010
Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair...
142
click to vote
ML
2007
ACM
15 years 5 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...