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": "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_376.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 N40ce425ced764a2487f97c3b4f7dcfc2
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 N757e340f855b4266811595d319a46037
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N2d61aed93501482d8c123f38e58f8f3b
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 N1cfffae9a8eb4b07835118a55fd9ef80
48 N6d61de89f95a468eb4a9527409560706
49 schema:publisher Na79fe70a076f464eb15140943a87e42d
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 2022-01-01T19:21
53 schema:sdLicense https://scigraph.springernature.com/explorer/license/
54 schema:sdPublisher Nfb8e24a8b60d41f8ad70375af7eec21f
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 N1cfffae9a8eb4b07835118a55fd9ef80 schema:name dimensions_id
60 schema:value pub.1046674633
61 rdf:type schema:PropertyValue
62 N2d61aed93501482d8c123f38e58f8f3b 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 N3175a1545bdb45768f3d6bcb50a9fc84 rdf:first Na6687f2b87fb47cfbb5b5e52d3b411f0
67 rdf:rest rdf:nil
68 N40ce425ced764a2487f97c3b4f7dcfc2 rdf:first sg:person.0656102354.93
69 rdf:rest Nb07f6c8b31c04e83922d37b7c9a34383
70 N63ac427508e24749a5192cda4728925d schema:familyName Ramakrishnan
71 schema:givenName Raghu
72 rdf:type schema:Person
73 N6d61de89f95a468eb4a9527409560706 schema:name doi
74 schema:value 10.1007/3-540-63792-3_10
75 rdf:type schema:PropertyValue
76 N757e340f855b4266811595d319a46037 rdf:first N9fe6782818b645708a45347dbbfce859
77 rdf:rest Nc10f4df743934933abb153d2b2d09ff2
78 N9fe6782818b645708a45347dbbfce859 schema:familyName Bry
79 schema:givenName François
80 rdf:type schema:Person
81 Na6687f2b87fb47cfbb5b5e52d3b411f0 schema:familyName Ramamohanarao
82 schema:givenName Kotagiri
83 rdf:type schema:Person
84 Na79fe70a076f464eb15140943a87e42d schema:name Springer Nature
85 rdf:type schema:Organisation
86 Nb07f6c8b31c04e83922d37b7c9a34383 rdf:first sg:person.01111756132.29
87 rdf:rest rdf:nil
88 Nc10f4df743934933abb153d2b2d09ff2 rdf:first N63ac427508e24749a5192cda4728925d
89 rdf:rest N3175a1545bdb45768f3d6bcb50a9fc84
90 Nfb8e24a8b60d41f8ad70375af7eec21f schema:name Springer Nature - SN SciGraph project
91 rdf:type schema:Organization
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)


...