710 search results - page 77 / 142 » Relational Expressive Power of Constraint Query Languages |
KR
2010
Springer
14 years 17 days ago
2010
Springer
Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research...
IFIP
2007
Springer
14 years 1 months ago
2007
Springer
The shift of development effort onto the model level, as postulated by MDA, provides an opportunity for establishing a set of modelling constructs that is more intuitive and homoge...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
We present HERMES, a prototype system based on a powerful query language for trajectory databases, which enables the support of aggregative Location-Based Services (LBS). The key ...
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...