算法μ-微积分的最优可满足性检验

{"title":"算法μ-微积分的最优可满足性检验","authors":"D. Hausmann, Lutz Schröder","doi":"10.1007/978-3-030-17127-8_16","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Optimal Satisfiability Checking for Arithmetic μ-Calculi\",\"authors\":\"D. Hausmann, Lutz Schröder\",\"doi\":\"10.1007/978-3-030-17127-8_16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":330721,\"journal\":{\"name\":\"Foundations of Software Science and Computation Structure\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Foundations of Software Science and Computation Structure\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-17127-8_16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of Software Science and Computation Structure","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-17127-8_16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}