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. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/978-3-642-35101-3_48 | Australasian Conference on Artificial Intelligence |
Keywords | DocType | Citations |
nonmonotonic recursive rule,description logic,rule description logic,full language,answer set programming,world view semantics | Conference | 0 |
PageRank | References | Authors |
0.34 | 15 | 2 |