Sciweavers

1968 search results - page 94 / 394
» The Complexity of Valued Constraint Models
Sort
View
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
16 years 2 months ago
Efficient Approximation Algorithms for Repairing Inconsistent Databases
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
Andrei Lopatenko, Loreto Bravo
UAI
2004
15 years 2 months ago
Sensitivity Analysis in Bayesian Networks: From Single to Multiple Parameters
Previous work on sensitivity analysis in Bayesian networks has focused on single parameters, where the goal is to understand the sensitivity of queries to single parameter changes...
Hei Chan, Adnan Darwiche
AI
2010
Springer
15 years 1 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
CP
2004
Springer
15 years 6 months ago
Controllability of Soft Temporal Constraint Problems
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
Francesca Rossi, Kristen Brent Venable, Neil Yorke...
DLOG
2008
15 years 3 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer