Sciweavers

325 search results - page 57 / 65
» Abstract Rewriting
Sort
View
ICDT
2001
ACM
86views Database» more  ICDT 2001»
13 years 12 months ago
Minimizing View Sets without Losing Query-Answering Power
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...
Chen Li, Mayank Bawa, Jeffrey D. Ullman
INAP
2001
Springer
13 years 12 months ago
Towards Reconciling Use Cases via Controlled Language and Graphical Models
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...
Kathrin Böttger, Rolf Schwitter, Diego Moll&a...
AGP
1997
IEEE
13 years 11 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
LACL
1998
Springer
13 years 11 months ago
Strict Compositionality and Literal Movement Grammars
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
Marcus Kracht
LICS
1997
IEEE
13 years 11 months ago
Ground Reducibility is EXPTIME-Complete
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...
Hubert Comon, Florent Jacquemard