By Topic

An Internet Query Language based on Intuitionistic Linear Logic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Keehang Kwon ; DongA Univ., Busan ; JaeWoo Kim ; Jang-Wu Jo

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.

Published in:

Software Engineering Research, Management & Applications, 2007. SERA 2007. 5th ACIS International Conference on

Date of Conference:

20-22 Aug. 2007