Sciweavers

1039 search results - page 23 / 208
» Query reformulation with constraints
Sort
View
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
14 years 7 months ago
The Piazza peer data management project
A major problem in today's information-driven world is that sharing heterogeneous, semantically rich data is incredibly difficult. Piazza is a peer data management system tha...
Igor Tatarinov, Zachary G. Ives, Jayant Madhavan, ...
SEMWEB
2009
Springer
14 years 1 months ago
Learning Semantic Query Suggestions
An important application of semantic web technology is recognizing human-defined concepts in text. Query transformation is a strategy often used in search engines to derive querie...
Edgar Meij, Marc Bron, Laura Hollink, Bouke Huurni...
SARA
2005
Springer
14 years 27 days ago
Compositional Derivation of Symmetries for Constraint Satisfaction
This paper reconsiders the problems of discovering symmetries in constraint satisfaction problems (CSPs). It proposes a compositional approach which derives symmetries of the appli...
Pascal Van Hentenryck, Pierre Flener, Justin Pears...
CPAIOR
2010
Springer
14 years 6 days ago
The Increasing Nvalue Constraint
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca...
CP
2006
Springer
13 years 11 months ago
Revisiting the Sequence Constraint
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
Willem Jan van Hoeve, Gilles Pesant, Louis-Martin ...