1458 search results - page 46 / 292 » Extended Term Rewriting Systems |
SIGMOD
2011
ACM
14 years 18 days ago
2011
ACM
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
ICNP
1998
IEEE
15 years 2 months ago
1998
IEEE
To construct high performance Web servers, system builders are increasingly turning to distributed designs. An important challenge that arises in such designs is the need to direc...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
ESOP
2007
Springer
15 years 4 months ago
2007
Springer
When students first learn programming, they often rely on a simple operational model of a program’s behavior to explain how particular features work. Because such models build o...
123
click to vote
MST
2006
14 years 9 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...