Sciweavers

89 search results - page 12 / 18
» On the Translation of Procedures to Finite Machines
Sort
View
APAL
2005
107views more  APAL 2005»
13 years 7 months ago
Uniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
Ulrich Berger
ACL
2008
13 years 9 months ago
Decompounding query keywords from compounding languages
Splitting compound words has proved to be useful in areas such as Machine Translation, Speech Recognition or Information Retrieval (IR). Furthermore, real-time IR systems (such as...
Enrique Alfonseca, Slaven Bilac, Stefan Pharies
COLING
2010
13 years 2 months ago
Effective Constituent Projection across Languages
We describe an effective constituent projection strategy, where constituent projection is performed on the basis of dependency projection. Especially, a novel measurement is propo...
Wenbin Jiang, Yajuan Lv, Yang Liu, Qun Liu
PODS
2005
ACM
99views Database» more  PODS 2005»
14 years 8 months ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...
ASE
2005
137views more  ASE 2005»
13 years 7 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