|
使用语义wec的描述逻辑表达式扩展逻辑程序
Extending logic programs with description logic expressions for the semantic wec |
|
| |
| 课程网址: |
http://videolectures.net/iswc2011_shen_logic/
|
| 主讲教师: |
Yi Dong Shen
|
| 开课单位: |
中国科学院
|
| 开课时间: |
2011-11-25
|
| 课程语种: |
汉简
|
| 中文简介: |
最近，已经将注意力集中在用描述逻辑（DL）表达式扩展逻辑编程，使得逻辑程序能够访问DL知识库，因此能够在语义Web中推理本体。在本文中，我们提出了一种具有DL表达式的逻辑程序的新概括，称为正常DL逻辑程序。在正常的DL逻辑程序中，允许任意DL表达式出现在规则主体中，并且规则头中允许的原子DL表达式（即，原子概念和原子角色）。我们将标准答案集语义下的正常逻辑程序的良好支持的关键条件扩展到普通DL逻辑程序，并且为满足扩展井支持条件的DL逻辑程序细化ananswer set语义。我们表明，如果底层描述逻辑是可判定的（例如SHOIN或SROIQ），则正常DL逻辑程序的答案集语义是可判定的。
|
| 课程简介: |
Recently much attention has been directed to extending logic programming with description logic (DL) expressions, so that logic pro- grams have access to DL knowledge bases and thus are able to reason with ontologies in the Semantic Web. In this paper, we propose a new extension of logic programs with DL expressions, called normal DL logic programs. In a normal DL logic program arbitrary DL expressions are allowed to appear in rule bodies and atomic DL expressions (i.e., atomic concepts and atomic roles) allowed in rule heads. We extend the key condition of well-supportedness for normal logic programs under the standard answer set semantics to normal DL logic programs and de fine an answer set semantics for DL logic programs which satis es the extended well-supportedness condition. We show that the answer set semantics for normal DL logic programs is decidable if the underlying description logic is decidable (e.g. SHOIN or SROIQ).
|
| 关 键 词: |
描述逻辑; 语义Web; 原子DL表达式
|
| 课程来源: |
视频讲座网
|
| 最后编审: |
2019-05-05：lxf
|
| 阅读次数: |
25
|
|
图 书 馆