Reasoning in Description Logics by a Reduction to Disjunctive Datalog View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2007-07-27

AUTHORS

Ullrich Hustadt, Boris Motik, Ulrike Sattler

ABSTRACT

As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a novel reasoning algorithm that reduces a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{SHIQ}$\end{document} knowledge base to a disjunctive datalog program while preserving the set of ground consequences. Queries can then be answered in the resulting program while reusing existing and practically proven optimization techniques of deductive databases, such as join-order optimizations or magic sets. Moreover, we use our algorithm to derive precise data complexity bounds: we show that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{SHIQ}$\end{document} is data complete for NP, and we identify an expressive fragment of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{SHIQ}$\end{document} with polynomial data complexity. More... »

PAGES

351-384

References to SciGraph publications

  • 1998. Description Logics for Conceptual Data Modeling in LOGICS FOR DATABASES AND INFORMATION SYSTEMS
  • 2006. A Resolution-Based Decision Procedure for in AUTOMATED REASONING
  • 2006. A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes in LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING
  • 2006. FaCT++ Description Logic Reasoner: System Description in AUTOMATED REASONING
  • 2005. A Decomposition Rule for Decision Procedures by Resolution-Based Calculi in LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING
  • 2004. A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards in AUTOMATED REASONING
  • 2001-06-08. Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics in AUTOMATED REASONING
  • 2008-03-18. A Resolution-Based Decision Procedure for in JOURNAL OF AUTOMATED REASONING
  • 2001-06-08. RACER System Description in AUTOMATED REASONING
  • 2003. Deduction in Ontologies via ASP in LOGIC PROGRAMMING AND NONMONOTONIC REASONING
  • 2004. Enhancing the Magic-Set Method for Disjunctive Datalog Programs in LOGIC PROGRAMMING
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s10817-007-9080-3

    DOI

    http://dx.doi.org/10.1007/s10817-007-9080-3

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1032391244


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    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/0802", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Computation Theory and Mathematics", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Department of Computer Science, University of Liverpool, Liverpool, UK", 
              "id": "http://www.grid.ac/institutes/grid.10025.36", 
              "name": [
                "Department of Computer Science, University of Liverpool, Liverpool, UK"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Hustadt", 
            "givenName": "Ullrich", 
            "id": "sg:person.015632277175.38", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015632277175.38"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Department of Computer Science, University of Manchester, Manchester, UK", 
              "id": "http://www.grid.ac/institutes/grid.5379.8", 
              "name": [
                "Department 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"
          }, 
          {
            "affiliation": {
              "alternateName": "Department of Computer Science, University of Manchester, Manchester, UK", 
              "id": "http://www.grid.ac/institutes/grid.5379.8", 
              "name": [
                "Department of Computer Science, University of Manchester, Manchester, UK"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Sattler", 
            "givenName": "Ulrike", 
            "id": "sg:person.015322100453.31", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015322100453.31"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/3-540-45744-5_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1051248912", 
              "https://doi.org/10.1007/3-540-45744-5_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s10817-008-9100-y", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046493520", 
              "https://doi.org/10.1007/s10817-008-9100-y"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4615-5643-5_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018010800", 
              "https://doi.org/10.1007/978-1-4615-5643-5_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11814771_53", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007066017", 
              "https://doi.org/10.1007/11814771_53"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-25984-8_7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1034820411", 
              "https://doi.org/10.1007/978-3-540-25984-8_7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11814771_26", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033805137", 
              "https://doi.org/10.1007/11814771_26"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11916277_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1001693914", 
              "https://doi.org/10.1007/11916277_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-32275-7_2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000889893", 
              "https://doi.org/10.1007/978-3-540-32275-7_2"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-27775-0_26", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1004439226", 
              "https://doi.org/10.1007/978-3-540-27775-0_26"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-45744-5_59", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1006632427", 
              "https://doi.org/10.1007/3-540-45744-5_59"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-24609-1_24", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1035548198", 
              "https://doi.org/10.1007/978-3-540-24609-1_24"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2007-07-27", 
        "datePublishedReg": "2007-07-27", 
        "description": "As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a novel reasoning algorithm that reduces a \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$\\mathcal{SHIQ}$\\end{document} knowledge base to a disjunctive datalog program while preserving the set of ground consequences. Queries can then be answered in the resulting program while reusing existing and practically proven optimization techniques of deductive databases, such as join-order optimizations or magic sets. Moreover, we use our algorithm to derive precise data complexity bounds: we show that \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$\\mathcal{SHIQ}$\\end{document} is data complete for NP, and we identify an expressive fragment of \\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}$\\mathcal{SHIQ}$\\end{document} with polynomial data complexity.", 
        "genre": "article", 
        "id": "sg:pub.10.1007/s10817-007-9080-3", 
        "inLanguage": "en", 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1136522", 
            "issn": [
              "0168-7433", 
              "1573-0670"
            ], 
            "name": "Journal of Automated Reasoning", 
            "publisher": "Springer Nature", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "3", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "39"
          }
        ], 
        "keywords": [
          "description logics", 
          "join-order optimization", 
          "novel reasoning algorithm", 
          "polynomial data complexity", 
          "disjunctive datalog programs", 
          "deductive databases", 
          "efficient reasoning", 
          "reasoning algorithm", 
          "data complexity", 
          "knowledge bases", 
          "Datalog programs", 
          "disjunctive Datalog", 
          "expressive fragment", 
          "complexity bounds", 
          "knowledge base", 
          "magic sets", 
          "optimization techniques", 
          "algorithm", 
          "logic", 
          "queries", 
          "Datalog", 
          "set", 
          "reasoning", 
          "complexity", 
          "NP", 
          "database", 
          "ground consequences", 
          "optimization", 
          "applications", 
          "bounds", 
          "technique", 
          "program", 
          "such cases", 
          "base", 
          "assertion", 
          "data", 
          "basis", 
          "cases", 
          "reduction", 
          "consequences", 
          "fragments", 
          "precise data complexity bounds", 
          "data complexity bounds"
        ], 
        "name": "Reasoning in Description Logics by a Reduction to Disjunctive Datalog", 
        "pagination": "351-384", 
        "productId": [
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1032391244"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s10817-007-9080-3"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s10817-007-9080-3", 
          "https://app.dimensions.ai/details/publication/pub.1032391244"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2022-01-01T18:16", 
        "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/article/article_433.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://doi.org/10.1007/s10817-007-9080-3"
      }
    ]
     

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

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s10817-007-9080-3'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s10817-007-9080-3'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10817-007-9080-3'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10817-007-9080-3'


     

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

    162 TRIPLES      22 PREDICATES      79 URIs      60 LITERALS      6 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s10817-007-9080-3 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author N623a5a88b5314fbb948a4d7611bf45a1
    4 schema:citation sg:pub.10.1007/11814771_26
    5 sg:pub.10.1007/11814771_53
    6 sg:pub.10.1007/11916277_16
    7 sg:pub.10.1007/3-540-45744-5_59
    8 sg:pub.10.1007/3-540-45744-5_6
    9 sg:pub.10.1007/978-1-4615-5643-5_8
    10 sg:pub.10.1007/978-3-540-24609-1_24
    11 sg:pub.10.1007/978-3-540-25984-8_7
    12 sg:pub.10.1007/978-3-540-27775-0_26
    13 sg:pub.10.1007/978-3-540-32275-7_2
    14 sg:pub.10.1007/s10817-008-9100-y
    15 schema:datePublished 2007-07-27
    16 schema:datePublishedReg 2007-07-27
    17 schema:description As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a novel reasoning algorithm that reduces a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{SHIQ}$\end{document} knowledge base to a disjunctive datalog program while preserving the set of ground consequences. Queries can then be answered in the resulting program while reusing existing and practically proven optimization techniques of deductive databases, such as join-order optimizations or magic sets. Moreover, we use our algorithm to derive precise data complexity bounds: we show that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{SHIQ}$\end{document} is data complete for NP, and we identify an expressive fragment of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{SHIQ}$\end{document} with polynomial data complexity.
    18 schema:genre article
    19 schema:inLanguage en
    20 schema:isAccessibleForFree false
    21 schema:isPartOf Ncc573e2aaaed4a57bdd974efa41ef000
    22 Nfc94dc0867b0457a9cde0202f052ec7f
    23 sg:journal.1136522
    24 schema:keywords Datalog
    25 Datalog programs
    26 NP
    27 algorithm
    28 applications
    29 assertion
    30 base
    31 basis
    32 bounds
    33 cases
    34 complexity
    35 complexity bounds
    36 consequences
    37 data
    38 data complexity
    39 data complexity bounds
    40 database
    41 deductive databases
    42 description logics
    43 disjunctive Datalog
    44 disjunctive datalog programs
    45 efficient reasoning
    46 expressive fragment
    47 fragments
    48 ground consequences
    49 join-order optimization
    50 knowledge base
    51 knowledge bases
    52 logic
    53 magic sets
    54 novel reasoning algorithm
    55 optimization
    56 optimization techniques
    57 polynomial data complexity
    58 precise data complexity bounds
    59 program
    60 queries
    61 reasoning
    62 reasoning algorithm
    63 reduction
    64 set
    65 such cases
    66 technique
    67 schema:name Reasoning in Description Logics by a Reduction to Disjunctive Datalog
    68 schema:pagination 351-384
    69 schema:productId N77efb6d64089474dbebffa9bf63157c4
    70 Nf55bb3f3bcf44f41bcd001471607e698
    71 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032391244
    72 https://doi.org/10.1007/s10817-007-9080-3
    73 schema:sdDatePublished 2022-01-01T18:16
    74 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    75 schema:sdPublisher N61a5f3e32eda49cda31eafb9bb24445f
    76 schema:url https://doi.org/10.1007/s10817-007-9080-3
    77 sgo:license sg:explorer/license/
    78 sgo:sdDataset articles
    79 rdf:type schema:ScholarlyArticle
    80 N61a5f3e32eda49cda31eafb9bb24445f schema:name Springer Nature - SN SciGraph project
    81 rdf:type schema:Organization
    82 N623a5a88b5314fbb948a4d7611bf45a1 rdf:first sg:person.015632277175.38
    83 rdf:rest N63881b2f67af4373af2640c1a480be5a
    84 N63881b2f67af4373af2640c1a480be5a rdf:first sg:person.07401076267.36
    85 rdf:rest N9d6f54f7c5d84a9185386f1ae98a47ff
    86 N77efb6d64089474dbebffa9bf63157c4 schema:name dimensions_id
    87 schema:value pub.1032391244
    88 rdf:type schema:PropertyValue
    89 N9d6f54f7c5d84a9185386f1ae98a47ff rdf:first sg:person.015322100453.31
    90 rdf:rest rdf:nil
    91 Ncc573e2aaaed4a57bdd974efa41ef000 schema:volumeNumber 39
    92 rdf:type schema:PublicationVolume
    93 Nf55bb3f3bcf44f41bcd001471607e698 schema:name doi
    94 schema:value 10.1007/s10817-007-9080-3
    95 rdf:type schema:PropertyValue
    96 Nfc94dc0867b0457a9cde0202f052ec7f schema:issueNumber 3
    97 rdf:type schema:PublicationIssue
    98 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    99 schema:name Information and Computing Sciences
    100 rdf:type schema:DefinedTerm
    101 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    102 schema:name Computation Theory and Mathematics
    103 rdf:type schema:DefinedTerm
    104 sg:journal.1136522 schema:issn 0168-7433
    105 1573-0670
    106 schema:name Journal of Automated Reasoning
    107 schema:publisher Springer Nature
    108 rdf:type schema:Periodical
    109 sg:person.015322100453.31 schema:affiliation grid-institutes:grid.5379.8
    110 schema:familyName Sattler
    111 schema:givenName Ulrike
    112 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015322100453.31
    113 rdf:type schema:Person
    114 sg:person.015632277175.38 schema:affiliation grid-institutes:grid.10025.36
    115 schema:familyName Hustadt
    116 schema:givenName Ullrich
    117 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015632277175.38
    118 rdf:type schema:Person
    119 sg:person.07401076267.36 schema:affiliation grid-institutes:grid.5379.8
    120 schema:familyName Motik
    121 schema:givenName Boris
    122 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07401076267.36
    123 rdf:type schema:Person
    124 sg:pub.10.1007/11814771_26 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033805137
    125 https://doi.org/10.1007/11814771_26
    126 rdf:type schema:CreativeWork
    127 sg:pub.10.1007/11814771_53 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007066017
    128 https://doi.org/10.1007/11814771_53
    129 rdf:type schema:CreativeWork
    130 sg:pub.10.1007/11916277_16 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001693914
    131 https://doi.org/10.1007/11916277_16
    132 rdf:type schema:CreativeWork
    133 sg:pub.10.1007/3-540-45744-5_59 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006632427
    134 https://doi.org/10.1007/3-540-45744-5_59
    135 rdf:type schema:CreativeWork
    136 sg:pub.10.1007/3-540-45744-5_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051248912
    137 https://doi.org/10.1007/3-540-45744-5_6
    138 rdf:type schema:CreativeWork
    139 sg:pub.10.1007/978-1-4615-5643-5_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018010800
    140 https://doi.org/10.1007/978-1-4615-5643-5_8
    141 rdf:type schema:CreativeWork
    142 sg:pub.10.1007/978-3-540-24609-1_24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035548198
    143 https://doi.org/10.1007/978-3-540-24609-1_24
    144 rdf:type schema:CreativeWork
    145 sg:pub.10.1007/978-3-540-25984-8_7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1034820411
    146 https://doi.org/10.1007/978-3-540-25984-8_7
    147 rdf:type schema:CreativeWork
    148 sg:pub.10.1007/978-3-540-27775-0_26 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004439226
    149 https://doi.org/10.1007/978-3-540-27775-0_26
    150 rdf:type schema:CreativeWork
    151 sg:pub.10.1007/978-3-540-32275-7_2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000889893
    152 https://doi.org/10.1007/978-3-540-32275-7_2
    153 rdf:type schema:CreativeWork
    154 sg:pub.10.1007/s10817-008-9100-y schema:sameAs https://app.dimensions.ai/details/publication/pub.1046493520
    155 https://doi.org/10.1007/s10817-008-9100-y
    156 rdf:type schema:CreativeWork
    157 grid-institutes:grid.10025.36 schema:alternateName Department of Computer Science, University of Liverpool, Liverpool, UK
    158 schema:name Department of Computer Science, University of Liverpool, Liverpool, UK
    159 rdf:type schema:Organization
    160 grid-institutes:grid.5379.8 schema:alternateName Department of Computer Science, University of Manchester, Manchester, UK
    161 schema:name Department of Computer Science, University of Manchester, Manchester, UK
    162 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...