{
  "@context": {
    "@vocab": "http://schema.org/",
    "rdau": "http://rdaregistry.info/Elements/u/",
    "skos": "http://www.w3.org/2004/02/skos/core#",
    "skos:prefLabel": {
      "@container": "@language"
    }
  },
  "@graph": [
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00394306100",
      "author": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000134561"
      },
      "name": "Impact of restricted branching on clause learning SAT solving"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:au:pn:000134561",
      "@type": "Person",
      "name": "Järvisalo, Matti"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00392480300",
      "author": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000134561"
      },
      "name": "Proof complexity of cut-based tableaux for Boolean circuit satisfiability checking"
    },
    {
      "@id": "http://urn.fi/URN:NBN:fi:bib:me:W00394844800",
      "author": {
        "@id": "http://urn.fi/URN:NBN:fi:au:pn:000134561"
      },
      "name": "Structure-based satisfiability checking : analyzing and harnessing the potential"
    }
  ]
}