160 search results - page 8 / 32 » Structural characterizations of schema-mapping languages |
121
click to vote
CALCO
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
116
click to vote
ECAI
1994
Springer
15 years 5 months ago
1994
Springer
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...
124
click to vote
ACM
1995
15 years 5 months ago
1995
: Systems are written in systems implementation languages. What characterizes such languages in the mid-1990’s? This paper identifies the typical environment that a system is bei...
106
click to vote
ACTA
2007
15 years 1 months ago
2007
The study of hairpin-free words has been initiated in the context of DNA computing. DNA strands that, theoretically speaking, are finite strings over the alphabet {A, G, C, T} are...