1039 search results - page 81 / 208 » Query reformulation with constraints |
177
Voted
FQAS
2004
Springer
15 years 10 months ago
2004
Springer
In the context of relational as well as deductive databases, correct and efficient integrity checking is a crucial issue, as, without any guarantee of data consistency, the answers...
169
Voted
VLDB
2000
ACM
15 years 9 months ago
2000
ACM
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
153
click to vote
ICLP
2005
Springer
15 years 11 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...
163
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
133
click to vote
TIME
1998
IEEE
15 years 10 months ago
1998
IEEE
The use of causal rules or fluent dependency constraints has proven to provide a versatile means of dealing with the ramification problem. In this paper we show how fluent depende...