Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë
Current Result Document : 5 / 5
ÀÌÀü°Ç
ÇѱÛÁ¦¸ñ(Korean Title) |
±ÕÀÏ µ¿µîÀ» ÀÌ¿ëÇÑ RLF-¼±ÇüÈ °¡´É¼ºÀÇ ÀϹÝÈ |
¿µ¹®Á¦¸ñ(English Title) |
Generalization of RLF-linearizability based on Uniform Equivalence |
ÀúÀÚ(Author) |
°ÁöÈÆ
È«±â¿µ
Ȳ±Ô¿µ
Á¶Á¤¿Ï
Ji-Hoon Kang
Ki-Hyung Hong
Kyu-Young Whang
Jung-Wan Cho
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 25 NO. 10 PP. 1478 ~ 1492 (1998. 10) |
Çѱ۳»¿ë (Korean Abstract) |
ÀÌÁß¼±Çü ÇÁ·Î±×·¥(bilinear program)ÀÇ ¿ì¼±Çü¿ì¼±(RLF) ¼±Çüȸ¦ À§ÇÑ »õ·Î¿î ÃæºÐÁ¶°ÇÀ» Á¦½ÃÇÑ´Ù. Á¦½ÃÇÏ´Â Á¶°ÇÀÇ °Ë»ç´Â ³í¸®°ö ÁúÀÇ Æ÷ÇÔ°ü°è °Ë»ç ¹æ¹ýÀ» ÀÌ¿ëÇÏ¿© Áö¼ö ½Ã°£¿¡ °¡´ÉÇÏ´Ù. ÀϹÝÀûÀÎ ºñ¼±Çü ÇÁ·Î±×·¥ÀÇ ¼±ÇüÈ´Â °áÁ¤ ºÒ°¡´ÉÇÑ ¹®Á¦·Î ¾Ë·ÁÁ® ÀÖÀ¸¸ç, Áö±Ý±îÁöÀÇ ¼±ÇüÈ ¿¬±¸´Â ´ë»óÀÌ µÇ´Â ºñ¼±Çü ÇÁ·Î±×·¥À» Á¦ÇÑÇÏ¿© ÀÌ·ç¾îÁ³´Ù. Àß ¾Ë·ÁÁø ZYT-¼±ÇüÈ´Â ´Ü ÇϳªÀÇ ÀÌÁß¼±Çü±ÔÄ¢¸¸À» °¡Áø ÀÌÁß¼±Çü ÇÁ·Î±×·¥À» ´ë»óÀ¸·Î ÇÑ´Ù. ÀÌ ³í¹®¿¡¼´Â, ±ÕÀϵ¿µî (uniform equivalence) °³³äÀ» ÀÌ¿ëÇÑ ZYT-¼±ÇüÈ¿¡ °üÇÑ ¿¬±¸¸¦ È®ÀåÇÏ¿©, ´Ù¼öÀÇ ÀÌÁß¼±Çü ¹× ¼±Çü±ÔÄ¢À» °¡Áø º¸´Ù ÀϹÝÀûÀÎ ÀÌÁß¼±Çü ÇÁ·Î±×·¥À» ´ë»óÀ¸·Î ÇÏ´Â RLF-¼±Çüȸ¦ À§ÇÑ ÃæºÐÁ¶°ÇÀ» Á¦½ÃÇÑ´Ù. ¶ÇÇÑ, RLF-¼±ÇüÈ¿¡ °üÇÑ ÀÌÀüÀÇ ¿¬±¸¿¡¼ ´Ù·çÁö ¸øÇÏ¿´´ø ´Ù¼öÀÇ ¿Ü¿¬ ¼ºê°ñÀ» °¡Áø ¼øȯ±ÔÄ¢À» Çã¿ëÇÔÀ¸·Î½á, Áö±Ý±îÁöÀÇ ¼±ÇüÈ ¿¬±¸¿¡¼ Á¦¾ÈµÇ¾ú´ø ¾î¶°ÇÑ °Ë»ç °¡´ÉÇÑ Á¶°Ç¿¡ ºñÇÏ¿©µµ ±× ´ë»óÀÌ ³ÐÀº Á¶°ÇÀ» Á¦½ÃÇÏ¿´´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
We present new sufficient conditions for RLF (right-linear-first) linearization, which deals with bilinear datalog programs having multiple bilinear rules and multiple linear rules. The test of the conditions can be done in exponential time, by using an algorithm for checking conjunctive query containment. In general, linearization of general nonlinear programs is known as undecidable. All the previous studies on linearization have been done for some specific classes of nonlinear programs. ZYT-linearization is a well-known linearization for very simple nonlinear programs that consist of only one bilinear rule and one exit rule. The target program class of RLF-linearization is broader than that of ZYT-linearization. In this paper, we generalize a sufficient condition for ZYT-linearization that is developed by using the concept of uniform equivalence. While all the previous conditions developed on RLF-linearization can handle only those recursive rules having zero or one extensional database subgoal, the conditions presented in this paper allows recursive rules with more than one extensional database subgoal. |
Å°¿öµå(Keyword) |
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|