知道如何做有多容易可满足性问题的上限

{"title":"知道如何做有多容易可满足性问题的上限","authors":"C. Areces, Valentin Cassano, Pablo F. Castro, Raul Fervari, Andrés R. Saravia","doi":"10.1007/978-3-031-43619-2_28","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":225087,"journal":{"name":"European Conference on Logics in Artificial Intelligence","volume":"27 1","pages":"405-419"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"How Easy it is to Know How: An Upper Bound for the Satisfiability Problem\",\"authors\":\"C. Areces, Valentin Cassano, Pablo F. Castro, Raul Fervari, Andrés R. Saravia\",\"doi\":\"10.1007/978-3-031-43619-2_28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":225087,\"journal\":{\"name\":\"European Conference on Logics in Artificial Intelligence\",\"volume\":\"27 1\",\"pages\":\"405-419\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Conference on Logics in Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-031-43619-2_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":"European Conference on Logics in Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-031-43619-2_28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}