179 search results - page 9 / 36 » Fixed-Point Query Languages for Linear Constraint Databases |
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Abduction is usually carried out on partially-defined predicates. In this paper we investigate abduction applied to fully-defined predicates, specifically linear arithmetic cons...
ICDE
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract Although e-commerce is becoming popular, product rules, which describe various conditions such as prices, applicability, and discount conditions are still expressed in nat...
PODS
1999
ACM
13 years 12 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
DOCENG
2009
ACM
14 years 2 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
EDBT
2008
ACM
13 years 9 months ago
2008
ACM
The goal of the Semantic Web is to support semantic interoperability between applications exchanging data on the web. The idea heavily relies on data being made available in machi...