Sciweavers

382 search results - page 18 / 77
» Ranking Approximate Answers to Semantic Web Queries
Sort
View
EKAW
2006
Springer
14 years 9 days ago
SemSearch: A Search Engine for the Semantic Web
Semantic search promises to produce precise answers to user queries by taking advantage of the availability of explicit semantics of information in the context of the semantic web....
Yuangui Lei, Victoria S. Uren, Enrico Motta
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 8 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
ADC
2003
Springer
173views Database» more  ADC 2003»
14 years 1 months ago
Cooperative Query Answering for Semistructured Data
Semistructured data, in particular XML, has emerged as one of the primary means for information exchange and content management. The power of XML allows authors to structure a doc...
Michael Barg, Raymond K. Wong
WWW
2007
ACM
14 years 9 months ago
How NAGA uncoils: searching with entities and relations
Current keyword-oriented search engines for the World Wide Web do not allow specifying the semantics of queries. We address this limitation with NAGA1 , a new semantic search engi...
Gjergji Kasneci, Fabian M. Suchanek, Maya Ramanath...
KR
1992
Springer
14 years 21 days ago
Learning Useful Horn Approximations
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
Russell Greiner, Dale Schuurmans