@inproceedings{dietzold2008xoperator,
  abstract = {Instant Messaging is in addition to Web and Email the most popular service on the Internet. With xOperator we present a strategy and implementation which deeply integrates Instant Messaging networks with the Semantic Web. The xOperator concept is based on the idea of creating an overlay network of collaborative information agents on top of social IM networks. It can be queried using a controlled and easily extensible language based on AIML templates. Such a deep integration of semantic technologies and Instant Messaging bears a number of advantages and benefits for users when compared to the separated use of Semantic Web technologies and IM, the most important ones being context awareness as well as provenance and trust. We showcase how the xOperator approach naturally facilitates contacts and calendar management as well as access to large scale heterogeneous information sources.},
  added-at = {2008-05-28T14:50:05.000+0200},
  address = {Berlin, Heidelberg},
  author = {Dietzold, Sebastian and Unbehauen, Jörg and Auer, Sören},
  biburl = {http://www.bibsonomy.org/bibtex/2e672f158fc594179cd9fd36f8a135de4/eswc2008},
  booktitle = {Proceedings of the 5th European Semantic Web Conference},
  editor = {Hauswirth, Manfred and Koubarakis, Manolis and Bechhofer, Sean},
  interhash = {170f8929b13305d8621da905ef0a887a},
  intrahash = {e672f158fc594179cd9fd36f8a135de4},
  keywords = {instant agent sparql xmpp rdf messaging agents-application-ontologies},
  month = {June},
  publisher = {Springer Verlag},
  series = {LNCS},
  timestamp = {2008-05-28T14:50:05.000+0200},
  title = {xOperator - Interconnecting the Semantic Web and Instant Messaging Networks},
  url = {http://data.semanticweb.org/conference/eswc/2008/papers/293},
  year = 2008
}

@inproceedings{grimnes2008distance,
  abstract = {The original Semantic Web vision was explicit in the need for intelligent autonomous agents that would represent users and help them navigate the Semantic Web. We argue that an essential feature for such agents is the capability to analyse data and learn. In this paper we outline the challenges and issues surrounding the application of clustering algorithms to Semantic Web data. We present several ways to extract instances from a large RDF graph and computing the distance between these. We evaluate our approaches on three different data-sets, one representing a typical relational database to RDF conversion, one based on data from a ontologically rich Semantic Web enabled application, and one consisting of a crawl of FOAF documents; applying both supervised and unsupervised evaluation metrics.  Our evaluation did not support choosing a single combination of instance extraction method and similarity metric as superior in all cases, and as expected the behaviour depends greatly on the data being clustered. Instead, we attempt to identify characteristics of data that make particular methods more suitable.},
  added-at = {2008-05-28T14:50:01.000+0200},
  address = {Berlin, Heidelberg},
  author = {Grimnes, Gunnar and Edwards, Peter and Preece, Alun},
  biburl = {http://www.bibsonomy.org/bibtex/21a97459b80d2cac3fd8b935452fe0418/eswc2008},
  booktitle = {Proceedings of the 5th European Semantic Web Conference},
  editor = {Hauswirth, Manfred and Koubarakis, Manolis and Bechhofer, Sean},
  interhash = {ca0a3d3694050b29f6b68ba5242a22fb},
  intrahash = {1a97459b80d2cac3fd8b935452fe0418},
  keywords = {rdf measure clustering distance learning},
  month = {June},
  publisher = {Springer Verlag},
  series = {LNCS},
  timestamp = {2008-05-28T14:50:01.000+0200},
  title = {Distance Based clustering of Semantic Web Resources},
  url = {http://data.semanticweb.org/conference/eswc/2008/papers/246},
  year = 2008
}

@inproceedings{pichler2008entailment,
  abstract = {We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF is a real extension of RDF and discuss impacts on the complexity of entailment in dRDF. The entailment problem represents the key reasoning task for RDF and is well known to be NP-complete. Remarkably, we show that the restriction of domains in dRDF raises the complexity of entailment from NP- to $\Pi^P_2$-completeness. In order to lower complexity of entailment for both domain-restricted and unrestricted graphs, we take a closer look at the graph structure. For cases where the structure of RDF graphs is restricted via the concept of bounded treewidth, we manage to prove tractability of entailment. We also present a polynomial entailment checking algorithm for such graphs.},
  added-at = {2008-05-28T14:49:57.000+0200},
  address = {Berlin, Heidelberg},
  author = {Pichler, Reinhard and Polleres, Axel and Wei, Fang and Woltran, Stefan},
  biburl = {http://www.bibsonomy.org/bibtex/254b3e29ce6a6f65fd0cd595a0904f919/eswc2008},
  booktitle = {Proceedings of the 5th European Semantic Web Conference},
  editor = {Hauswirth, Manfred and Koubarakis, Manolis and Bechhofer, Sean},
  interhash = {ad4c325731fe9bee1eac3f75252c127f},
  intrahash = {54b3e29ce6a6f65fd0cd595a0904f919},
  keywords = {rdf semantic h-subsumption web entailment complexity formal-languages-2},
  month = {June},
  publisher = {Springer Verlag},
  series = {LNCS},
  timestamp = {2008-05-28T14:49:57.000+0200},
  title = {Entailment for Domain-restricted RDF},
  url = {http://data.semanticweb.org/conference/eswc/2008/papers/120},
  year = 2008
}

@inproceedings{bolles2008streaming,
  abstract = {A lot of work has been done in the area of data stream processing. Most of the previous approaches regard only relational or XML based streams but do not cover semantic richer RDF based stream elements. In our work, we extend SPARQL, the W3C recommendation for an RDF query language, to process RDF data streams. To describe the semantics of our enhancement, we extended the logical SPARQL algebra for stream processing on the foundation of a temporal relational algebra based on multi sets and provide an algorithm to transform SPARQL queries to the new extended algebra. For each logical algebra operator, we defined executable physical counterparts. To show the feasibility of our approach, we implemented it within our ODYSSEUS framework in the context of wind power plant monitoring.},
  added-at = {2008-05-28T14:49:50.000+0200},
  address = {Berlin, Heidelberg},
  author = {Bolles, Andre and Grawunder, Marco and Jacobi, Jonas},
  biburl = {http://www.bibsonomy.org/bibtex/20164f0b77530f4b038a71c7fa3ad6546/eswc2008},
  booktitle = {Proceedings of the 5th European Semantic Web Conference},
  editor = {Hauswirth, Manfred and Koubarakis, Manolis and Bechhofer, Sean},
  interhash = {4e6f4b1c7b24e0e0172ff3321f6c40fb},
  intrahash = {0164f0b77530f4b038a71c7fa3ad6546},
  keywords = {processing sparql stream rdf query-processing-1},
  month = {June},
  publisher = {Springer Verlag},
  series = {LNCS},
  timestamp = {2008-05-28T14:49:50.000+0200},
  title = {Streaming SPARQL - Extending SPARQL to process data streams},
  url = {http://data.semanticweb.org/conference/eswc/2008/papers/3},
  year = 2008
}