<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>The Semantic Puzzle&#187; Trendspotting</title>
	<atom:link href="http://blog.semantic-web.at/tag/trendspotting/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.semantic-web.at</link>
	<description>Open World Assumptions</description>
	<lastBuildDate>Thu, 02 Feb 2012 14:26:25 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>A (very personal) bit of ISWC08 trendspotting</title>
		<link>http://blog.semantic-web.at/2008/10/30/a-very-personal-bit-of-iswc08-trendspotting/</link>
		<comments>http://blog.semantic-web.at/2008/10/30/a-very-personal-bit-of-iswc08-trendspotting/#comments</comments>
		<pubDate>Thu, 30 Oct 2008 13:51:40 +0000</pubDate>
		<dc:creator>Pascal Hitzler</dc:creator>
				<category><![CDATA[Conferences & Events]]></category>
		<category><![CDATA[Approximate Reasoning]]></category>
		<category><![CDATA[Billion Triple Challenge]]></category>
		<category><![CDATA[ISWC08]]></category>
		<category><![CDATA[OWL]]></category>
		<category><![CDATA[RDF]]></category>
		<category><![CDATA[Reasoning]]></category>
		<category><![CDATA[RR08]]></category>
		<category><![CDATA[Trends]]></category>
		<category><![CDATA[Trendspotting]]></category>

		<guid isPermaLink="false">http://blog.semantic-web.at/?p=329</guid>
		<description><![CDATA[As ISWC08 is drawing to a close, it dawns to me that something which Frank van Harmelen has been forecasting for years is now happening, seemingless without conscious effort. He calls it Approximate Reasoning &#8211; have a look at his &#8230; <a href="http://blog.semantic-web.at/2008/10/30/a-very-personal-bit-of-iswc08-trendspotting/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>As <a href="http://iswc2008.semanticweb.org/">ISWC08</a> is drawing to a close, it dawns to me that something which <a href="http://www.cs.vu.nl/~frankh/">Frank van Harmelen</a> has been forecasting for years is now happening, seemingless without conscious effort. He calls it Approximate Reasoning &#8211; have a look at his <a href="http://www.eswc2006.org/invited-speakers.html">ESWC06 keynote</a>. The basic idea behind it is to do reasoning over ontologies with a different focus, namely by giving up some reasoning correctness in order to gain better scalability.</p>
<p>And indeed, at <a href="http://iswc2008.semanticweb.org/">ISWC08</a> I have seen a number of things which fit exactly into this corner (while at the same time the authors/programmers might not even be aware of it).</p>
<ul>
<li>As part of the <a href="http://challenge.semanticweb.org/">Billion Triple Challenge</a>, <a href="http://axel.deri.ie/~axepol/">Axel Polleres</a> presented the SAOR system, which does approximate OWL reasoning by means of forward chaining rules. Now you can&#8217;t do OWL reasoning (in a sound and complete way) with forward chaining rules (and Axel knows this), so in the end you&#8217;re losing some consequences. But at the same time you do get <em>some </em>consequences when having to deal with large amounts of data.</li>
<li><a href="http://www.eyaloren.org/">Eyal Oren</a>, also at the <a href="http://challenge.semanticweb.org/">Billion Triple Challenge</a>, presented the MARVIN system which performs approximate RDF reasoning by means of massive parallelisation. MARVIN comes out of the EU project <a href="http://www.larkc.eu/">LarKC</a>, which is actually pursuing approximate reasoning on a large scale (pun intended). Edit: This one actually won the 3rd prize at the challenge.</li>
<li>Among the results presented at <a href="http://iswc2008.semanticweb.org/">ISWC08</a>, I found those by <a href="http://www.di.uniba.it/~cdamato/">Claudia D&#8217;Amato</a> on Statistical Learning for Inductive Query Answering on OWL Ontologies really amazing. She and her collaborators managed to do OWL instance retrieval <em>without </em>any deduction algorithm. Instead they used Support Vector Machines and learned which (named) OWL classes individuals belong to. The learning was done from a small sample set (generated by a reasoner), but the network was able to generalise from the data to achieve about 90% of coverage. In my opinion, this is something conceptually new and it is really remarkable that it works.</li>
<li>In a regular paper <a href="http://www.eyaloren.org/">Eyal Oren</a> also reported on using Evolutionary Algorithms for RDF query answering.</li>
</ul>
<p>The above is only a selection of approximate reasoning related things at <a href="http://iswc2008.semanticweb.org/">ISWC08</a>. There was also the <a href="http://natures.few.vu.nl/">Workshop on Nature inspired Reasoning for the Semantic Web</a> where related ideas were discussed. At the colocated <a href="http://www.rr-conference.org/RR2008/">Web Reasoning and Rule Systems conference, RR2008</a>, there will be two papers on approximate reasoning (incidentially, with me as coauthor).</p>
<p>I foresee the importance of such approaches rising substiantially in the future (and I think it&#8217;s a safe guess since <a href="http://www.cs.vu.nl/~frankh/">Frank</a> also seems to think so). The <a href="http://challenge.semanticweb.org/">Billion Triple Challenge</a> series could become one of the driving forums for this. There are exciting times ahead!</p>
<p>Author: <a href="http://www.pascal-hitzler.de">Pascal Hitzler</a>, AIFB, University of Karlsruhe (TH), Germany</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.semantic-web.at/2008/10/30/a-very-personal-bit-of-iswc08-trendspotting/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
	</channel>
</rss>

