JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "School of Computer Science, University of Manchester, Manchester, UK", 
          "id": "http://www.grid.ac/institutes/grid.5379.8", 
          "name": [
            "School of Computer Science, University of Manchester, Manchester, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Motik", 
        "givenName": "Boris", 
        "id": "sg:person.07401076267.36", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07401076267.36"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2009-05-22", 
    "datePublishedReg": "2009-05-22", 
    "description": "We overview the algorithms for reasoning with description logic (DL) ontologies based on resolution. These algorithms often have worst-case optimal complexity, and, by relying on vast experience in building resolution theorem provers, they can be implemented efficiently. Furthermore, we present a resolution-based algorithm that reduces a DL knowledge base into a disjunctive datalog program, while preserving the set of entailed facts. This reduction enables the application of optimization techniques from deductive databases, such as magic sets, to reasoning in DLs. This approach has proven itself in practice on ontologies with relatively small and simple TBoxes, but large ABoxes.", 
    "editor": [
      {
        "familyName": "Staab", 
        "givenName": "Steffen", 
        "type": "Person"
      }, 
      {
        "familyName": "Studer", 
        "givenName": "Rudi", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-92673-3_24", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-70999-2", 
        "978-3-540-92673-3"
      ], 
      "name": "Handbook on Ontologies", 
      "type": "Book"
    }, 
    "keywords": [
      "resolution-based algorithms", 
      "DL knowledge base", 
      "resolution-based reasoning", 
      "resolution theorem provers", 
      "description logic ontologies", 
      "disjunctive datalog programs", 
      "deductive databases", 
      "large ABoxes", 
      "theorem provers", 
      "Datalog programs", 
      "knowledge base", 
      "magic sets", 
      "ontology", 
      "optimization techniques", 
      "algorithm", 
      "optimal complexity", 
      "provers", 
      "ABox", 
      "set", 
      "TBox", 
      "reasoning", 
      "complexity", 
      "database", 
      "applications", 
      "technique", 
      "vast experience", 
      "base", 
      "program", 
      "experience", 
      "resolution", 
      "fact", 
      "practice", 
      "reduction", 
      "dl", 
      "approach", 
      "logic (DL) ontologies", 
      "worst-case optimal complexity", 
      "entailed facts", 
      "simple TBoxes"
    ], 
    "name": "Resolution-Based Reasoning for Ontologies", 
    "pagination": "529-550", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1008875726"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-92673-3_24"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-92673-3_24", 
      "https://app.dimensions.ai/details/publication/pub.1008875726"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:12", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_214.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-92673-3_24"
  }
]

Download the RDF metadata as:  json-ld nt turtle xml License info

This table displays all metadata directly associated to this object as RDF triples.

108 TRIPLES      23 PREDICATES      65 URIs      57 LITERALS      7 BLANK NODES