Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Specialisation and Generalisation Rules

  • A hypothesis G is more general than a hypothesis S if and only if G ⊧ S
    • S is also said to be more specific than G.
  • In search algorithms, the notions of generalisation and specialisation are incorporated using inductive and deductive inference rules:
    • A deductive inference rule r maps a conjunction of clauses G onto a conjunction of clauses S such that G ⊧ S
        r is called a specialisation rule
    • An inductive inference rule r maps a conjunction of clauses S onto a conjunction of clauses G such that G ⊧ S
        r is called a generalisation rule

Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.