{"title":"sign - sat新的逻辑和复杂性结果","authors":"C. Ansótegui, F. Manyà","doi":"10.1109/ISMVL.2003.1201404","DOIUrl":null,"url":null,"abstract":"We define Mv-formulas as the union of the subclasses of signed CNF formulas known as regular and monosigned CNF formulas, and then define resolution calculi that are refutation complete for Mv-formulas and give new complexity results for the Horn-SAT and 2-SAT problems. Our goal is to use Mv-formulas as a constraint programming language between CSP and SAT, and solve computationally difficult combinatorial problems with efficient satisfiability solvers for Mv-formulas. The results presented in this paper provide evidence that Mv-formulas are a problem modeling language that offers a good compromise between complexity and expressive power.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"New logical and complexity results for Signed-SAT\",\"authors\":\"C. Ansótegui, F. Manyà\",\"doi\":\"10.1109/ISMVL.2003.1201404\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We define Mv-formulas as the union of the subclasses of signed CNF formulas known as regular and monosigned CNF formulas, and then define resolution calculi that are refutation complete for Mv-formulas and give new complexity results for the Horn-SAT and 2-SAT problems. Our goal is to use Mv-formulas as a constraint programming language between CSP and SAT, and solve computationally difficult combinatorial problems with efficient satisfiability solvers for Mv-formulas. The results presented in this paper provide evidence that Mv-formulas are a problem modeling language that offers a good compromise between complexity and expressive power.\",\"PeriodicalId\":434515,\"journal\":{\"name\":\"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2003.1201404\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2003.1201404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We define Mv-formulas as the union of the subclasses of signed CNF formulas known as regular and monosigned CNF formulas, and then define resolution calculi that are refutation complete for Mv-formulas and give new complexity results for the Horn-SAT and 2-SAT problems. Our goal is to use Mv-formulas as a constraint programming language between CSP and SAT, and solve computationally difficult combinatorial problems with efficient satisfiability solvers for Mv-formulas. The results presented in this paper provide evidence that Mv-formulas are a problem modeling language that offers a good compromise between complexity and expressive power.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
