RDL: enhancing description logic with rules

Authors:
Yi Zhou;Yan Zhang
Affiliations:
Artificial Intelligence Research Group, School of Computing, Engineering and Mathematics, University of Western Sydney, Australia;Artificial Intelligence Research Group, School of Computing, Engineering and Mathematics, University of Western Sydney, Australia
Venue:
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Year:
2012

Citing 13
Cited 0

Minimal belief and negation as failure

Artificial Intelligence
{\cal A}{\cal L}-log: Integrating Datalog and Description Logics

Journal of Intelligent Information Systems
Description logic programs: combining logic programs with description logic

WWW '03 Proceedings of the 12th international conference on World Wide Web
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Combining answer set programming with description logics for the Semantic Web

Artificial Intelligence
Embedding non-ground logic programs into autoepistemic logic for knowledge-base combination

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The complexity of circumscription in description logic

Journal of Artificial Intelligence Research
OWL rules: A proposal and prototype implementation

Web Semantics: Science, Services and Agents on the World Wide Web
Reconciling description logics and rules

Journal of the ACM (JACM)
Quantified equilibrium logic and hybrid rules

RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Stable models and circumscription

Artificial Intelligence
From answer set logic programming to circumscription via logic of GK

Artificial Intelligence
A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

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.