Sciweavers

351 search results - page 11 / 71
» Perfect Constraints Are Tractable
Sort
View
ICDT
2009
ACM
198views Database» more  ICDT 2009»
14 years 8 months ago
Consistent query answering under primary keys: a characterization of tractable queries
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a max...
Jef Wijsen
AAAI
2006
13 years 9 months ago
Tractable Classes of Metric Temporal Problems with Domain Rules
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
T. K. Satish Kumar
CSCLP
2007
Springer
14 years 1 months ago
Generalizing Global Constraints Based on Network Flows
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan
CP
2008
Springer
13 years 9 months ago
Perfect Derived Propagators
When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both wi...
Christian Schulte, Guido Tack
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...