格值一阶逻辑系统中格值角广义子句的α -分解方法

2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE) Pub Date : 2015-11-01 DOI:10.1109/ISKE.2015.75

Weitao Xu, Wenqiang Zhang, Dexian Zhang, Yang Xu

{"title":"格值一阶逻辑系统中格值角广义子句的α -分解方法","authors":"Weitao Xu, Wenqiang Zhang, Dexian Zhang, Yang Xu","doi":"10.1109/ISKE.2015.75","DOIUrl":null,"url":null,"abstract":"This paper presents an α-resolution method for lattice-valued Horn generalized clauses in lattice-valued first-order logic system LF(X) based on lattice implication algebra. In LF(X), we give the concepts of lattice-valued Horn generalized clause and normal lattice-valued Horn generalized clause. The α-resolvent of two lattice-valued Horn generalized clauses is also represented in LF(X). By using a substitution in each resolution process, we delete α-resolution literals and obtain their resolvent. At the same time, completeness theorems are also established. The present method can provide an efficient tool for automated reasoning in lattice-valued first-order logic system.","PeriodicalId":312629,"journal":{"name":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"alpha-Resolution Method for Lattice-Valued Horn Generalized Clauses in Lattice-Valued First-Order Logic System\",\"authors\":\"Weitao Xu, Wenqiang Zhang, Dexian Zhang, Yang Xu\",\"doi\":\"10.1109/ISKE.2015.75\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an α-resolution method for lattice-valued Horn generalized clauses in lattice-valued first-order logic system LF(X) based on lattice implication algebra. In LF(X), we give the concepts of lattice-valued Horn generalized clause and normal lattice-valued Horn generalized clause. The α-resolvent of two lattice-valued Horn generalized clauses is also represented in LF(X). By using a substitution in each resolution process, we delete α-resolution literals and obtain their resolvent. At the same time, completeness theorems are also established. The present method can provide an efficient tool for automated reasoning in lattice-valued first-order logic system.\",\"PeriodicalId\":312629,\"journal\":{\"name\":\"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISKE.2015.75\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE.2015.75","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了一种基于格蕴涵代数的格值一阶逻辑系统LF(X)中格值Horn广义子句的α-分解方法。在LF(X)中，我们给出了格值Horn广义子句和正规格值Horn广义子句的概念。两个格值Horn广义子句的α-解也在LF(X)中表示。通过对每个解析过程进行替换，我们删除了α-解析字面值，得到了它们的解析值。同时，还建立了完备性定理。该方法为格值一阶逻辑系统的自动推理提供了一种有效的工具。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

alpha-Resolution Method for Lattice-Valued Horn Generalized Clauses in Lattice-Valued First-Order Logic System

This paper presents an α-resolution method for lattice-valued Horn generalized clauses in lattice-valued first-order logic system LF(X) based on lattice implication algebra. In LF(X), we give the concepts of lattice-valued Horn generalized clause and normal lattice-valued Horn generalized clause. The α-resolvent of two lattice-valued Horn generalized clauses is also represented in LF(X). By using a substitution in each resolution process, we delete α-resolution literals and obtain their resolvent. At the same time, completeness theorems are also established. The present method can provide an efficient tool for automated reasoning in lattice-valued first-order logic system.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)

自引率

0.00%

发文量