{"title":"基于串联的两项统一问题的计算复杂度","authors":"N. K. Kosovskii","doi":"10.1109/INTELCIS.2015.7397196","DOIUrl":null,"url":null,"abstract":"Tools for description of bounds for word variable values are offered. The use of these descriptions provides the conditions of a problem belonging to the class P or to the class NP. NP-completeness of an unification problem is proved. The validity of the proved bounds may make possible to create effective algorithms for unification of word terms, used in such programming language as Refal.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computational complexity for some problems of two terms unification based on concatenation\",\"authors\":\"N. K. Kosovskii\",\"doi\":\"10.1109/INTELCIS.2015.7397196\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Tools for description of bounds for word variable values are offered. The use of these descriptions provides the conditions of a problem belonging to the class P or to the class NP. NP-completeness of an unification problem is proved. The validity of the proved bounds may make possible to create effective algorithms for unification of word terms, used in such programming language as Refal.\",\"PeriodicalId\":6478,\"journal\":{\"name\":\"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INTELCIS.2015.7397196\",\"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 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTELCIS.2015.7397196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computational complexity for some problems of two terms unification based on concatenation
Tools for description of bounds for word variable values are offered. The use of these descriptions provides the conditions of a problem belonging to the class P or to the class NP. NP-completeness of an unification problem is proved. The validity of the proved bounds may make possible to create effective algorithms for unification of word terms, used in such programming language as Refal.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
