<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/user/eswc2008/logic"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /user/eswc2008/logic</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/20aedaf7d891b39d35f46baf40901c299/eswc2008"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/20aedaf7d891b39d35f46baf40901c299/eswc2008"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://data.semanticweb.org/conference/eswc/2008/papers/252"/><swrc:date>Wed May 28 14:50:01 CEST 2008</swrc:date><swrc:address>Berlin, Heidelberg</swrc:address><swrc:booktitle>Proceedings of the 5th European Semantic Web Conference</swrc:booktitle><swrc:month>June</swrc:month><swrc:publisher><swrc:Organization swrc:name="Springer Verlag"/></swrc:publisher><swrc:series>LNCS</swrc:series><swrc:title>Query Answering and Ontology Population: an Inductive Approach</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>similalrity inductive learning unswering uncertainty ontology logic description population measure query </swrc:keywords><swrc:abstract>In the context of Semantic Web, deductive reasoning is used for making explicit the implicit knowledge of a knowledge base (KB). Anyway, purely logic-based approaches can fail when data comes from distributed sources, where contradictions usually turn out. Inductive instance-based learning methods can be effectively used in such a case, since they are well known to be efficient and fault tolerant. In this paper we propose an inductive method for improving the concept retrieval and for the performing the ontology population in a (semi-)automatic way. By casting concept retrieval to a classification problem with the  goal of assessing the individual memberships w.r.t. the query concepts, we propose an extension of the \emph{k-Nearest Neighbor} algorithm for Description Logic KBs. It is based on the exploitation of an \emph{entropy}-based dissimilarity measure. The procedure retrieves individuals belonging to query concepts, by analogy with other training instances, on the grounds of the classification of the nearest ones w.r.t.\ the dissimilarity measure. We experimentally show that the behavior of the classifier is comparable with the one of a standard reasoner. Moreover we show that new knowledge (not logically derivable) is induced. It can be suggested to the knowledge engineer for validation, during the ontology population task.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Claudia d&#039;Amato"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Nicola Fanizzi"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Floriana Esposito"/></rdf:_3></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Manfred Hauswirth"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Manolis Koubarakis"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Sean Bechhofer"/></rdf:_3></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2dcf5b0c2917ad713144969a632ef1914/eswc2008"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2dcf5b0c2917ad713144969a632ef1914/eswc2008"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://data.semanticweb.org/conference/eswc/2008/papers/56"/><swrc:date>Wed May 28 14:49:54 CEST 2008</swrc:date><swrc:address>Berlin, Heidelberg</swrc:address><swrc:booktitle>Proceedings of the 5th European Semantic Web Conference</swrc:booktitle><swrc:month>June</swrc:month><swrc:publisher><swrc:Organization swrc:name="Springer Verlag"/></swrc:publisher><swrc:series>LNCS</swrc:series><swrc:title>Restricting and forgetting in DL-Lite</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>dl-lite restricting ontology description forgetting logic formal-languages-2 </swrc:keywords><swrc:abstract>Description logics form the foundation of ontologies used in the Semantic Web.   To support reuse and integration of ontologies in Semantic Web applications, it is often necessary to restrict ontologies to a subset of their concepts and roles, or equivalently to forget a complementary subset of concepts and roles from the ontologies.  We present the first detailed account of this problem for description logics, in particular for the DL-Lite family of description logics.  Specifically, we present a semantic definition of forgetting that generalises the standard definition for classical logic.  We introduce algorithms for forgetting concepts roles from both DL-Lite TBoxes and ABoxes.  We prove the algorithms are sound and complete with respect to the semantics, and demonstrate how they can be used to speed-up query answering in DL-Lite knowledge bases.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Zhe Wang"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Kewen Wang"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Rodney Topor"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Jeff Z. Pan"/></rdf:_4></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Manfred Hauswirth"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Manolis Koubarakis"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Sean Bechhofer"/></rdf:_3></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/23171f537650171bf487c8afdc4b90320/eswc2008"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/23171f537650171bf487c8afdc4b90320/eswc2008"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://data.semanticweb.org/conference/eswc/2008/papers/14"/><swrc:date>Wed May 28 14:49:51 CEST 2008</swrc:date><swrc:address>Berlin, Heidelberg</swrc:address><swrc:booktitle>Proceedings of the 5th European Semantic Web Conference</swrc:booktitle><swrc:month>June</swrc:month><swrc:publisher><swrc:Organization swrc:name="Springer Verlag"/></swrc:publisher><swrc:series>LNCS</swrc:series><swrc:title>Module Extraction and Incremental Classification: A Pragmatic Approach for EL+ Ontologies</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>ontology logic description extraction classification module incremental formal-languages-1 </swrc:keywords><swrc:abstract>The description logic EL+ has recently proved practically useful in the life science domain with presence of several large-scale biomedical ontologies such as SNOMED CT. To deal with ontologies of this scale, standard reasoning of classification is essential but not sufficient. The ability to extract relevant fragments from a large ontology and to incrementally classify it has become more crucial to support ontology design, maintenance and re-use. In this paper, we propose a pragmatic approach to module extraction and incremental classification for EL+ ontologies and report on empirical evaluations of our algorithms which have been implemented as an extension of the CEL reasoner.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Boontawee Suntisrivaraporn"/></rdf:_1></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Manfred Hauswirth"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Manolis Koubarakis"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Sean Bechhofer"/></rdf:_3></rdf:Seq></swrc:editor></rdf:Description></rdf:RDF>
