3440 search results - page 370 / 688 » Logics For Context-Free Languages |
192
click to vote
NJC
2006
15 years 7 months ago
2006
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
223
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
338
Voted
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
177
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
193
Voted
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...