Sciweavers

387 search results - page 13 / 78
» Reasoning About Approximate Match Query Results
Sort
View
TGIS
2008
69views more  TGIS 2008»
13 years 8 months ago
Spatial-Scene Similarity Queries
Assessing spatial scenes for similarity is difficult from a cognitive and computational perspective. Solutions to spatial-scene similarity assessments are sensible only if corresp...
Konstantinos A. Nedas, Max J. Egenhofer
WEBDB
2004
Springer
125views Database» more  WEBDB 2004»
14 years 2 months ago
Best-Match Querying from Document-Centric XML
On the Web, there is a pervasive use of XML to give lightweight semantics to textual collections. Such documentcentric XML collections require a query language that can gracefully...
Jaap Kamps, Maarten Marx, Maarten de Rijke, Bö...
AAAI
2007
13 years 11 months ago
Approximating OWL-DL Ontologies
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
Jeff Z. Pan, Edward Thomas
DLOG
2011
13 years 4 days ago
Paraconsistent Rough Description Logic
Abstract. In this paper, we introduce a paraconsistent extension of Rough Description Logics which allows the representation of incomplete and contradictory concepts, as well as th...
Henrique Viana, João Alcântara, Ana T...
SEMWEB
2007
Springer
14 years 2 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