889 search results - page 31 / 178 » Problems in Rewriting III |
TCS
1998
13 years 9 months ago
1998
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
ICSE
2008
IEEE-ACM
14 years 10 months ago
2008
IEEE-ACM
WS-BPEL applications are a kind of service-oriented application. They use XPath extensively to integrate loosely-coupled workflow steps. However, XPath may extract wrong data from...
CADE
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
LICS
1994
IEEE
14 years 2 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...