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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Link\u00f6ping University", 
          "id": "https://www.grid.ac/institutes/grid.5640.7", 
          "name": [
            "Department of Computer and Information Science, Link\u00f6ping University, Sweden"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jonsson", 
        "givenName": "Peter", 
        "id": "sg:person.016365414553.65", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016365414553.65"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Laboratoire d'Informatique Gaspard-Monge", 
          "id": "https://www.grid.ac/institutes/grid.462940.d", 
          "name": [
            "LIGM, Universit\u00e9 Paris-Est Marne-la-Vall\u00e9e, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Thapper", 
        "givenName": "Johan", 
        "id": "sg:person.011174650517.63", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011174650517.63"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/978-3-540-70583-3_16", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1003879973", 
          "https://doi.org/10.1007/978-3-540-70583-3_16"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/1120582.1120584", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1007118300"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.artint.2012.10.001", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1025118537"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.cosrev.2008.10.003", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1026304855"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/167088.167245", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1035149403"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1093/logcom/exr011", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1059876397"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/s0097539700376676", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062879250"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.2168/lmcs-8(4:5)2012", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1069151246"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2014", 
    "datePublishedReg": "2014-01-01", 
    "description": "A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals or the integers. Semilinear relations have been studied in connection with algebraic geometry, automata theory, and spatiotemporal reasoning, just to mention a few examples. We concentrate on relations over the reals and rational numbers. Under this assumption, the computational complexity of the constraint satisfaction problem (CSP) is known for all finite sets \u0393 of semilinear relations containing the relations R \u2009+\u2009\u2009=\u2009{(x,y,z) \u00a0 | \u00a0 x\u2009+\u2009y\u2009=\u2009z}, \u2264, and {1}. These problems correspond to extensions of LP feasibility. We generalise this result as follows. We introduce an algorithm, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time. This allows us to fully determine the complexity of CSP(\u0393) for semilinear \u0393 containing R \u2009+\u2009 and satisfying two auxiliary conditions. Our result covers all semilinear \u0393 such that {R \u2009+\u2009,{1}}\u2009\u2286\u2009\u0393. We continue by studying the more general case when \u0393 contains R \u2009+\u2009 but violates either of the two auxiliary conditions. We show that each such problem is equivalent to a problem in which the relations are finite unions of homogeneous linear sets and we present evidence that determining the complexity of these problems may be highly non-trivial.", 
    "editor": [
      {
        "familyName": "Csuhaj-Varj\u00fa", 
        "givenName": "Erzs\u00e9bet", 
        "type": "Person"
      }, 
      {
        "familyName": "Dietzfelbinger", 
        "givenName": "Martin", 
        "type": "Person"
      }, 
      {
        "familyName": "\u00c9sik", 
        "givenName": "Zolt\u00e1n", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-44465-8_36", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-662-44464-1", 
        "978-3-662-44465-8"
      ], 
      "name": "Mathematical Foundations of Computer Science 2014", 
      "type": "Book"
    }, 
    "name": "Affine Consistency and the Complexity of Semilinear Constraints", 
    "pagination": "420-431", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-44465-8_36"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "b3fb6dab1068fc5933f27822a866fcae08e8e5489eea95cbbd382b5a9a6da3a6"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1037782018"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-44465-8_36", 
      "https://app.dimensions.ai/details/publication/pub.1037782018"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T13:29", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8664_00000266.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/978-3-662-44465-8_36"
  }
]

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.

110 TRIPLES      23 PREDICATES      35 URIs      20 LITERALS      8 BLANK NODES