Combining Description Logics, Description Graphs, and Rules View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2009

AUTHORS

Boris Motik

ABSTRACT

Recent practical experience with description logics (DLs) has revealed that their expressivity is often insufficient to accurately describe structured objects—objects whose parts are interconnected in arbitrary, rather than tree-like ways. To address this problem, we propose an extension of DL languages with description graphs—a modeling construct that can accurately describe objects whose parts are connected in arbitrary ways. Furthermore, to enable modeling the conditional aspects of structured objects, we also incorporate rules into our formalism. We present an in-depth study of the computational properties of such a formalism. In particular, we first identify the sources of undecidability of the general, unrestricted formalism, and then present a restriction that makes reasoning decidable. Finally, we present tight complexity bounds. More... »

PAGES

43-67

Book

TITLE

Frontiers of Combining Systems

ISBN

978-3-642-04221-8
978-3-642-04222-5

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-04222-5_3

DOI

http://dx.doi.org/10.1007/978-3-642-04222-5_3

DIMENSIONS

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


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/17", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Psychology and Cognitive Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1702", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Cognitive Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Computing Laboratory, University of Oxford, UK", 
          "id": "http://www.grid.ac/institutes/grid.4991.5", 
          "name": [
            "Computing Laboratory, University of Oxford, 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"
      }
    ], 
    "datePublished": "2009", 
    "datePublishedReg": "2009-01-01", 
    "description": "Recent practical experience with description logics (DLs) has revealed that their expressivity is often insufficient to accurately describe structured objects\u2014objects whose parts are interconnected in arbitrary, rather than tree-like ways. To address this problem, we propose an extension of DL languages with description graphs\u2014a modeling construct that can accurately describe objects whose parts are connected in arbitrary ways. Furthermore, to enable modeling the conditional aspects of structured objects, we also incorporate rules into our formalism. We present an in-depth study of the computational properties of such a formalism. In particular, we first identify the sources of undecidability of the general, unrestricted formalism, and then present a restriction that makes reasoning decidable. Finally, we present tight complexity bounds.", 
    "editor": [
      {
        "familyName": "Ghilardi", 
        "givenName": "Silvio", 
        "type": "Person"
      }, 
      {
        "familyName": "Sebastiani", 
        "givenName": "Roberto", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-04222-5_3", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-642-04221-8", 
        "978-3-642-04222-5"
      ], 
      "name": "Frontiers of Combining Systems", 
      "type": "Book"
    }, 
    "keywords": [
      "description logics", 
      "description graph", 
      "modeling constructs", 
      "DL language", 
      "structured objects", 
      "tight complexity bounds", 
      "computational properties", 
      "complexity bounds", 
      "recent practical experience", 
      "graph", 
      "practical experience", 
      "logic", 
      "objects", 
      "arbitrary way", 
      "rules", 
      "reasoning", 
      "language", 
      "formalism", 
      "expressivity", 
      "way", 
      "depth study", 
      "conditional aspects", 
      "undecidability", 
      "bounds", 
      "extension", 
      "part", 
      "aspects", 
      "experience", 
      "restriction", 
      "constructs", 
      "source", 
      "properties", 
      "study", 
      "problem", 
      "tree-like way", 
      "sources of undecidability", 
      "unrestricted formalism"
    ], 
    "name": "Combining Description Logics, Description Graphs, and Rules", 
    "pagination": "43-67", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1030583327"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-04222-5_3"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-04222-5_3", 
      "https://app.dimensions.ai/details/publication/pub.1030583327"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:21", 
    "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/chapter/chapter_383.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-04222-5_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/978-3-642-04222-5_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/978-3-642-04222-5_3'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-04222-5_3'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-04222-5_3'


 

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

102 TRIPLES      23 PREDICATES      63 URIs      56 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-04222-5_3 schema:about anzsrc-for:17
2 anzsrc-for:1702
3 schema:author N31fb7d685e8e4ec9817ab7487b95a623
4 schema:datePublished 2009
5 schema:datePublishedReg 2009-01-01
6 schema:description Recent practical experience with description logics (DLs) has revealed that their expressivity is often insufficient to accurately describe structured objects—objects whose parts are interconnected in arbitrary, rather than tree-like ways. To address this problem, we propose an extension of DL languages with description graphs—a modeling construct that can accurately describe objects whose parts are connected in arbitrary ways. Furthermore, to enable modeling the conditional aspects of structured objects, we also incorporate rules into our formalism. We present an in-depth study of the computational properties of such a formalism. In particular, we first identify the sources of undecidability of the general, unrestricted formalism, and then present a restriction that makes reasoning decidable. Finally, we present tight complexity bounds.
7 schema:editor N0ece982d8a94479f97714b92fa154873
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N8b4dbf552fb648f4814fc725946f3047
12 schema:keywords DL language
13 arbitrary way
14 aspects
15 bounds
16 complexity bounds
17 computational properties
18 conditional aspects
19 constructs
20 depth study
21 description graph
22 description logics
23 experience
24 expressivity
25 extension
26 formalism
27 graph
28 language
29 logic
30 modeling constructs
31 objects
32 part
33 practical experience
34 problem
35 properties
36 reasoning
37 recent practical experience
38 restriction
39 rules
40 source
41 sources of undecidability
42 structured objects
43 study
44 tight complexity bounds
45 tree-like way
46 undecidability
47 unrestricted formalism
48 way
49 schema:name Combining Description Logics, Description Graphs, and Rules
50 schema:pagination 43-67
51 schema:productId N507eaf4054b8423198d56c50ad1dea65
52 N655f5a52edf74965b0ddbb1c22e780cc
53 schema:publisher N4f59242b02534873b0c4bd32a696a93e
54 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030583327
55 https://doi.org/10.1007/978-3-642-04222-5_3
56 schema:sdDatePublished 2022-01-01T19:21
57 schema:sdLicense https://scigraph.springernature.com/explorer/license/
58 schema:sdPublisher Nfde8ac11838544aaaa92410fc59cf8a3
59 schema:url https://doi.org/10.1007/978-3-642-04222-5_3
60 sgo:license sg:explorer/license/
61 sgo:sdDataset chapters
62 rdf:type schema:Chapter
63 N00ce790b43544e188b4d97aa27261467 schema:familyName Ghilardi
64 schema:givenName Silvio
65 rdf:type schema:Person
66 N0ece982d8a94479f97714b92fa154873 rdf:first N00ce790b43544e188b4d97aa27261467
67 rdf:rest N947724298574414e9bf72e08d5204eb0
68 N31fb7d685e8e4ec9817ab7487b95a623 rdf:first sg:person.07401076267.36
69 rdf:rest rdf:nil
70 N4f59242b02534873b0c4bd32a696a93e schema:name Springer Nature
71 rdf:type schema:Organisation
72 N507eaf4054b8423198d56c50ad1dea65 schema:name dimensions_id
73 schema:value pub.1030583327
74 rdf:type schema:PropertyValue
75 N655f5a52edf74965b0ddbb1c22e780cc schema:name doi
76 schema:value 10.1007/978-3-642-04222-5_3
77 rdf:type schema:PropertyValue
78 N8b4dbf552fb648f4814fc725946f3047 schema:isbn 978-3-642-04221-8
79 978-3-642-04222-5
80 schema:name Frontiers of Combining Systems
81 rdf:type schema:Book
82 N947724298574414e9bf72e08d5204eb0 rdf:first Ne8a23adbdeb347538b1c386524dd3e42
83 rdf:rest rdf:nil
84 Ne8a23adbdeb347538b1c386524dd3e42 schema:familyName Sebastiani
85 schema:givenName Roberto
86 rdf:type schema:Person
87 Nfde8ac11838544aaaa92410fc59cf8a3 schema:name Springer Nature - SN SciGraph project
88 rdf:type schema:Organization
89 anzsrc-for:17 schema:inDefinedTermSet anzsrc-for:
90 schema:name Psychology and Cognitive Sciences
91 rdf:type schema:DefinedTerm
92 anzsrc-for:1702 schema:inDefinedTermSet anzsrc-for:
93 schema:name Cognitive Sciences
94 rdf:type schema:DefinedTerm
95 sg:person.07401076267.36 schema:affiliation grid-institutes:grid.4991.5
96 schema:familyName Motik
97 schema:givenName Boris
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07401076267.36
99 rdf:type schema:Person
100 grid-institutes:grid.4991.5 schema:alternateName Computing Laboratory, University of Oxford, UK
101 schema:name Computing Laboratory, University of Oxford, UK
102 rdf:type schema:Organization
 




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


...