{"title":"更具表现力的TQL扩展","authors":"W. Khalil","doi":"10.1145/1456223.1456347","DOIUrl":null,"url":null,"abstract":"The TQL logic (Tree Query Language) proposed by Cardelli and Ghelli [1] is a logical declarative language, allowing to express properties on the semistructured documents. By using TQL logic we can characterize certain languages of trees such as for example the regular languages with unboundarity. In this work, our objective is to enrich this logic in order to be able to express properties of the context-free tree languages, synchronized regular tree languages and synchronized context-free tree languages.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"326 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"More expressive extensions of TQL\",\"authors\":\"W. Khalil\",\"doi\":\"10.1145/1456223.1456347\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The TQL logic (Tree Query Language) proposed by Cardelli and Ghelli [1] is a logical declarative language, allowing to express properties on the semistructured documents. By using TQL logic we can characterize certain languages of trees such as for example the regular languages with unboundarity. In this work, our objective is to enrich this logic in order to be able to express properties of the context-free tree languages, synchronized regular tree languages and synchronized context-free tree languages.\",\"PeriodicalId\":309453,\"journal\":{\"name\":\"International Conference on Soft Computing as Transdisciplinary Science and Technology\",\"volume\":\"326 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Soft Computing as Transdisciplinary Science and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1456223.1456347\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Soft Computing as Transdisciplinary Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1456223.1456347","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The TQL logic (Tree Query Language) proposed by Cardelli and Ghelli [1] is a logical declarative language, allowing to express properties on the semistructured documents. By using TQL logic we can characterize certain languages of trees such as for example the regular languages with unboundarity. In this work, our objective is to enrich this logic in order to be able to express properties of the context-free tree languages, synchronized regular tree languages and synchronized context-free tree languages.