Sllp Lesson Plan

3
1 2 3 4 1 Prolog applicati ons Facts & questions Variables & conjunctions Rules 2 Prolog syntax Characters Operators Equality & matching 3 Arithmeti c Satisfying goals Trees Lists 4 Recursive search Mapping Recursive comparison Joining structures together 5 Accumulat ors Difference structures Example programs Intro. To propositional logic 6 Syntax & semantics Properties of statements Equivalence laws Inference rules 7 FOPL introduct ion Fopl syntax Fopl semantics Wff properties

Transcript of Sllp Lesson Plan

Page 1: Sllp Lesson Plan

1 2 3 4

1 Prolog

applications

Facts &

questions

Variables &

conjunctions

Rules

2 Prolog syntax Characters Operators Equality & matching

3 Arithmetic Satisfying

goals

Trees Lists

4 Recursive

search

Mapping Recursive

comparison

Joining structures

together

5 Accumulators Difference

structures

Example programs Intro. To

propositional logic

6 Syntax &

semantics

Properties of

statements

Equivalence laws Inference rules

7 FOPL

introduction

Fopl syntax Fopl semantics Wff properties

8 Clausal form

conversion

Inference rules Resolution principle Resolution types

9 Fuzzy logic Theory of

fuzzy sets

Properties of fuzzy

sets

Reasoning in fuzzy

logic

10 Neural

networks

Generating

multiple

solutions

The “CUT” Uses and problems

of CUT

11 Reading and

writing terms

Reading and

writing char.

Reading sentences Reading and writing

files

Page 2: Sllp Lesson Plan

12 Declaring

operators

Built in

predicates

Classifying terms Treating clauses

13 Components

of structures

Back tracking Compound goals Equality

14 Input and

output

Handling files Arithmetic

operations

Comparing numbers

15 Sorted tree

dictionary

Towers of

Hanoi

Resolution for P.L. Unification

16 First order

resolution

SLD resolution SLD trees Programming

techniques

17 Recursion CUT case

study

Negation case study Computation &

search rules