{"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}
引用次数: 0
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.