{"title":"树上的双向一元时间逻辑","authors":"M. Bojanczyk","doi":"10.2168/LMCS-5(3:5)2009","DOIUrl":null,"url":null,"abstract":"We consider a temporal logic EF + F-1 for unranked, unordered finite trees. The logic has two operators: EFphi , which says \"in some proper descendant phi holds\", and F-1phi , which says \"in some proper ancestor phi holds\". We present an algorithm for deciding if a regular language of unranked finite trees can be expressed in EF + F-1. The algorithm uses a characterization expressed in terms of forest algebras.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"342 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Two-way unary temporal logic over trees\",\"authors\":\"M. Bojanczyk\",\"doi\":\"10.2168/LMCS-5(3:5)2009\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a temporal logic EF + F-1 for unranked, unordered finite trees. The logic has two operators: EFphi , which says \\\"in some proper descendant phi holds\\\", and F-1phi , which says \\\"in some proper ancestor phi holds\\\". We present an algorithm for deciding if a regular language of unranked finite trees can be expressed in EF + F-1. The algorithm uses a characterization expressed in terms of forest algebras.\",\"PeriodicalId\":137827,\"journal\":{\"name\":\"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)\",\"volume\":\"342 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2168/LMCS-5(3:5)2009\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2168/LMCS-5(3:5)2009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We consider a temporal logic EF + F-1 for unranked, unordered finite trees. The logic has two operators: EFphi , which says "in some proper descendant phi holds", and F-1phi , which says "in some proper ancestor phi holds". We present an algorithm for deciding if a regular language of unranked finite trees can be expressed in EF + F-1. The algorithm uses a characterization expressed in terms of forest algebras.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
