Sciweavers

2608 search results - page 7 / 522
» Inferring Answers to Queries
Sort
View
LICS
2009
IEEE
14 years 4 months ago
Trichotomy in the Complexity of Minimal Inference
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
Arnaud Durand, Miki Hermann, Gustav Nordh
DASFAA
2010
IEEE
252views Database» more  DASFAA 2010»
14 years 2 months ago
Effectively Inferring the Search-for Node Type in XML Keyword Search
xml keyword search provides a simple and user-friendly way of retrieving data from xml databases, but the ambiguities of keywords make it difficult to effectively answer keyword qu...
Jiang Li, Junhu Wang
CORR
2007
Springer
77views Education» more  CORR 2007»
13 years 9 months ago
Query Evaluation and Optimization in the Semantic Web
We address the problem of answering Web ontology queries efficiently. An ontology is formalized as a Deductive Ontology Base (DOB), a deductive database that comprises the ontology...
Edna Ruckhaus, Eduardo Ruiz, Maria-Esther Vidal
SEMWEB
2010
Springer
13 years 7 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
AMW
2010
13 years 11 months ago
Chasing after Secrets in Relational Databases
Abstract. Inference control can guarantee confidentiality but is costly to implement. Access control can be implemented efficiently but cannot guarantee confidentiality. Hence, it ...
Joachim Biskup, Sven Hartmann, Sebastian Link, Jan...