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": "Austrian Research Institute for Artificial Intelligence, and Department of Medical Cybernetics and Artificial Intelligence, University of Vienna, Freyung 6, A-1010, Vienna, Austria", 
          "id": "http://www.grid.ac/institutes/grid.10420.37", 
          "name": [
            "Austrian Research Institute for Artificial Intelligence, and Department of Medical Cybernetics and Artificial Intelligence, University of Vienna, Freyung 6, A-1010, Vienna, Austria"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Holzbaur", 
        "givenName": "Christian", 
        "id": "sg:person.015052747435.75", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015052747435.75"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Departamento de Inform\u00e1tica Faculdade de Ci\u00eancias e T\u00e9cnologia, Universidade Nova de Lisboa, 2825, Monte da Caparica, Portugal", 
          "id": "http://www.grid.ac/institutes/grid.10772.33", 
          "name": [
            "Departamento de Inform\u00e1tica Faculdade de Ci\u00eancias e T\u00e9cnologia, Universidade Nova de Lisboa, 2825, Monte da Caparica, Portugal"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Menezes", 
        "givenName": "Francisco", 
        "id": "sg:person.012417274741.64", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012417274741.64"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Departamento de Inform\u00e1tica Faculdade de Ci\u00eancias e T\u00e9cnologia, Universidade Nova de Lisboa, 2825, Monte da Caparica, Portugal", 
          "id": "http://www.grid.ac/institutes/grid.10772.33", 
          "name": [
            "Departamento de Inform\u00e1tica Faculdade de Ci\u00eancias e T\u00e9cnologia, Universidade Nova de Lisboa, 2825, Monte da Caparica, Portugal"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Barahona", 
        "givenName": "Pedro", 
        "id": "sg:person.01200744637.40", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01200744637.40"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1996", 
    "datePublishedReg": "1996-01-01", 
    "description": "This paper presents a defeasible constraint solver for the domain of linear equations, disequations and inequalities over the body of rational/real numbers. As extra requirements resulting from the incorporation of the solver into an Incremental Hierarchical Constraint Solver (IHCS) scenario we identified: a)the ability to refer to individual constraints by a label, b) the ability to report the (minimal) cause for the unsatisfiability of a set of constraints, and c) the ability to undo the effects of a formerly activated constraint.We develop the new functionalities after starting the presentation with a general architecture for defeasible constraint solving, through a solved form algorithm that utilizes a generalized, incremental variant of the Simplex algorithm, where the domain of a variable can be restricted to an arbitrary interval. We demonstrate how generalized slacks form the basis for the computation of explanations regarding the cause of unsatisfiability and/or entailment in terms of the constraints told, and the possible deactivation of constraints as demanded by the hierarchy handler.", 
    "editor": [
      {
        "familyName": "Freuder", 
        "givenName": "Eugene C.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-61551-2_76", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-61551-4", 
        "978-3-540-70620-5"
      ], 
      "name": "Principles and Practice of Constraint Programming \u2014 CP96", 
      "type": "Book"
    }, 
    "keywords": [
      "CLP", 
      "presentation", 
      "cause", 
      "ability", 
      "intervals", 
      "possible deactivation", 
      "variables", 
      "variants", 
      "handlers", 
      "effect", 
      "set of constraints", 
      "constraint solver", 
      "body", 
      "constraint solving", 
      "general architecture", 
      "incremental variant", 
      "cause of unsatisfiability", 
      "new functionalities", 
      "number", 
      "individual constraints", 
      "form algorithm", 
      "extra requirements", 
      "algorithm", 
      "unsatisfiability", 
      "incorporation", 
      "simplex algorithm", 
      "constraints", 
      "labels", 
      "basis", 
      "solver", 
      "domain", 
      "real numbers", 
      "architecture", 
      "slack variables", 
      "explanation", 
      "computation", 
      "deactivation", 
      "disequations", 
      "functionality", 
      "scenarios", 
      "entailment", 
      "terms", 
      "solving", 
      "requirements", 
      "set", 
      "linear equations", 
      "arbitrary interval", 
      "defeasibility", 
      "inequality", 
      "slack", 
      "paper", 
      "equations"
    ], 
    "name": "Defeasibility in CLP() through generalized slack variables", 
    "pagination": "209-223", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1019722651"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-61551-2_76"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-61551-2_76", 
      "https://app.dimensions.ai/details/publication/pub.1019722651"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:41", 
    "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_105.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-61551-2_76"
  }
]

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.

129 TRIPLES      23 PREDICATES      78 URIs      71 LITERALS      7 BLANK NODES