367 search results - page 72 / 74 » A Rewriting Logic Sampler |
174
click to vote
XPU
2004
Springer
15 years 10 months ago
2004
Springer
We describe how a small, successful, self-selected XP team approached a seemingly intractable problem with panache, flair and immodesty. We rewrote a legacy application by deliver...
137
click to vote
SSDBM
2003
IEEE
15 years 10 months ago
2003
IEEE
Life science researchers frequently need to query large protein data sets in a variety of different ways. Protein data sets have a rich structure that includes its primary structu...
163
Voted
PLDI
2003
ACM
15 years 10 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
134
Voted
LPNMR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
190
click to vote
ICDT
2010
ACM
15 years 8 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...