´Ü¾î | Quantified ºÒÀÇ °ø½Ä ¹®Á¦ |
---|---|
QBF | |
¼³¸í | °è»ê º¹Àâµµ À̷п¡¼ Quantified Boolean formula problem(QBF)´Â ºÒÀÇ ¸¸Á· ¹®Á¦(Boolean satisfiability problem)ÀÇ ÀϹÝÈµÈ ¹®Á¦ÀÌ´Ù. ÀÌ µÎ °¡Áö ¹®Á¦ ¸ðµÎ °¢ º¯¼ö¿¡ Á¸Àç ±âÈ£(existential qualifier)¿Í, ÀüĪ ±âÈ£(universal qualifier)°¡ Àû¿ëµÉ ¼ö ÀÖ´Ù. ºÒÀÇ º¯¼öÀÇ ÁýÇÕ¿¡ ´ëÇÑ 1Â÷ ³í¸®(first-order logic) ÇüÅ°¡ ÂüÀÎÁö °ÅÁþÀÎÁö ¿©ºÎ¿¡ ´ëÇÏ¿© ¹°À» ¼ö ÀÖ´Ù. |
Copyright(c) Computer Science Engineering Research Information Center. All rights reserved.