Matches in ScholarlyData for { ?s ?p ?o. }
- 232 hasTopic Web_2.0.
- 232 isPartOf proceedings.
- 232 keyword "RDF".
- 232 keyword "SPARQL".
- 232 keyword "Social Networks".
- 232 title "Representing, Querying and Transforming Social Networks with RDF/SPARQL".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent mauro-san-martin.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent claudio-gutierrez.
- item-2 previous item-1.
- 234 creator harry-halpin.
- 234 creator valentina-presutti.
- 234 type InProceedings.
- 234 label "An Ontology of Resources: Solving the Identity Crisis".
- 234 sameAs 234.
- 234 abstract "The primary goal of the Semantic Web is to use URIs as a universal space to name anything, expanding from using URIs for webpages to URIs for “real ob jects and imaginary concepts” as put by Berners-Lee. This distinction has often been tied to the distinction between information resources, like webpages and multimedia files, and non-information resources, which are everything from real-people and bound books. Furthermore, the W3C has recommended not to use the same URI for information resources and non-information resources, and several communities like the Linked Data initiative are deploying this principle. Yet, the definition put forward by the W3C, that non-information resources are things whose “essential nature is information” seems confusing at best. For example, would the text of Moby Dick be an information resource? While this problem could safely be ignored up till now as a mere distraction, with both the rise of Linked Data, projects like OKKAM, and recent work on modelling HTTP in RDF for error reports, it appears that this problem must be modelled formally. An ontology called IRW (Identity and Reference on the Web) of various types of resources and their relationships, both for the hypertext Web and the Semantic Web, is presented. It builds upon Information Object Lite (an extension of DOLCE Ultra Lite for describing information objects) and IRE and aligns with the work of the W3C in modelling HTTP in RDF and Berners-Lee’s Tabulator ontology. It can be used as a tool to make the Semantic Web more self-describing, and it also allows inference to be used to test for membership in various classes of resource, and so for validating Linked Data.".
- 234 hasAuthorList authorList.
- 234 hasTopic Application.
- 234 hasTopic Data.
- 234 hasTopic Data_integration.
- 234 hasTopic E-Government.
- 234 hasTopic E-Learning.
- 234 hasTopic E-Science.
- 234 hasTopic E-health.
- 234 hasTopic Electronic_business.
- 234 hasTopic Interoperability.
- 234 hasTopic Linked_Data.
- 234 hasTopic Semantic_Web.
- 234 isPartOf proceedings.
- 234 keyword "linked data".
- 234 keyword "ontology".
- 234 keyword "resource".
- 234 keyword "validation".
- 234 title "An Ontology of Resources: Solving the Identity Crisis".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent harry-halpin.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent valentina-presutti.
- item-2 previous item-1.
- 27 creator claudia-damato.
- 27 creator floriana-esposito.
- 27 creator nicola-fanizzi.
- 27 type InProceedings.
- 27 label "ReduCE: A Reduced Coulomb Energy Network Method for Approximate Classication".
- 27 sameAs 27.
- 27 abstract "In order to overcome the limitations of the purely deductive approaches to query answering from ontologies, inductive (instance-based) methods have been proposed as efficient and noise-tolerant tools. In this paper we propose an original approach based on non-parametric learning: the Reduced Coulomb Energy Network classifier. The method requires a limited training effort (more than nearest neighbor yet less than kernel machines) but can turn out to be very effective in the classification phase. Casting retrieval as the problem of assessing class-memberships w.r.t. the query concepts, we propose an extension of a classification algorithm using a Reduced Coulomb Energy Network based on an entropic similarity measure for OWL. Experimentally we show that the behavior of the classifier is comparable with the one of a standard reasoner and is often more efficient than with other inductive approaches. Moreover we show that new knowledge (not logically derivable) is induced.".
- 27 hasAuthorList authorList.
- 27 hasTopic Data_mining.
- 27 hasTopic Query.
- 27 hasTopic Search_engine.
- 27 hasTopic Semantic_Web.
- 27 hasTopic Visualization.
- 27 isPartOf proceedings.
- 27 keyword "Approximate classification".
- 27 keyword "Inductive inference".
- 27 keyword "Likelihood".
- 27 keyword "Machine Learning".
- 27 keyword "Reduced Coulomb Energy Networks".
- 27 title "ReduCE: A Reduced Coulomb Energy Network Method for Approximate Classication".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent nicola-fanizzi.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent claudia-damato.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent floriana-esposito.
- item-3 previous item-2.
- 33 creator cristina-feier.
- 33 creator stijn-heymans.
- 33 type InProceedings.
- 33 label "Hybrid Reasoning with Forest Logic Programs".
- 33 sameAs 33.
- 33 abstract "Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasoning procedures exist. In this paper, we provide a sound, complete, and terminating algorithm for satisfiability checking w.r.t. forest logic programs, a fragment where rules have a tree shape and allow for inequality atoms and constants. We further introduce f-hybrid knowledge bases, a hybrid framework where SHOQ knowledge bases and forest logic programs co-exist, and we show that reasoning with such knowledge bases can be reduced to reasoning with forest logic programs only. We note that f-hybrid knowledge bases do not require the usual (weakly) DL-safety of the rule component, providing thus a genuine alternative approach to hybrid reasoning.".
- 33 hasAuthorList authorList.
- 33 hasTopic Data.
- 33 hasTopic Formal_languages.
- 33 hasTopic Inference.
- 33 hasTopic Interoperability.
- 33 hasTopic Logic.