Adding uniqueness constraints to description logics View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1997

AUTHORS

Alex Borgida , Grant Weddell

ABSTRACT

After explaining some of the benefits of capturing uniqueness constraints, such as keys and functional dependencies, in any object-centered data model, we consider a number of alternative semantics for concept constructors that could be introduced for this purpose in Description Logics. Most significantly, we show that Classic—the hitherto most expressive DL for which reasoning is tractable, can be extended with a version of constructors capturing functional dependencies (including keys) while still possessing subsumption and consistency checking algorithms that are sound, complete, and run in low-order polynomial time. The results continue to hold even when we introduce cycles in the part-of hierarchy. More... »

PAGES

85-102

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-63792-3_10

DOI

http://dx.doi.org/10.1007/3-540-63792-3_10

DIMENSIONS

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


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": "Dept. of Computer Science, Rutgers University, NJ08903, New Brunswick, USA", 
          "id": "http://www.grid.ac/institutes/grid.430387.b", 
          "name": [
            "Dept. of Computer Science, Rutgers University, NJ08903, New Brunswick, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Borgida", 
        "givenName": "Alex", 
        "id": "sg:person.0656102354.93", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0656102354.93"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dept. of Computer Science, University of Waterloo, Waterloo, Ontario, Canada", 
          "id": "http://www.grid.ac/institutes/grid.46078.3d", 
          "name": [
            "Dept. of Computer Science, University of Waterloo, Waterloo, Ontario, Canada"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Weddell", 
        "givenName": "Grant", 
        "id": "sg:person.01111756132.29", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01111756132.29"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1997", 
    "datePublishedReg": "1997-01-01", 
    "description": "After explaining some of the benefits of capturing uniqueness constraints, such as keys and functional dependencies, in any object-centered data model, we consider a number of alternative semantics for concept constructors that could be introduced for this purpose in Description Logics. Most significantly, we show that Classic\u2014the hitherto most expressive DL for which reasoning is tractable, can be extended with a version of constructors capturing functional dependencies (including keys) while still possessing subsumption and consistency checking algorithms that are sound, complete, and run in low-order polynomial time. The results continue to hold even when we introduce cycles in the part-of hierarchy.", 
    "editor": [
      {
        "familyName": "Bry", 
        "givenName": "Fran\u00e7ois", 
        "type": "Person"
      }, 
      {
        "familyName": "Ramakrishnan", 
        "givenName": "Raghu", 
        "type": "Person"
      }, 
      {
        "familyName": "Ramamohanarao", 
        "givenName": "Kotagiri", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-63792-3_10", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-63792-9", 
        "978-3-540-69647-6"
      ], 
      "name": "Deductive and Object-Oriented Databases", 
      "type": "Book"
    }, 
    "keywords": [
      "description logics", 
      "low-order polynomial time", 
      "uniqueness constraints", 
      "functional dependencies", 
      "data model", 
      "expressive DL", 
      "polynomial time", 
      "alternative semantics", 
      "concept constructors", 
      "logic", 
      "constructors", 
      "constraints", 
      "semantics", 
      "algorithm", 
      "subsumption", 
      "reasoning", 
      "dependency", 
      "key", 
      "hierarchy", 
      "version", 
      "consistency", 
      "model", 
      "benefits", 
      "number", 
      "time", 
      "purpose", 
      "results", 
      "part", 
      "cycle", 
      "classic", 
      "dl", 
      "object-centered data model", 
      "version of constructors"
    ], 
    "name": "Adding uniqueness constraints to description logics", 
    "pagination": "85-102", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1046674633"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-63792-3_10"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-63792-3_10", 
      "https://app.dimensions.ai/details/publication/pub.1046674633"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-12-01T20:10", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/chapter/chapter_44.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-63792-3_10"
  }
]
 

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/3-540-63792-3_10'

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/3-540-63792-3_10'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-63792-3_10'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-63792-3_10'


 

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

113 TRIPLES      23 PREDICATES      59 URIs      52 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-63792-3_10 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Nf7c33fec32c84ce0a9c39b1213ca2b18
4 schema:datePublished 1997
5 schema:datePublishedReg 1997-01-01
6 schema:description After explaining some of the benefits of capturing uniqueness constraints, such as keys and functional dependencies, in any object-centered data model, we consider a number of alternative semantics for concept constructors that could be introduced for this purpose in Description Logics. Most significantly, we show that Classic—the hitherto most expressive DL for which reasoning is tractable, can be extended with a version of constructors capturing functional dependencies (including keys) while still possessing subsumption and consistency checking algorithms that are sound, complete, and run in low-order polynomial time. The results continue to hold even when we introduce cycles in the part-of hierarchy.
7 schema:editor N387073e5065a449290069db07ca22e27
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N1c02bf1e7edb472aba1e5adb1f6fc693
12 schema:keywords algorithm
13 alternative semantics
14 benefits
15 classic
16 concept constructors
17 consistency
18 constraints
19 constructors
20 cycle
21 data model
22 dependency
23 description logics
24 dl
25 expressive DL
26 functional dependencies
27 hierarchy
28 key
29 logic
30 low-order polynomial time
31 model
32 number
33 object-centered data model
34 part
35 polynomial time
36 purpose
37 reasoning
38 results
39 semantics
40 subsumption
41 time
42 uniqueness constraints
43 version
44 version of constructors
45 schema:name Adding uniqueness constraints to description logics
46 schema:pagination 85-102
47 schema:productId N41bf14268d40424e81dd4244cef5c4df
48 N9ac9e0699d1d47048e0652cc870e019a
49 schema:publisher Nd0b2b5b3952e4804a75b14336fd8b16e
50 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046674633
51 https://doi.org/10.1007/3-540-63792-3_10
52 schema:sdDatePublished 2021-12-01T20:10
53 schema:sdLicense https://scigraph.springernature.com/explorer/license/
54 schema:sdPublisher N9c74ffa3a391485a850cc7d2d02046a7
55 schema:url https://doi.org/10.1007/3-540-63792-3_10
56 sgo:license sg:explorer/license/
57 sgo:sdDataset chapters
58 rdf:type schema:Chapter
59 N12fbad0a41b845a59808e8f92f1ef3d9 schema:familyName Bry
60 schema:givenName François
61 rdf:type schema:Person
62 N1c02bf1e7edb472aba1e5adb1f6fc693 schema:isbn 978-3-540-63792-9
63 978-3-540-69647-6
64 schema:name Deductive and Object-Oriented Databases
65 rdf:type schema:Book
66 N387073e5065a449290069db07ca22e27 rdf:first N12fbad0a41b845a59808e8f92f1ef3d9
67 rdf:rest N5e86fec5688e437cb5401a8d69a261e4
68 N41bf14268d40424e81dd4244cef5c4df schema:name dimensions_id
69 schema:value pub.1046674633
70 rdf:type schema:PropertyValue
71 N5b1d26256d69449e88fb87509951c022 schema:familyName Ramamohanarao
72 schema:givenName Kotagiri
73 rdf:type schema:Person
74 N5e86fec5688e437cb5401a8d69a261e4 rdf:first N98ac7ff752824f2596ac3703df66a4e2
75 rdf:rest N9079b9ebb32a4cc9bcb6b1ca9991acef
76 N9079b9ebb32a4cc9bcb6b1ca9991acef rdf:first N5b1d26256d69449e88fb87509951c022
77 rdf:rest rdf:nil
78 N98ac7ff752824f2596ac3703df66a4e2 schema:familyName Ramakrishnan
79 schema:givenName Raghu
80 rdf:type schema:Person
81 N9ac9e0699d1d47048e0652cc870e019a schema:name doi
82 schema:value 10.1007/3-540-63792-3_10
83 rdf:type schema:PropertyValue
84 N9c74ffa3a391485a850cc7d2d02046a7 schema:name Springer Nature - SN SciGraph project
85 rdf:type schema:Organization
86 Nb27d32ec88ea4aadb64b9e78713305c4 rdf:first sg:person.01111756132.29
87 rdf:rest rdf:nil
88 Nd0b2b5b3952e4804a75b14336fd8b16e schema:name Springer Nature
89 rdf:type schema:Organisation
90 Nf7c33fec32c84ce0a9c39b1213ca2b18 rdf:first sg:person.0656102354.93
91 rdf:rest Nb27d32ec88ea4aadb64b9e78713305c4
92 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
93 schema:name Information and Computing Sciences
94 rdf:type schema:DefinedTerm
95 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
96 schema:name Computation Theory and Mathematics
97 rdf:type schema:DefinedTerm
98 sg:person.01111756132.29 schema:affiliation grid-institutes:grid.46078.3d
99 schema:familyName Weddell
100 schema:givenName Grant
101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01111756132.29
102 rdf:type schema:Person
103 sg:person.0656102354.93 schema:affiliation grid-institutes:grid.430387.b
104 schema:familyName Borgida
105 schema:givenName Alex
106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0656102354.93
107 rdf:type schema:Person
108 grid-institutes:grid.430387.b schema:alternateName Dept. of Computer Science, Rutgers University, NJ08903, New Brunswick, USA
109 schema:name Dept. of Computer Science, Rutgers University, NJ08903, New Brunswick, USA
110 rdf:type schema:Organization
111 grid-institutes:grid.46078.3d schema:alternateName Dept. of Computer Science, University of Waterloo, Waterloo, Ontario, Canada
112 schema:name Dept. of Computer Science, University of Waterloo, Waterloo, Ontario, Canada
113 rdf:type schema:Organization
 




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


...