{"title":"将LP(X)中任意公式转化为纯广义合取范式的算法","authors":"D. Meng, Yang Xu, K. Qin","doi":"10.1109/NAFIPS.2002.1018027","DOIUrl":null,"url":null,"abstract":"In the present paper the algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form is focused. Concretely, some important concepts and results about lattice implication algebra (LIA), lattice-valued prepositional logic LP(X) and resolution principle based on LP(X) are introduced firstly. Then algorithm of transforming any implication term to a reducible form is considered. Finally, the method of transforming any formula F in LP(X) to a pure-generalized conjunction normal form is given.","PeriodicalId":348314,"journal":{"name":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form\",\"authors\":\"D. Meng, Yang Xu, K. Qin\",\"doi\":\"10.1109/NAFIPS.2002.1018027\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the present paper the algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form is focused. Concretely, some important concepts and results about lattice implication algebra (LIA), lattice-valued prepositional logic LP(X) and resolution principle based on LP(X) are introduced firstly. Then algorithm of transforming any implication term to a reducible form is considered. Finally, the method of transforming any formula F in LP(X) to a pure-generalized conjunction normal form is given.\",\"PeriodicalId\":348314,\"journal\":{\"name\":\"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAFIPS.2002.1018027\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAFIPS.2002.1018027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form
In the present paper the algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form is focused. Concretely, some important concepts and results about lattice implication algebra (LIA), lattice-valued prepositional logic LP(X) and resolution principle based on LP(X) are introduced firstly. Then algorithm of transforming any implication term to a reducible form is considered. Finally, the method of transforming any formula F in LP(X) to a pure-generalized conjunction normal form is given.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
