Read the summary and the most important questions on Knowledge representation & reasoning Les 4, Part 1

• 1 Knowledge representation & reasoning

• 1.1.1.1 Rule-based systems

• What are rule-based systems

  • Naturally occurring chunks of knowledge, relationships
    
  • Simple and structured

• 1.1.1.2 Structured objects

• What are structured objects

  • Model based
    
  • Inheritance, defaults, exceptions, frames

• 1.1.1.3 Logic-based systems

• What are logic-based systems

  • Deduction and meta-rules
    
  • Declarative clauses
  • Propositional logic: statements that are true or false
  • Predicate logic: extension to propositional logic 

• 1.2 Applied knowledge representation formalisms

• What are the three applied knowledge representation formalisms

  • Semantic network
    
  • Frame based systems
  • Fuzzy sets and reasoning

• 1.2.2 Frame based systems

  This is a preview. There are 5 more flashcards available for chapter 1.2.2
  Show more cards here

• Two forms of logical notations

  • Propositional logic
    
  • Predicate logic

• What is propositional logic

  Propositions are statements that are either true or false. Propositions are linked together with connective such as AND, OR, NOT, IMPLIES and EQUIVALENT to form compound statements

• 1.3 Inference and reasoning

  This is a preview. There are 8 more flashcards available for chapter 1.3
  Show more cards here

• What is searching the goal state space

  • State space exploration
    
  • Two basic search techniques

• What is state space exploration

  Many search problems can be explored using states and transitions.
  State: where are in the search
  Transitions: ways to go to the next state

• Three ways to repeat until all nodes in the search space have been examined

  • Hill climbing algorithm
    
  • Best first search algorithm
  • Branch and bound search

• What is the best first search algorithm

  • Check the head of the list of nodes under consideration. If it is the goal state report the success and stop, otherwise continue.
    
  • Replace the node at the head of the list with its children
  • Sort the entire list