RDL : enhancing description logic with rules

Yi Zhou; Yan Zhang

doi:10.1007/978-3-642-35101-3_48

RDL : enhancing description logic with rules

Yi Zhou, Yan Zhang

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

1 Citation (Scopus)

Abstract

In this paper, we propose Rule Description Logic (RDL) for enhancing Description Logic (DL) with nonmonotonic recursive rules, like those in Answer Set Programming (ASP). We define the world view semantics for RDL and show that it is faithful with respect to both DL and ASP. More importantly, we show that the full language of RDL is decidable.

Original language	English
Pages (from-to)	567-578
Number of pages	12
Journal	Lecture Notes in Computer Science
Volume	7691
DOIs	https://doi.org/10.1007/978-3-642-35101-3_48
Publication status	Published - 2012

Keywords

artificial intelligence
description logic rules
logic programming
semantics

Access to Document

10.1007/978-3-642-35101-3_48

Cite this

@article{e64bbd03790c4ab1ba084f6d5b36a3d7,

title = "RDL : enhancing description logic with rules",

abstract = "In this paper, we propose Rule Description Logic (RDL) for enhancing Description Logic (DL) with nonmonotonic recursive rules, like those in Answer Set Programming (ASP). We define the world view semantics for RDL and show that it is faithful with respect to both DL and ASP. More importantly, we show that the full language of RDL is decidable.",

keywords = "artificial intelligence, description logic rules, logic programming, semantics",

author = "Yi Zhou and Yan Zhang",

year = "2012",

doi = "10.1007/978-3-642-35101-3_48",

language = "English",

volume = "7691",

pages = "567--578",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer",

}

TY - JOUR

T1 - RDL : enhancing description logic with rules

AU - Zhou, Yi

AU - Zhang, Yan

PY - 2012

Y1 - 2012

N2 - In this paper, we propose Rule Description Logic (RDL) for enhancing Description Logic (DL) with nonmonotonic recursive rules, like those in Answer Set Programming (ASP). We define the world view semantics for RDL and show that it is faithful with respect to both DL and ASP. More importantly, we show that the full language of RDL is decidable.

AB - In this paper, we propose Rule Description Logic (RDL) for enhancing Description Logic (DL) with nonmonotonic recursive rules, like those in Answer Set Programming (ASP). We define the world view semantics for RDL and show that it is faithful with respect to both DL and ASP. More importantly, we show that the full language of RDL is decidable.

KW - artificial intelligence

KW - description logic rules

KW - logic programming

KW - semantics

UR - http://handle.uws.edu.au:8081/1959.7/523723

U2 - 10.1007/978-3-642-35101-3_48

DO - 10.1007/978-3-642-35101-3_48

M3 - Article

SN - 0302-9743

VL - 7691

SP - 567

EP - 578

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -

RDL : enhancing description logic with rules

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this