Sciweavers

18 search results - page 3 / 4
» The Complexity of Homomorphism and Constraint Satisfaction P...
Sort
View
AI
2008
Springer
13 years 7 months ago
Domain filtering consistencies for non-binary constraints
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
Christian Bessiere, Kostas Stergiou, Toby Walsh
CP
2006
Springer
13 years 11 months ago
Interactive Distributed Configuration
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...
Peter Tiedemann, Tarik Hadzic, Thomas Stuart Henne...
ER
1999
Springer
155views Database» more  ER 1999»
13 years 12 months ago
Detecting Redundancy in Data Warehouse Evolution
A Data Warehouse DW can be abstractly seen as a set of materialized views de ned over a set of remote data sources. A DW is intended to satisfy a set of queries. The views materi...
Dimitri Theodoratos
SAT
2005
Springer
129views Hardware» more  SAT 2005»
14 years 1 months ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah
SIGSOFT
2007
ACM
14 years 8 months ago
Detection and resolution of atomicity violation in service composition
Atomicity is a desirable property that safeguards application consistency for service compositions. A service composition exhibiting this property could either complete or cancel ...
Chunyang Ye, S. C. Cheung, W. K. Chan, Chang Xu