672 search results - page 14 / 135 » On the Expressive Power of the Loop Language |
105
click to vote
ASWC
2006
Springer
15 years 5 months ago
2006
Springer
With the growing interest in modular ontology languages to address the need for collaborative development, integration, and use of ontologies on the Web, there is an urgent need fo...
105
Voted
CSL
2007
Springer
15 years 8 months ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
81
Voted
EXTREME
2003
ACM
15 years 7 months ago
2003
ACM
DTDs and XML Schema are important validation languages for XML documents. They lie at opposite ends of a spectrum of validation languages in terms of expressive power and readabil...
103
click to vote
PLDI
2010
ACM
15 years 11 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
234
click to vote
POPL
2004
ACM
16 years 2 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...