Sciweavers

815 search results - page 139 / 163
» Algebraic Recognizability of Languages
Sort
View
EACL
1989
ACL Anthology
15 years 29 days ago
A logical treatment of semi-free word order and bounded discontinuous constituency
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...
Mike Reape
SAC
2010
ACM
15 years 1 hour ago
Data-aware design and verification of service compositions with Reo and mCRL2
Service-based systems can be modeled as stand-alone services coordinated by external connectors. Reo is a channelbased coordination language with well-defined semantics that enabl...
Natallia Kokash, Christian Krause, Erik P. de Vink
GRID
2006
Springer
14 years 11 months ago
Workflow Global Computing with YML
In this paper we propose a framework dedicated to the development and the execution of parallel applications over large scale global computing platforms. A workflow programming env...
Olivier Delannoy, Nahid Emad, Serge G. Petiton
CORR
2004
Springer
100views Education» more  CORR 2004»
14 years 11 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
PPDP
2010
Springer
14 years 10 months ago
Deriving predicate statistics in datalog
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...
Senlin Liang, Michael Kifer