109 search results - page 13 / 22 » Characterization of Logics over Ranked Tree Languages |
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
PLDI
2010
ACM
15 years 7 months ago
2010
ACM
An ad hoc data format is any non-standard, semi-structured data format for which robust data processing tools are not available. In this paper, we present ANNE, a new kind of mark...
103
click to vote
SEMWEB
2009
Springer
15 years 2 months ago
2009
Springer
Abstract—For many tasks, such as the integration of knowledge bases in the semantic web, one must not only handle the knowledge itself, but also characterizations of this knowled...
ENTCS
2002
14 years 9 months ago
2002
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
IAT
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...