Topic outline

• Welcome to AI Lab
  

  Welcome to AI Lab

  • 
    

  • 
    

    Course Objectives:

    After completing the course students will be able to:

    - Explain Unification, Recursion and Listing using Prolog

    - Apply Uninformed Search strategy using Prolog

    - Apply Heuristic Search strategy using Prolog

  • Assessment Policies:

    Class Attendance	10
    Lab Performance	25
    Project	25
    Lab Final	40
    Total	100

    
    
    

  • Grading Policy:

    
    

    Numerical Grade	Letter Grade		Grade Point
    80% and above	A+	(A Plus)	4.0
    75% to less than 80%	A	(A regular)	3.75
    70% to less than 75%	A-	(A minus)	3.5
    65% to less than 70%	B+	(B Plus)	3.25
    60% to less than 65%	B	(B regular)	3.0
    55% to less than 60%	B-	(B minus)	2.75
    50% to less than 55%	C+	(C Plus)	2.5
    45% to less than 50%	C	C (regular)	2.25
    40% to less than 45%	D		2.0
    Less than 40%	F		0.0

    
    
    

  • Text Book:

    "Prolog Programming for Artificial Intelligence,” 3^rd edt., Ivan Bratko, Pearson Education.

    
    

  • Download Text Book File
  • Announcements Forum
• Week 1
  

  Week 1

  • Session 1: Introduction to Prolog Programming

    Intended Learning Outcome:
    At the end of the session, student should be able to:

    • Give some simple examples of Prolog programs

    • Discuss the three basic constructs in Prolog:

    – Facts

    – Rules

    – Queries

    • Explain other concepts, such as 

    – the role of logic

    – unification with the help of variables

    • Write codes using

    – terms

    – atoms, and

    – variables

  • Basics of Prolog File

    Mark as done
  • Additional Resource Folder

    Mark as done

    
    

    
    

    
    

    
    
    

    
    

  • Video Lecture of Week 1 URL

    Mark as done
• Week 2
  

  Week 2

  • Session II: Unification in Prolog

    Aim of this leacture:

      • Discuss unification in Prolog

    – Show how Prolog unification differs from standard unification

    • Explain Prolog’s search strategy

    – Prolog deduces new information from old, using modus ponens

    
    

  • Unification in Prolog File
  • Additional Resource Folder

    Mark as done

    
    

    
    
    

    
    
    

    
    

  • Video Lecture of Week 2 Folder

    Mark as done
• Week 3
  

  Week 3

  • Session 3: Recursion in Prolog

    Aim of the Session:

    –  Introduce recursive definitions in Prolog
    –  Go through four examples
    –  Show that there can be mismatches between
    the declarative and procedural meaning of a
    Prolog program
    
    

  • Recursion in Prolog File
  • Video Lectures of Week 3 Folder

    Mark as done

    https://drive.google.com/file/d/1lA-Y3blRigyK4vJzrLFzu7aed72XcC1N/view?usp=sharing
    
    https://drive.google.com/file/d/1aMDYwP4qrIvC_UbepJI_rkB0mcnPekZh/view?usp=sharing
    

• Week 4
  

  Week 4

  • Session IV: Lists

    Aim of this lecture is to

    - Introduce lists, an important recursive data structure often used in Prolog programming
    –  Define the member/2 predicate, a fundamental Prolog tool for manipulating lists
    –  Illustrate the idea of recursing down lists
    

  • Lists File
  • Feedback about your Learning Interest URL

    Mark as done
• Week 5
  

  Week 5

  • Session V: Arithmatic

    Aim of this lecture:

    –  Introduce Prolog`s built-in abilities for performing arithmetic
    –  Apply these to simple list processing problems, using accumulators
    –  Look at tail-recursive predicates and explain why they are more efficient than predicates that are not tail-recursive
    
    

  • Arithmatic File
• Week 6
  

  Week 6

  • Session 6: More on Lists

    Aim of the lecture:

    –  Define append/3, a predicate for concatenating two lists, and illustrate what can be done with it
    –  Discuss two ways of reversing a list
    •  A naïve way using append/3
    •  A more efficient method using accumulators
    

  • More on Lists File
• Week 7
  

  Week 7

  Midterm Exam

  date and time will announced later.
• Week 8
  

  Week 8

  • Session VII: Definite Clause Grammars
    

    Aim of the Lecture:

    – Introduce context free grammars and some related concepts
    – Introduce definite clause grammars, the Prolog way of working with context free grammars (and other grammars too)
    
    

  • Definite Clause Grammars File
• Week 9
  

  Week 9

  • Session VIII: More on Definite Clause Grammars
    

    Aim of the lecture:

    – Examine two important capabilities offered by DCG notation:
    •  Extra arguments
    •  Extra tests
    – Discuss the status and limitations of DCGs
    

  • More on DCGs File
• Week 10
  

  Week 10

  • Session IX: A closer look at terms
    

    Aim of the lecture:

    – Introduce the == predicate
    – Take a closer look at term structure
    – Introduce strings in Prolog
    – Introduce operators
    

  • Closer look at terms File
• Week 11
  

  Week 11

  • Session X: Cuts and Negation
    

    Aim of the lecture:

    – Explain how to control Prolog’s backtracking behaviour with the helpof the cut predicate 
    – Introduce negation
    – Explain how cut can be packaged into a more structured form, namely “negation as failure”
    

• Week 12
  

  Week 12

  Project Presentation
• Week 13
  

  Week 13

  • Lab Final

• Week 14
  

  Week 14

  Final Exam

  date and time will announced later.