3134 search results - page 6 / 627 » Computing full disjunctions |
89
Voted
CP
2007
Springer
15 years 8 months ago
2007
Springer
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
93
Voted
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. This article introduces KWQL, spoken “quickel”, a rulebased query language for a semantic wiki based on the label-keyword query paradigm. KWQL allows for rich combine...
PODS
2003
ACM
16 years 1 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
136
click to vote
CONCUR
1992
Springer
15 years 5 months ago
1992
Springer
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...
58
Voted
SOFSEM
2009
Springer
15 years 10 months ago
2009
Springer