{"title":"本体中介查询的数据复杂性检验:非统一csp和Polyanna的案例研究","authors":"Olga Gerasimova, S. Kikot, M. Zakharyaschev","doi":"10.1007/978-3-030-22102-7_15","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":270692,"journal":{"name":"Description Logic, Theory Combination, and All That","volume":"191 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Checking the Data Complexity of Ontology-Mediated Queries: A Case Study with Non-uniform CSPs and Polyanna\",\"authors\":\"Olga Gerasimova, S. Kikot, M. Zakharyaschev\",\"doi\":\"10.1007/978-3-030-22102-7_15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":270692,\"journal\":{\"name\":\"Description Logic, Theory Combination, and All That\",\"volume\":\"191 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Description Logic, Theory Combination, and All That\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-22102-7_15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Description Logic, Theory Combination, and All That","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-22102-7_15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}