109 search results - page 14 / 22 » Characterization of Logics over Ranked Tree Languages |
200
click to vote
PODS
2009
ACM
16 years 1 months ago
2009
ACM
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
111
click to vote
CSL
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
200
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
135
click to vote
LICS
2007
IEEE
15 years 7 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
161
click to vote
CSCLP
2008
Springer
15 years 3 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...