Sciweavers

889 search results - page 20 / 178
» Problems in Rewriting III
Sort
View
ENTCS
2007
123views more  ENTCS 2007»
13 years 9 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
AICOM
2004
100views more  AICOM 2004»
13 years 9 months ago
Query rewriting with symmetric constraints
Abstract. We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous informatio...
Christoph Koch
CADE
2006
Springer
14 years 10 months ago
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
Maria Paola Bonacina, Silvio Ghilardi, Enrica Nico...
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 3 months ago
First-Order Query Rewriting for Inconsistent Databases
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate o...
Ariel Fuxman, Renée J. Miller
AMW
2010
13 years 11 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris