linked-data

I just start to learn Semantic Web and have a question about restriction class. I dug a while but haven't found any answer yet.. Any help would be much appreciated! From text book, I see examples of define restriction class, they are all about to define a anonymous owl:Restriction class bnode and link this bnode with property owl:equivalentClass . example: example:restrictionClass owl:equivalentClass [ rdf:type owl:Restriction; owl:onProperty example:resProp; owl:someValuesFrom example:resValue. ] My question is can we define a restriction class directly? Like: example:restrictionClass rdf

I would like to know if there is a standard or generally accepted way of representing an equivalent of NULL used in databases for RDF data. More specifically, I'm interested in a way to distinguish the following cases for a value o of a property p ( p is the predicate, o the object of an RDF triple): The value is not applicable , i.e. property p does not exist or does not make sense in the context. The value is unknown , i.e. it should be there but we don't know it. The value doesn't exist , i.e. the property doesn't have a value (e.g. year of death for a person alive). The value is witheld ,

I am trying to fetch a list of American movies adapted from books from dbpedia. This is what I have so far: PREFIX onto: <http://dbpedia.org/ontology/> PREFIX dcterms: <http://purl.org/dc/terms/> SELECT * WHERE { ?movie dcterms:subject <http://dbpedia.org/resource/Category:American_films> . ?movie dcterms:subject <http://dbpedia.org/resource/Category:Films_based_on_novels> . ?movie onto:basedOn ?book . ?book a onto:Book . } I get only 4 results back. Is there another property I can use to get more results? First thing, try removing the second line of your pattern -- ?movie dcterms:subject

I am starting to learn schema.org schema. I come from the RDF/OWL community. To my surprise I could not indeed find an RDFS or OWL vocabulary representation of schema.org. More specifically, I realised that it was just a HTML page describing the schema. I also found an RDFa representation of the schema. Not sure that it can be a legal RDFS representation by the way. All of this got me a bit confused. In the meantime I found the following works: http://topbraid.org/schema/ and http://schema.rdfs.org/ . Hence I have the following few questions: 1- Are both work achieving the same thing? if not

I'd like to confirm something about the 303 redirect protocol implication. If one does follow the convention of building RDF (resources/instances file as opposed to vocabularies) using slash URI instead of hash URI for flexibility purpose, does it mean that each resource instance must have a redirect defined (if we want them dereferencable)? Meaning we must define with purl a 303 redirect for each resource to either the same or different file as we see fit? Also, along the way can someone tell me what is the difference between an information resource and a non-information resource (also called

I'm a Java developer just getting started with linked data/RDF. I can create triples, put them in a triple store, query them, etc, but it's very awkward. Most of my code is focused on the mechanics of RDF and I'd really like to work with this data in a way that's more idiomatic Java. How can I convert a POJO to/from RDF triples with Jena without hand-coding everything? I'd like something that can convert a pile of triples with a defined structure back and forth between a Java POJO and RDF. Like JAXB or and ORM does for XML and a relational database, respectively. Also, I can't be locked in too

I have a question for you. I would like to write a query that retrieves the values ​​that are similar (given a function of similarity, such as Lev) to a given string "Londn" to make the comparison with the predicate "RDFS:label" of DBPedia. In Output, for example, I would like to get the value of "London". I have read that a usable approach might be to use iSPARQL ("Imprecise SPARQL") although it is not very widely used in the literature. Can I use iSPARQL or is there some SPARQL approach to perform the same operations? Short Version — You can do some of this in pure SPARQL You can use a query