Sciweavers

367 search results - page 72 / 74
» A Rewriting Logic Sampler
Sort
View
XPU
2004
Springer
14 years 1 months ago
An Agile Approach to a Legacy System
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...
Chris Stevenson, Andy Pols
SSDBM
2003
IEEE
83views Database» more  SSDBM 2003»
14 years 1 months ago
PiQA: An Algebra for Querying Protein Data Sets
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...
Sandeep Tata, Jignesh M. Patel
PLDI
2003
ACM
14 years 1 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
LPNMR
2009
Springer
14 years 12 days ago
Manifold Answer-Set Programs for Meta-reasoning
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...
Wolfgang Faber, Stefan Woltran
ICDT
2010
ACM
147views Database» more  ICDT 2010»
13 years 11 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
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...
Sara Cohen, Benny Kimelfeld