Sciweavers

44 search results - page 6 / 9
» Refinement Semantics and Loop Rules
Sort
View
JELIA
2000
Springer
13 years 11 months ago
Considerations on Updates of Logic Programs
Abstract. Among others, Alferes et al. (1998) presented an approach for updating logic programs with sets of rules based on dynamic logic programs. We syntactically redefine dynami...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
PLDI
2012
ACM
11 years 10 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
POPL
2004
ACM
14 years 7 months ago
Abstractions from proofs
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
SIGMOD
2008
ACM
90views Database» more  SIGMOD 2008»
14 years 7 months ago
Toward best-effort information extraction
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
Warren Shen, Pedro DeRose, Robert McCann, AnHai Do...
MT
2002
297views more  MT 2002»
13 years 7 months ago
MARS: A Statistical Semantic Parsing and Generation-Based Multilingual Automatic tRanslation System
We present MARS (Multilingual Automatic tRanslation System), a research prototype speech-to-speech translation system. MARS is aimed at two-way conversational spoken language trans...
Yuqing Gao, Bowen Zhou, Zijian Diao, Jeffrey S. So...