β - psml混合推理算法的正确性证明与复杂性分析

Yila Su
{"title":"β - psml混合推理算法的正确性证明与复杂性分析","authors":"Yila Su","doi":"10.1109/ICCTD.2009.97","DOIUrl":null,"url":null,"abstract":"We have studied the theoretical problems of logic of β-PSML (Problem Solver Markup Language) constructed by combining description logic and Horn clauses. In the nonrecursive case, we show that a single step of applying a Horn clause needs to be replaced by a more sophisticated reasoning step in β-PSML. We call it as the hybrid reasoning algorithm. We described the hybrid reasoning algorithm in former paper. In this paper, we will prove the correctness of the hybrid reasoning algorithm. Hybrid reasoning algorithm provides a sound and complete inference procedure for nonrecursive β-PSML knowledge bases in which the description logic component is decidable.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Correctness Proof and Complexity Analysis of the Hybrid Reasoning Algorithm of Beta-PSML\",\"authors\":\"Yila Su\",\"doi\":\"10.1109/ICCTD.2009.97\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have studied the theoretical problems of logic of β-PSML (Problem Solver Markup Language) constructed by combining description logic and Horn clauses. In the nonrecursive case, we show that a single step of applying a Horn clause needs to be replaced by a more sophisticated reasoning step in β-PSML. We call it as the hybrid reasoning algorithm. We described the hybrid reasoning algorithm in former paper. In this paper, we will prove the correctness of the hybrid reasoning algorithm. Hybrid reasoning algorithm provides a sound and complete inference procedure for nonrecursive β-PSML knowledge bases in which the description logic component is decidable.\",\"PeriodicalId\":269403,\"journal\":{\"name\":\"2009 International Conference on Computer Technology and Development\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Computer Technology and Development\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCTD.2009.97\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Computer Technology and Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTD.2009.97","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了描述逻辑和Horn子句相结合构建的β-PSML (Problem Solver Markup Language)的逻辑理论问题。在非递归情况下,我们证明了在β-PSML中应用Horn子句的单个步骤需要被更复杂的推理步骤所取代。我们称之为混合推理算法。我们在前一篇文章中描述了混合推理算法。在本文中,我们将证明混合推理算法的正确性。混合推理算法为描述逻辑成分可确定的非递归β-PSML知识库提供了完善的推理过程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Correctness Proof and Complexity Analysis of the Hybrid Reasoning Algorithm of Beta-PSML
We have studied the theoretical problems of logic of β-PSML (Problem Solver Markup Language) constructed by combining description logic and Horn clauses. In the nonrecursive case, we show that a single step of applying a Horn clause needs to be replaced by a more sophisticated reasoning step in β-PSML. We call it as the hybrid reasoning algorithm. We described the hybrid reasoning algorithm in former paper. In this paper, we will prove the correctness of the hybrid reasoning algorithm. Hybrid reasoning algorithm provides a sound and complete inference procedure for nonrecursive β-PSML knowledge bases in which the description logic component is decidable.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信