400 search results - page 7 / 80 » Logical relations for monadic types |
LICS
2002
IEEE
14 years 14 days ago
2002
IEEE
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
STACS
2001
Springer
13 years 12 months ago
2001
Springer
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
LICS
2010
IEEE
13 years 6 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...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
ENTCS
2008
13 years 7 months ago
2008
CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concu...