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", 
      "DL language", 
      "tight complexity bounds", 
      "modeling constructs", 
      "structured objects", 
      "tree-like way", 
      "recent practical experience", 
      "complexity bounds", 
      "computational properties", 
      "arbitrary way", 
      "graph", 
      "logic", 
      "objects", 
      "practical experience", 
      "rules", 
      "conditional aspects", 
      "reasoning", 
      "unrestricted formalism", 
      "language", 
      "formalism", 
      "way", 
      "depth study", 
      "expressivity", 
      "undecidability", 
      "bounds", 
      "extension", 
      "part", 
      "aspects", 
      "experience", 
      "restriction", 
      "constructs", 
      "source", 
      "properties", 
      "study", 
      "problem"
    ], 
    "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-05-20T07:48", 
    "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_446.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.

101 TRIPLES      23 PREDICATES      62 URIs      55 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 Nc6031348a9c3442e9ae8410cf2509450
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 N231bfa7187274026bd4b8978c54a4adc
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Na6fe5b3df5a74d8780c5a18d22536958
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 structured objects
42 study
43 tight complexity bounds
44 tree-like way
45 undecidability
46 unrestricted formalism
47 way
48 schema:name Combining Description Logics, Description Graphs, and Rules
49 schema:pagination 43-67
50 schema:productId N426a95ce5beb45588d38fe660921d125
51 Na206432fc1d5475797731e47c342df47
52 schema:publisher Na4ea3726afe04fbd9027aec7cd36708e
53 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030583327
54 https://doi.org/10.1007/978-3-642-04222-5_3
55 schema:sdDatePublished 2022-05-20T07:48
56 schema:sdLicense https://scigraph.springernature.com/explorer/license/
57 schema:sdPublisher N761c5134870343f6963d10ee169405b0
58 schema:url https://doi.org/10.1007/978-3-642-04222-5_3
59 sgo:license sg:explorer/license/
60 sgo:sdDataset chapters
61 rdf:type schema:Chapter
62 N231bfa7187274026bd4b8978c54a4adc rdf:first N88deaebed84b4f1992efca3153c1b90e
63 rdf:rest Nce612d49549444daa0e180362d203691
64 N426a95ce5beb45588d38fe660921d125 schema:name doi
65 schema:value 10.1007/978-3-642-04222-5_3
66 rdf:type schema:PropertyValue
67 N59cdbc88e9a44f34a70fa6e5924eaa5c schema:familyName Sebastiani
68 schema:givenName Roberto
69 rdf:type schema:Person
70 N761c5134870343f6963d10ee169405b0 schema:name Springer Nature - SN SciGraph project
71 rdf:type schema:Organization
72 N88deaebed84b4f1992efca3153c1b90e schema:familyName Ghilardi
73 schema:givenName Silvio
74 rdf:type schema:Person
75 Na206432fc1d5475797731e47c342df47 schema:name dimensions_id
76 schema:value pub.1030583327
77 rdf:type schema:PropertyValue
78 Na4ea3726afe04fbd9027aec7cd36708e schema:name Springer Nature
79 rdf:type schema:Organisation
80 Na6fe5b3df5a74d8780c5a18d22536958 schema:isbn 978-3-642-04221-8
81 978-3-642-04222-5
82 schema:name Frontiers of Combining Systems
83 rdf:type schema:Book
84 Nc6031348a9c3442e9ae8410cf2509450 rdf:first sg:person.07401076267.36
85 rdf:rest rdf:nil
86 Nce612d49549444daa0e180362d203691 rdf:first N59cdbc88e9a44f34a70fa6e5924eaa5c
87 rdf:rest rdf:nil
88 anzsrc-for:17 schema:inDefinedTermSet anzsrc-for:
89 schema:name Psychology and Cognitive Sciences
90 rdf:type schema:DefinedTerm
91 anzsrc-for:1702 schema:inDefinedTermSet anzsrc-for:
92 schema:name Cognitive Sciences
93 rdf:type schema:DefinedTerm
94 sg:person.07401076267.36 schema:affiliation grid-institutes:grid.4991.5
95 schema:familyName Motik
96 schema:givenName Boris
97 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07401076267.36
98 rdf:type schema:Person
99 grid-institutes:grid.4991.5 schema:alternateName Computing Laboratory, University of Oxford, UK
100 schema:name Computing Laboratory, University of Oxford, UK
101 rdf:type schema:Organization
 




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


...