loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007)
An Internet Query Language based on Intuitionistic Linear Logic
Haeundae Grand Hotel, Busan, South Korea
August 20-August 22
ISBN: 0-7695-2867-8
Keehang Kwon, DongA University, Korea
JaeWoo Kim, DongA University, Korea
Jang-Wu Jo, DongA University, Korea
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 - \circ G and G_1&G_2 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 G_1 and G_2 from the current text. This goal is particularly useful for internet search.
Index Terms:
theory of computation, internet, information retrieval, linear logic.
Citation:
Keehang Kwon, JaeWoo Kim, Jang-Wu Jo, "An Internet Query Language based on Intuitionistic Linear Logic," sera, pp.98-100, 5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.