{"title":"基于直觉线性逻辑的Internet查询语言","authors":"Keehang Kwon, Jaewoo Kim, Jang-Wu Jo","doi":"10.1109/SERA.2007.50","DOIUrl":null,"url":null,"abstract":"We propose an Internet query language based on intuitionistic linear logic. This language extends regular expressions with linear implications and additive (classical) conjunctions. To be precise, it allows goals of the form D -o G and G1&G2 where D is a text and G is a goal. The first goal is intended to be solved by adding D to the current text and then solving G. This goal is flexible in controlling the current text dynamically. The second goal is intended to be solved by solving both G1 and G2 from the current text. This goal is particularly useful for internet search.","PeriodicalId":181543,"journal":{"name":"5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Internet Query Language based on Intuitionistic Linear Logic\",\"authors\":\"Keehang Kwon, Jaewoo Kim, Jang-Wu Jo\",\"doi\":\"10.1109/SERA.2007.50\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an Internet query language based on intuitionistic linear logic. This language extends regular expressions with linear implications and additive (classical) conjunctions. To be precise, it allows goals of the form D -o G and G1&G2 where D is a text and G is a goal. The first goal is intended to be solved by adding D to the current text and then solving G. This goal is flexible in controlling the current text dynamically. The second goal is intended to be solved by solving both G1 and G2 from the current text. This goal is particularly useful for internet search.\",\"PeriodicalId\":181543,\"journal\":{\"name\":\"5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007)\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SERA.2007.50\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SERA.2007.50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Internet Query Language based on Intuitionistic Linear Logic
We propose an Internet query language based on intuitionistic linear logic. This language extends regular expressions with linear implications and additive (classical) conjunctions. To be precise, it allows goals of the form D -o G and G1&G2 where D is a text and G is a goal. The first goal is intended to be solved by adding D to the current text and then solving G. This goal is flexible in controlling the current text dynamically. The second goal is intended to be solved by solving both G1 and G2 from the current text. This goal is particularly useful for internet search.