{"title":"线性时序逻辑中本体中介查询fo -可重写性的决定","authors":"V. Ryzhikov, Yury Savateev, M. Zakharyaschev","doi":"10.4230/LIPIcs.TIME.2021.10","DOIUrl":null,"url":null,"abstract":"11 Our concern is the problem of determining the data complexity of answering an ontology-mediated 12 query (OMQ) given in linear temporal logic LTL over ( Z , < ) and deciding whether it is rewritable to an 13 FO ( < )-query, possibly with extra predicates. First, we observe that, in line with the circuit complexity 14 and FO-definability of regular languages, OMQ answering in AC 0 , ACC 0 and NC 1 coincides 15 with FO ( <, ≡ )-rewritability using unary predicates x ≡ 0 (mod n ), FO ( <, MOD )-rewritability, and 16 FO ( RPR )-rewritability using relational primitive recursion, respectively. We then show that deciding 17 FO ( < )-, FO ( <, ≡ )- and FO ( <, MOD )-rewritability of LTL OMQs is ExpSpace -complete, and that 18 these problems become PSpace -complete for OMQs with a linear Horn ontology and an atomic 19 query, and also a positive query in the cases of FO ( < )- and FO ( <, ≡ )-rewritability. Further, we 20 consider FO ( < )-rewritability of OMQs with a binary-clause ontology and identify OMQ classes, for 21 which deciding it is PSpace -, Π p 2 - and coNP -complete. 22","PeriodicalId":75226,"journal":{"name":"Time","volume":"49 1","pages":"10:1-10:15"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic\",\"authors\":\"V. Ryzhikov, Yury Savateev, M. Zakharyaschev\",\"doi\":\"10.4230/LIPIcs.TIME.2021.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"11 Our concern is the problem of determining the data complexity of answering an ontology-mediated 12 query (OMQ) given in linear temporal logic LTL over ( Z , < ) and deciding whether it is rewritable to an 13 FO ( < )-query, possibly with extra predicates. First, we observe that, in line with the circuit complexity 14 and FO-definability of regular languages, OMQ answering in AC 0 , ACC 0 and NC 1 coincides 15 with FO ( <, ≡ )-rewritability using unary predicates x ≡ 0 (mod n ), FO ( <, MOD )-rewritability, and 16 FO ( RPR )-rewritability using relational primitive recursion, respectively. We then show that deciding 17 FO ( < )-, FO ( <, ≡ )- and FO ( <, MOD )-rewritability of LTL OMQs is ExpSpace -complete, and that 18 these problems become PSpace -complete for OMQs with a linear Horn ontology and an atomic 19 query, and also a positive query in the cases of FO ( < )- and FO ( <, ≡ )-rewritability. Further, we 20 consider FO ( < )-rewritability of OMQs with a binary-clause ontology and identify OMQ classes, for 21 which deciding it is PSpace -, Π p 2 - and coNP -complete. 22\",\"PeriodicalId\":75226,\"journal\":{\"name\":\"Time\",\"volume\":\"49 1\",\"pages\":\"10:1-10:15\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Time\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.TIME.2021.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":"Time","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.TIME.2021.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic
11 Our concern is the problem of determining the data complexity of answering an ontology-mediated 12 query (OMQ) given in linear temporal logic LTL over ( Z , < ) and deciding whether it is rewritable to an 13 FO ( < )-query, possibly with extra predicates. First, we observe that, in line with the circuit complexity 14 and FO-definability of regular languages, OMQ answering in AC 0 , ACC 0 and NC 1 coincides 15 with FO ( <, ≡ )-rewritability using unary predicates x ≡ 0 (mod n ), FO ( <, MOD )-rewritability, and 16 FO ( RPR )-rewritability using relational primitive recursion, respectively. We then show that deciding 17 FO ( < )-, FO ( <, ≡ )- and FO ( <, MOD )-rewritability of LTL OMQs is ExpSpace -complete, and that 18 these problems become PSpace -complete for OMQs with a linear Horn ontology and an atomic 19 query, and also a positive query in the cases of FO ( < )- and FO ( <, ≡ )-rewritability. Further, we 20 consider FO ( < )-rewritability of OMQs with a binary-clause ontology and identify OMQ classes, for 21 which deciding it is PSpace -, Π p 2 - and coNP -complete. 22