4,218 research outputs found

    Study of Ck-saturated graphs

    No full text
    碩士令Ck代表含有k個點的迴圈。假設G為一個圖且G中不包含子圖Ck,若連接圖G中任意不相鄰的兩點後,所形成的圖就會包含子圖Ck,那我們就稱圖G為Ck飽和圖。 在本論文中,我們對於n點Ck飽和圖提出4種建構法,分別利用完全圖Kk-1之建構法、完全圖Kk/2+1或完全圖K(k+1)/2之建構法、迴圈Ck+1與完全圖Kk-4之建構法及擬似輪圖W(n, k) 之建構法得到n點Ck飽和圖,進而比較所獲得之四種n點Ck飽和圖的邊數。Let Ck be a cycle with k edges. Let G be a graph. If there is no k-cycle contained in G and connecting any non-adjacent vertices of G will obtain a k-cycle, then we call G is a Ck saturated graph. In this thesis, we give four constructions to construct a Ck saturated graph with n vertices. Respectively, we use the complete graph Kk-1, complete graphs Kk/2+1and K(k+1)/2, a (k+1)-cycle Ck+1 and a complete graph Kk-4, and a Wheel graph W(n, k) to construct a Ck saturated graph with n vertices. After that we enumerate the edges in each Ck saturated graph with n vertices and compare the numbers of edges of these four Ck saturated graphs with n vertices.目 錄 誌謝辭.......................ⅱ 中文摘要......................ⅲ 英文摘要...................... Ⅳ 目 錄....................Ⅵ 圖表目 錄....................Ⅷ 第一章 簡介…………………………………………………………… 1 第二章 預備知識……………………………………………………… 4 第三章 Ck飽和圖及建構法…………………………………………... 10 3-1 第一類建構法………………………………………………... 12 3-2 第二類建構法………………………………………………... 16 3-3 第三類建構法………………………………………………... 19 3-4 第四類建構法………………………………………………... 21 第四章 總結…………………………………………………………… 34 參考書目………………………………………………………………… 36 圖表目錄 表1-1………………………………………………………………………2 圖2.1…………………………………………………………….4、5、6、8 圖2.2……………………………………………………………………… 5 圖2.3……………………………………………………………………….6 圖2.4 K4完全圖………………………………………………………..7、8 圖2.5………………………………………………………………………..8 圖2.6………………………………………………………………………..9 圖2.7………………………………………………………………………..9 圖2.8 4點C4飽和圖…..…………………………………………………...9 圖3.1………………………………………………………………………10 圖3.2………………………………………………………………………10 圖3.3………………………………………………………………………11 圖3.4………………………………………………………………………11 圖3.5………………………………………………………………………11 圖3.6………………………………………………………………………12 圖3.7………………………………………………………………………13 圖3.8………………………………………………………………………14 圖3.9………………………………………………………………………15 圖3.10……………………………………………………………………..15 圖3.11……………………………………………………………………..17 圖3.12……………………………………………………………………..17 圖3.13……………………………………………………………………..20 圖3.14……………………………………………………………………..21 圖3.15……………………………………………………………………..22 圖3.16……………………………………………………………………..24 圖3.17……………………………………………………………………..25 圖3.18……………………………………………………………………..27 圖3.19……………………………………………………………………..28 圖3.20……………………………………………………………………..29 圖3.21……………………………………………………………………..31 圖3.22……………………………………………………………………..33 表4-1 C10 飽和圖之邊數 ……………………………………………..….34學號: 700190050, 學年度: 10

    Ck-Log, A Calculus for Knowledge Processing in Logic

    No full text
    This paper introduces the principal concepts in the organization and operation of the logic based knowledge processing system, called CK-LOG (A Calculus for Knowledge in Logics). CK-LOG uses the frame based system MDS (the Meta Description System) for knowledge representation and for modeling world states. It uses an inference engine based on Natural Deduction for stating and solving problems. As a knowledge processing system CK-LOG has several capabilities, which are new to the technology of knowledge representation systems: CK-LOG has special facilities to represent and reason about actions and their time dependencies. Actions that occur in a world state may create or destroy objects in the world or modify their properties, or prevent or support other actions. The effects of actions are described in CK-LOG using modal operators like CREATE, DESTROY, PREVENT, SUPPORT, KEEP, etc. These operator expressions are also used to represent and reason about possible worlds that the actions might lead to. Most significantly, CK-LOG is a logic-based knowledge processing system, just as PROLOG is logic based programming system. CK-LOG uses a three valued logical system with truth values T (true),? (Unknown) and F (false) to build partial models of world states, and the two valued logic's system of T and F in its theorem proving System. The use of the three valued logical system in its models of world states enables CK-LOG to do problem solving in the context of incomplete information about world states. The theorem proving system of CK-LOG uses a variant of the calculus of sequents first proposed by Kanger (which itself is a variant of Gentzen's system). The two variations in CK-LOG are, (i). the use of a new algorithm called the mating algorithm for testing proof terminations, and (ii) the use of specialized inference rules for reasoning about modal expressions using the possible world semantics.. The mating algorithm gives the theorem proving system of CK-LOG several new capabilities: to identify information that is pertinent to a given problem and retrieve it from its knowledge base, to update its models of possible worlds during the problem solving process based on the findings of the theorem proving system, to use these models of world states to test proof terminations, and to generate hypotheses during the problem solving process that are based on unknown information. These various features of CK-LOG are described here. The paper concludes with a discussion of the logic of frames as used in CK-LOG and establishes a condition called locality condition as a sufficient condition for creating knowledge representations with requisite completeness.Technical report DCS-TR-15
    corecore