Sciweavers

1423 search results - page 283 / 285
» Languages of Nested Trees
Sort
View
AI
2010
Springer
14 years 9 months ago
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
Christopher Jefferson, Neil C. A. Moore, Peter Nig...
CORR
2007
Springer
133views Education» more  CORR 2007»
14 years 9 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
ENTCS
2007
168views more  ENTCS 2007»
14 years 9 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
TASLP
2008
201views more  TASLP 2008»
14 years 9 months ago
Syntactically Lexicalized Phrase-Based SMT
Abstract--Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic knowledge caused system performance to deteriorate. The most recent su...
Hany Hassan, Khalil Sima'an, Andy Way
ASE
2005
137views more  ASE 2005»
14 years 9 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund