A description logic based approach to formalizing the information bearing capability of paths in ER schemata

Xu, Kaibo, Junkang Feng, Malcolm Crowe, Lin Liu

Research output: Contribution to journalArticle

Abstract

The purpose of this paper is to show how description logics (DLs) can be applied to formalizing the information bearing capability (IBC) of paths in entity-relationship (ER) schemata.

The approach follows and extends the idea presented in Xu and Feng (2004), which applies DLs to classifying paths in an ER schema. To verify whether the information content of a data construct (e.g. a path) covers a semantic relation (which formulates a piece of information requirement), the principle of IBC under the source-bearer-receiver framework is presented. It is observed that the IBC principle can be formalized by constructing DL expressions and examining constructors (e.g. quantifiers).

Description logic can be used as a tool to describe the meanings represented by paths in an ER schema and formalize their IBC. The criteria for identifying data construct distinguishability are also discovered by examining quantifiers in DL expressions of paths of an ER schema.

This paper focuses on classifying paths in data schemas and verifying their formalized IBC by using DLs and the IBC principle. It is a new point of view for evaluation of data representation, which looks at the information borne by data but not data dependencies.
Original languageEnglish
Pages (from-to)279-291
Number of pages12
JournalInternational Journal of Intelligent Computing and Cybernetics
Volume8
Issue number3
DOIs
Publication statusPublished - 10 Aug 2015

Fingerprint

Bearings (structural)
Semantics

Cite this

@article{e26b9739aa2c4419b1f03f34b58f96a7,
title = "A description logic based approach to formalizing the information bearing capability of paths in ER schemata",
abstract = "The purpose of this paper is to show how description logics (DLs) can be applied to formalizing the information bearing capability (IBC) of paths in entity-relationship (ER) schemata.The approach follows and extends the idea presented in Xu and Feng (2004), which applies DLs to classifying paths in an ER schema. To verify whether the information content of a data construct (e.g. a path) covers a semantic relation (which formulates a piece of information requirement), the principle of IBC under the source-bearer-receiver framework is presented. It is observed that the IBC principle can be formalized by constructing DL expressions and examining constructors (e.g. quantifiers). Description logic can be used as a tool to describe the meanings represented by paths in an ER schema and formalize their IBC. The criteria for identifying data construct distinguishability are also discovered by examining quantifiers in DL expressions of paths of an ER schema. This paper focuses on classifying paths in data schemas and verifying their formalized IBC by using DLs and the IBC principle. It is a new point of view for evaluation of data representation, which looks at the information borne by data but not data dependencies.",
author = "Xu, Kaibo and Junkang Feng and Malcolm Crowe and Lin Liu",
year = "2015",
month = "8",
day = "10",
doi = "10.1108/IJICC-08-2014-0039",
language = "English",
volume = "8",
pages = "279--291",
journal = "International Journal of Intelligent Computing and Cybernetics",
issn = "1756-378X",
publisher = "Emerald Publishing Limited",
number = "3",

}

A description logic based approach to formalizing the information bearing capability of paths in ER schemata. / Kaibo, Xu,; Feng, Junkang; Crowe, Malcolm; Liu, Lin.

In: International Journal of Intelligent Computing and Cybernetics, Vol. 8, No. 3, 10.08.2015, p. 279-291.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A description logic based approach to formalizing the information bearing capability of paths in ER schemata

AU - Kaibo, Xu,

AU - Feng, Junkang

AU - Crowe, Malcolm

AU - Liu, Lin

PY - 2015/8/10

Y1 - 2015/8/10

N2 - The purpose of this paper is to show how description logics (DLs) can be applied to formalizing the information bearing capability (IBC) of paths in entity-relationship (ER) schemata.The approach follows and extends the idea presented in Xu and Feng (2004), which applies DLs to classifying paths in an ER schema. To verify whether the information content of a data construct (e.g. a path) covers a semantic relation (which formulates a piece of information requirement), the principle of IBC under the source-bearer-receiver framework is presented. It is observed that the IBC principle can be formalized by constructing DL expressions and examining constructors (e.g. quantifiers). Description logic can be used as a tool to describe the meanings represented by paths in an ER schema and formalize their IBC. The criteria for identifying data construct distinguishability are also discovered by examining quantifiers in DL expressions of paths of an ER schema. This paper focuses on classifying paths in data schemas and verifying their formalized IBC by using DLs and the IBC principle. It is a new point of view for evaluation of data representation, which looks at the information borne by data but not data dependencies.

AB - The purpose of this paper is to show how description logics (DLs) can be applied to formalizing the information bearing capability (IBC) of paths in entity-relationship (ER) schemata.The approach follows and extends the idea presented in Xu and Feng (2004), which applies DLs to classifying paths in an ER schema. To verify whether the information content of a data construct (e.g. a path) covers a semantic relation (which formulates a piece of information requirement), the principle of IBC under the source-bearer-receiver framework is presented. It is observed that the IBC principle can be formalized by constructing DL expressions and examining constructors (e.g. quantifiers). Description logic can be used as a tool to describe the meanings represented by paths in an ER schema and formalize their IBC. The criteria for identifying data construct distinguishability are also discovered by examining quantifiers in DL expressions of paths of an ER schema. This paper focuses on classifying paths in data schemas and verifying their formalized IBC by using DLs and the IBC principle. It is a new point of view for evaluation of data representation, which looks at the information borne by data but not data dependencies.

U2 - 10.1108/IJICC-08-2014-0039

DO - 10.1108/IJICC-08-2014-0039

M3 - Article

VL - 8

SP - 279

EP - 291

JO - International Journal of Intelligent Computing and Cybernetics

JF - International Journal of Intelligent Computing and Cybernetics

SN - 1756-378X

IS - 3

ER -