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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Dept. of Computer Science, FEI, Technical University of Ostrava, 17. listopadu 15, CZ-708 33, Ostrava, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.440850.d", 
          "name": [
            "Dept. of Computer Science, FEI, Technical University of Ostrava, 17. listopadu 15, CZ-708 33, Ostrava, Czech Republic"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Jan\u010dar", 
        "givenName": "Petr", 
        "id": "sg:person.07724710171.43", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07724710171.43"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, CZ-602 00, Brno, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.10267.32", 
          "name": [
            "Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, CZ-602 00, Brno, Czech Republic"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Ku\u010dera", 
        "givenName": "Anton\u00edn", 
        "id": "sg:person.012453075541.89", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012453075541.89"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept. of Computer Science, University of Wales Swansea, Singleton Park, SA2 8PP, Swansea, Wales", 
          "id": "http://www.grid.ac/institutes/grid.4827.9", 
          "name": [
            "Dept. of Computer Science, University of Wales Swansea, Singleton Park, SA2 8PP, Swansea, Wales"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Moller", 
        "givenName": "Faron", 
        "id": "sg:person.010425236217.29", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010425236217.29"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept. of Computer Science, FEI, Technical University of Ostrava, 17. listopadu 15, CZ-708 33, Ostrava, Czech Republic", 
          "id": "http://www.grid.ac/institutes/grid.440850.d", 
          "name": [
            "Dept. of Computer Science, FEI, Technical University of Ostrava, 17. listopadu 15, CZ-708 33, Ostrava, Czech Republic"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Sawa", 
        "givenName": "Zden\u011bk", 
        "id": "sg:person.016412231345.81", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016412231345.81"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2002-03-15", 
    "datePublishedReg": "2002-03-15", 
    "description": "We present a general method for proving DP-hardness of equivalencechecking problems on one-counter automata. For this we show a reduction of the Sat-Unsat problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free variable, and is particularly apt for transforming to simulation-like equivalences on onecounter automata. In this way we show that the membership problem for any relation subsuming bisimilarity and subsumed by simulation preorder is DP-hard (even) for one-counter nets (where the counter cannot be tested for zero).We also show DP-hardness for deciding simulation between one-counter automata and finite-state systems (in both directions).", 
    "editor": [
      {
        "familyName": "Nielsen", 
        "givenName": "Mogens", 
        "type": "Person"
      }, 
      {
        "familyName": "Engberg", 
        "givenName": "Uffe", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-45931-6_13", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-43366-8", 
        "978-3-540-45931-6"
      ], 
      "name": "Foundations of Software Science and Computation Structures", 
      "type": "Book"
    }, 
    "keywords": [
      "finite-state systems", 
      "one-counter automata", 
      "simulation preorder", 
      "one-counter nets", 
      "generic method", 
      "automata", 
      "truth problem", 
      "membership problem", 
      "free variables", 
      "Lower Bound", 
      "nets", 
      "general method", 
      "bisimilarity", 
      "method", 
      "preorder", 
      "system", 
      "bounds", 
      "simulations", 
      "way", 
      "equivalence", 
      "special formula", 
      "variables", 
      "formula", 
      "relation", 
      "reduction", 
      "DP", 
      "fragments", 
      "problem"
    ], 
    "name": "Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds*", 
    "pagination": "172-186", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1007133095"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-45931-6_13"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-45931-6_13", 
      "https://app.dimensions.ai/details/publication/pub.1007133095"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:49", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_82.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-45931-6_13"
  }
]

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.

120 TRIPLES      23 PREDICATES      53 URIs      46 LITERALS      7 BLANK NODES