图 书 馆
简单森林逻辑程序的混合推理Hybrid Reasoning with Simple Forest Logic Programs |
|
| 课程网址: | http://videolectures.net/eswc09_feier_hrws/ |
| 主讲教师: | Cristina Feier |
| 开课单位: | 维也纳科技大学 |
| 开课时间: | 2009-07-28 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | pen Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasoning procedures exist. In this paper, we provide a sound, complete, and terminating algorithm for satisfiability checking w.r.t. forest logic programs, a fragment where rules have a tree shape and allow for inequality atoms and constants. We further introduce f-hybrid knowledge bases, a hybrid framework where SHOQ knowledge bases and forest logic programs co-exist, and we show that reasoning with such knowledge bases can be reduced to reasoning with forest logic programs only. We note that f-hybrid knowledge bases do not require the usual (weakly) DL-safety of the rule component, providing thus a genuine alternative approach to hybrid reasoning. |
| 关 键 词: | 不等式原子; 常数; 混合知识库 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-04-10：lxf |
| 阅读次数: | 63 |