Sciweavers

980 search results - page 134 / 196
» Decentralized Constraint Satisfaction
Sort
View
CIKM
2008
Springer
13 years 11 months ago
Privacy-preserving data publishing for horizontally partitioned databases
There is an increasing need for sharing data repositories containing personal information across multiple distributed, possibly untrusted, and private databases. Such data sharing...
Pawel Jurczyk, Li Xiong
WWW
2007
ACM
14 years 9 months ago
Bridging the gap between OWL and relational databases
Schema statements in OWL are interpreted quite differently from analogous statements in relational databases. If these statements are meant to be interpreted as integrity constrai...
Boris Motik, Ian Horrocks, Ulrike Sattler
STACS
2009
Springer
14 years 3 months ago
Enumerating Homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
Andrei A. Bulatov, Víctor Dalmau, Martin Gr...
AISC
2004
Springer
14 years 2 months ago
Proof Search in Minimal Logic
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
Helmut Schwichtenberg
HM
2009
Springer
145views Optimization» more  HM 2009»
14 years 1 months ago
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...