Sciweavers

95 search results - page 8 / 19
» The Complexity of Conjunctive Query Answering in Expressive ...
Sort
View
PODS
2006
ACM
121views Database» more  PODS 2006»
14 years 7 months ago
On the efficiency of checking perfect privacy
Privacy-preserving query-answering systems answer queries while provably guaranteeing that sensitive information is kept secret. One very attractive notion of privacy is perfect p...
Ashwin Machanavajjhala, Johannes Gehrke
KR
2004
Springer
14 years 1 months ago
Complex Preferences for Answer Set Optimization
The main contribution of this paper is the definition of the preference description language  ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
Gerhard Brewka
SEMWEB
2007
Springer
14 years 1 months ago
Logical Foundations of (e)RDF(S): Complexity and Reasoning
Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms ...
Jos de Bruijn, Stijn Heymans
SSDBM
2002
IEEE
109views Database» more  SSDBM 2002»
14 years 16 days ago
Query Processing with Description Logic Ontologies Over Object-Wrapped Databases
This paper presents an approach to answering queries over an ontology modelled using a description logic. The ontology acts as a global schema, providing a declarative description...
Martin Peim, Enrico Franconi, Norman W. Paton, Car...
KR
2010
Springer
14 years 13 days ago
Query and Predicate Emptiness in Description Logics
Ontologies can be used to provide an enriched vocabulary for the formulation of queries over instance data. We identify query emptiness and predicate emptiness as two central reas...
Franz Baader, Meghyn Bienvenu, Carsten Lutz, Frank...