Skip Navigation

IEICE Transactions on Information and Systems 2008 E91-D(1):145-147; doi:10.1093/ietisy/e91-d.1.145
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by KWON, K.
Right arrow Articles by KIM, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2008 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Letters -- Automata and Formal Language Theory

A Query System for Texts with Macros

Keehang KWON1, Dae-Seong KANG2 and Jinsoo KIM3

1 The author is with the Department of Computer Engineering, DongA University, Busan, 607–714, Korea. E-mail: khkwon{at}dau.ac.kr, 2 The author is with the Department of Electronics Engineering, DongA University, Busan, 607–714, Korea., 3 The author is with the Department of Computer Science, Konkuk University, Korea.

We propose a query language based on extended regular expressions. This language extends texts with text-generating macros. These macros make it possible to define languages in a compressed, elegant way. This paper also extends queries with linear implications and additive (classical) conjunctions. To be precise, it allows goals of the form D {multimap} G and G1 & G2 where D is a text or a macro and G is a query. The first goal is 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 solved by solving both G1 and G2 from the current text. This goal is particularly useful for internet search.

Key Words: text search, internet, information retrieval, linear logic

Manuscript received July 4, 2007.

Reference

[1] S.C. Kleene, Introduction to Metamathematics, North-Holland, Amsterdam, 1964.

[2] J. Davies, D. Fensel, and F.V. Harmelen, Towards the Semantics Web, John Wiley and Sons, 2003.

[3] J.Y. Girard, "Linear logic," Theor. Comput. Sci., vol.50, pp.1–102, 1987.

[4] J. Hodas and D. Miller, "Logic programming in a fragment of intuitionistic linear logic," J. Inf. Comput., vol.110, no.2, pp.327–365, 1994. Invited to a special issue of submission to the 1991 LICS conference.

[5] A. Martelli and U. Montanari, "An efficient unification algorithm," ACM Trans. Program. Lang. Syst., vol.4, no.2, pp.258–282, April 1982.

[6] I. Cervesato, J.S. Hodas, and F. Pfenning, "Efficient resource management for linear logic proof search," Proc. 1996 Workshop on Extensions of Logic Programming, LNAI 1050, pp.67–81, 1996.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by KWON, K.
Right arrow Articles by KIM, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?