265 search results - page 20 / 53 » Logical Queries over Views: Decidability and Expressiveness |
121
Voted
CADE
1998
Springer
15 years 2 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
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 ...
DASFAA
2003
IEEE
15 years 3 months ago
2003
IEEE
To integrate many data sources we use a peer mediator framework where views defined in the peers are logically composed in terms of each other. A common approach to execute queri...
PODS
2007
ACM
15 years 10 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
PODS
2007
ACM
15 years 10 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...