4767 search results - page 142 / 954 » Structures for Abstract Rewriting |
95
Voted
ICDT
2001
ACM
15 years 6 months ago
2001
ACM
Abstract. The problem of answering queries using views has been studied extensively due to its relevance in a wide variety of data-management applications. In these applications, w...
135
Voted
INAP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. In requirements engineering use cases are employed to describe the ow of events and the occurrence of states in a future information system. Use cases consist of a set of...
133
Voted
AGP
1997
IEEE
15 years 6 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
LICS
1997
IEEE
15 years 6 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
102
click to vote
ITP
2010
15 years 6 months ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...