知识推论法.ppt

4. 知識推論法 S.S. Tseng G.J. Hwang Chapter 4 Methods of Inference 知識推論法 4.1 Deductive and Induction （演繹與歸納） Deduction(演繹): Logical reasoning in which conclusions must follow from their premises. Induction(歸納): Inference from the specific case to the general. Intuition(直觀): No proven theory. Heuristics(啟發): Rules of thumb (觀測法) based upon experience. Generate and test: Trial and error. Abduction(反推): Reasoning back from a true conclusion to the premises that may have caused the conclusion. Autoepitemic(自覺、本能): Self-knowledge Nonmonotonic(應變知識): previous knowledge may be incorrect when new evidence is obtained Analogy(類推): based on the similarities to another situation Syllogism （三段論） Syllogism（三段論）is simple, well-understood branch of logic that can be completely proven. Premise(前提): Anyone who can program is intelligent Premise(前提): John can program Conclusion(結論): Therefore, John is intelligent. In general, a syllogism is any valid deductive argument having two premises and a conclusion. Categorical Syllogism(定言三段論) 三段論的標準形態（Standard form） 大前提：所有M為P 小前提：所有S為M 結論：所有S為P Mood(模式) Patterns of Categorical Statement 4種AAA模式 ex: AAA-1 所有M為P 所有S為M ∴所有S為P We use decision procedure(決策程序) to prove the validity of syllogistic argument The decision procedure for syllogisms can be done using Venn Diagrams(維思圖) ex: Decision procedure for Syllogism AEE-1 所有M為P 沒有S為M ∴沒有S為P General Rule under “some” quantifiers 1. If a class is empty, it is shaded. 2. Universal statement, A and E, are always drawn before particular ones. 3. If a class has at least one member, mark it with a *. 4. If a statement does not specify in which of two adjacent classed an object exists, place a * on the line between the classes. 5. If an area has been shaded, no * can be put in it. ex: Decision procedure for Syllogism IAI-1 某些P為M 所有M為S ∴某些S為P 4.2 State and problem spaces(狀態與問題空間) Tree（樹狀結構）: nodes, edges Directed or undirected Digraph（雙向圖）: a graph with directed edges Lattice（晶格）: a direct