39 search results - page 4 / 8 » Ordering Constraints over Feature Trees Expressed in Second-... |
FOSSACS
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of ...
81
Voted
DLT
2008
14 years 11 months ago
2008
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
88
Voted
IANDC
2007
14 years 10 months ago
2007
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
106
Voted
RTA
2000
Springer
15 years 1 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
96
Voted
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...