Closed world reasoning for OWL2 with NBox

Yuan Ren; Jeff Z. Pan; Yuting Zhao

doi:10.1016/S1007-0214(10)70117-6

Closed world reasoning for OWL2 with NBox

Yuan Ren, Jeff Z. Pan, Yuting Zhao

Computing Science

Research output: Contribution to journal › Article › peer-review

17 Citations (Scopus)

Abstract

This paper describes the problem of doing description logic (DL) reasoning with partially closed world. The issue was addressed by extending the syntax of DL SROIQ with an NBox, which specifies the predicates to close, extending the semantics with the idea of negation as failure, reducing the closed world reasoning to incremental reasoning on classical DL ontologies, and applying the syntactic approximation technology to improve the reasoning performance. Compared with the existing DBox approach, which corresponds to the relation database, the NBox approach supports deduction on closed concepts and roles. Also, the approximate reasoning can reduce reasoning complexity from N2EXPTIME-complete to PTIME-complete while preserving the correctness of reasoning for ontologies with certain properties.

Original language	English
Pages (from-to)	692-701
Number of pages	10
Journal	Tsinghua Science and Technology
Volume	15
Issue number	6
DOIs	https://doi.org/10.1016/S1007-0214(10)70117-6
Publication status	Published - 1 Dec 2010

Keywords

approximation
closed world
ontology
reasoning

Access to Document

10.1016/S1007-0214(10)70117-6Licence: Unspecified

Cite this

@article{8c51d4f1cce34d21891e16ba0ce109c0,

title = "Closed world reasoning for OWL2 with NBox",

abstract = "This paper describes the problem of doing description logic (DL) reasoning with partially closed world. The issue was addressed by extending the syntax of DL SROIQ with an NBox, which specifies the predicates to close, extending the semantics with the idea of negation as failure, reducing the closed world reasoning to incremental reasoning on classical DL ontologies, and applying the syntactic approximation technology to improve the reasoning performance. Compared with the existing DBox approach, which corresponds to the relation database, the NBox approach supports deduction on closed concepts and roles. Also, the approximate reasoning can reduce reasoning complexity from N2EXPTIME-complete to PTIME-complete while preserving the correctness of reasoning for ontologies with certain properties.",

keywords = "approximation, closed world, ontology, reasoning",

author = "Yuan Ren and Pan, {Jeff Z.} and Yuting Zhao",

year = "2010",

month = dec,

day = "1",

doi = "10.1016/S1007-0214(10)70117-6",

language = "English",

volume = "15",

pages = "692--701",

journal = "Tsinghua Science and Technology",

issn = "1007-0214",

publisher = "Tsing Hua University",

number = "6",

}

TY - JOUR

T1 - Closed world reasoning for OWL2 with NBox

AU - Ren, Yuan

AU - Pan, Jeff Z.

AU - Zhao, Yuting

PY - 2010/12/1

Y1 - 2010/12/1

N2 - This paper describes the problem of doing description logic (DL) reasoning with partially closed world. The issue was addressed by extending the syntax of DL SROIQ with an NBox, which specifies the predicates to close, extending the semantics with the idea of negation as failure, reducing the closed world reasoning to incremental reasoning on classical DL ontologies, and applying the syntactic approximation technology to improve the reasoning performance. Compared with the existing DBox approach, which corresponds to the relation database, the NBox approach supports deduction on closed concepts and roles. Also, the approximate reasoning can reduce reasoning complexity from N2EXPTIME-complete to PTIME-complete while preserving the correctness of reasoning for ontologies with certain properties.

AB - This paper describes the problem of doing description logic (DL) reasoning with partially closed world. The issue was addressed by extending the syntax of DL SROIQ with an NBox, which specifies the predicates to close, extending the semantics with the idea of negation as failure, reducing the closed world reasoning to incremental reasoning on classical DL ontologies, and applying the syntactic approximation technology to improve the reasoning performance. Compared with the existing DBox approach, which corresponds to the relation database, the NBox approach supports deduction on closed concepts and roles. Also, the approximate reasoning can reduce reasoning complexity from N2EXPTIME-complete to PTIME-complete while preserving the correctness of reasoning for ontologies with certain properties.

KW - approximation

KW - closed world

KW - ontology

KW - reasoning

UR - http://www.scopus.com/inward/record.url?scp=78649814646&partnerID=8YFLogxK

U2 - 10.1016/S1007-0214(10)70117-6

DO - 10.1016/S1007-0214(10)70117-6

M3 - Article

AN - SCOPUS:78649814646

SN - 1007-0214

VL - 15

SP - 692

EP - 701

JO - Tsinghua Science and Technology

JF - Tsinghua Science and Technology

IS - 6

ER -

Closed world reasoning for OWL2 with NBox

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this