Knowledge Representation I - Computer Science and 我-计算机科学和知识表示.pptVIP

Knowledge Representation I Knowledge Representation II Knowledge Representation III What do we need to do? What language should we use? A logic language consists of semantics and syntax Propositional Logic: Syntax I Propositional Logic: Syntax II Sample Sentences * Suppose I tell you the following... The Duck-Bill Platypus and the Echidna are the only two mammals that lay eggs. Only birds and mammals are warm blooded. “Susan”, my pet Armadillo is warm blooded, and has no feathers. All birds have feathers. …and I ask you, does “Susan” lay eggs? We would like to build a system, that we could TELL a set of facts. This system we call a Knowledge Base (KB). At some point in the future we would like to be able to ASK the Knowledge Base questions, and receive correct answers. For simplicity we assume that the knowledge is represented as, and the questions are phrased as, true or false questions. For example we can’t ask “what class is susan?” instead we can ask “susan a amphibian?” “susan a bird?” etc More concretely, if we collect all out facts into a knowledge base KB, and we later want to know if a fact P is true. We will try to show that given the facts in our database, P must be true. We write this as KB |- P Read as KB entails P We need to create a language to represent knowledge in our KB. This language should be Expressive. Unambiguous. “I saw her duck” Context independent. Compositional. We need an algorithm to answer the questions we might ASK. The algorithm should be Sound (only true facts are derived). Complete (all true facts can be derived) Efficient (we call ask a question and get an answer in reasonable time) Natural language, ie English, Cantonese. Too ambiguous. Programming Language, ie C++ Lisp. Not very expressive. We will use logic! Actually there are many different logics. We will start by considering Propositional Logic. We will find that has some drawbacks so we will consider the more general Predicate Log