基于无同义分解路径的强(D)QBF依赖方案

{"title":"基于无同义分解路径的强(D)QBF依赖方案","authors":"Olaf Beyersdorff, Joshua Blinkhorn, Tomáš Peitl","doi":"10.1007/978-3-030-51825-7_28","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"362 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths\",\"authors\":\"Olaf Beyersdorff, Joshua Blinkhorn, Tomáš Peitl\",\"doi\":\"10.1007/978-3-030-51825-7_28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":424049,\"journal\":{\"name\":\"Theory and Applications of Satisfiability Testing – SAT 2020\",\"volume\":\"362 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theory and Applications of Satisfiability Testing – SAT 2020\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-51825-7_28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theory and Applications of Satisfiability Testing – SAT 2020","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-51825-7_28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}