Sciweavers

6456 search results - page 293 / 1292
» Constraint Solving on Terms
Sort
View
FQAS
2006
Springer
186views Database» more  FQAS 2006»
15 years 10 months ago
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Jef Wijsen
JSC
2010
103views more  JSC 2010»
15 years 5 months ago
Anti-patterns for rule-based languages
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pie...
JSC
2010
107views more  JSC 2010»
15 years 1 months ago
On the relation between Context and Sequence Unification
Both Sequence and Context Unification generalize the same problem: Word Unification. Besides that, Sequence Unification solves equations between unranked terms involving sequence ...
Temur Kutsia, Jordi Levy, Mateu Villaret
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 9 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
PPDP
2001
Springer
15 years 11 months ago
When Do Bounds and Domain Propagation Lead to the Same Search Space?
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
Christian Schulte, Peter J. Stuckey