Miquel Bofill, F. Manyà, Amanda Vidal, Mateu Villaret
{"title":"在Lukasiewicz逻辑中寻找可满足性的硬实例","authors":"Miquel Bofill, F. Manyà, Amanda Vidal, Mateu Villaret","doi":"10.1109/ISMVL.2015.10","DOIUrl":null,"url":null,"abstract":"One aspect that has been poorly studied in multiple-valued logics, and in particular in Lukasiewicz logics, is the generation of instances of varying difficulty for evaluating, comparing and improving satisfiability solvers. In this paper we present a new class of clausal forms, called Lukasiewicz (L-)clausal forms, motivate their usefulness, study their complexity, and report on an empirical investigation that shows an easy-hard-easy pattern and a phase transition phenomenon when testing the satisfiability of L-clausal forms.","PeriodicalId":118417,"journal":{"name":"2015 IEEE International Symposium on Multiple-Valued Logic","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Finding Hard Instances of Satisfiability in Lukasiewicz Logics\",\"authors\":\"Miquel Bofill, F. Manyà, Amanda Vidal, Mateu Villaret\",\"doi\":\"10.1109/ISMVL.2015.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One aspect that has been poorly studied in multiple-valued logics, and in particular in Lukasiewicz logics, is the generation of instances of varying difficulty for evaluating, comparing and improving satisfiability solvers. In this paper we present a new class of clausal forms, called Lukasiewicz (L-)clausal forms, motivate their usefulness, study their complexity, and report on an empirical investigation that shows an easy-hard-easy pattern and a phase transition phenomenon when testing the satisfiability of L-clausal forms.\",\"PeriodicalId\":118417,\"journal\":{\"name\":\"2015 IEEE International Symposium on Multiple-Valued Logic\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2015.10\",\"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 International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2015.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finding Hard Instances of Satisfiability in Lukasiewicz Logics
One aspect that has been poorly studied in multiple-valued logics, and in particular in Lukasiewicz logics, is the generation of instances of varying difficulty for evaluating, comparing and improving satisfiability solvers. In this paper we present a new class of clausal forms, called Lukasiewicz (L-)clausal forms, motivate their usefulness, study their complexity, and report on an empirical investigation that shows an easy-hard-easy pattern and a phase transition phenomenon when testing the satisfiability of L-clausal forms.