Lecture 1: Introduction to Articial Intelligence
Dr. Roman V Belavkin
BIS3226
Contents
1 Problems in AI and Related Areas
1
2 Questions about Intelligence
2
3 Applications of AI
3
References
3
1
Problems in AI and Related Areas
What is AI?
.science and e
Spiral model
This model is risk driven and based on certain key characteristics and risks of a given project.
This model takes some points from the waterfall model and implements it in a unique way.
Advantages
1. The risk involved is high
2. The software
Lecture 3: Logic and Rule-Based Reasoning
Dr. Roman V Belavkin
BIS3226
Contents
1 Introduction to Production Systems
1
2 Elements of Boolean Logic
2
3 Problem Solving
5
4 Development and Operation of ES
6
5 Discussion
9
1
Introduction to Production System
Lecture 4: Search
Dr. Roman V Belavkin
BIS3226
Contents
1 Introduction to Section Problems
1
2 Types and Examples of Search Strategies
3
3 Search in Rule-Based Systems
5
1
Introduction to Section Problems
A Simple Search Problem
Problem 1 (Choice). Choose
Lecture 6: Uncertainty and Information
Dr. Roman V Belavkin
BIS3226
Contents
1 Introduction
1
2 What is probability?
2
3 Conditional Probability and Independence
4
4 Uncertainty and Information
6
1
Introduction
Sources of Uncertainty
Complexity : the numb
Lecture 1s: Elements of Set Theory
Dr. Roman V Belavkin
BIS3226
Contents
1 Sets and Operations on Sets
1
2 Correspondences and Mappings between Sets
3
The bishop gave monkey the banana.
only
Only the bishop gave the monkey the banana.
The only bishop gave
Lecture 5: Knowledge Representation
Dr. Roman V Belavkin
BIS3226
Contents
1 Introduction to KR
1
2 Types of KR
2
3 Knowledge Synthesis and Engineering
3
1
Introduction to KR
Human Knowledge
Human knowledge is encoded and communicated in a natural languag
Lecture 7: Expectation and Correlation
Dr. Roman V Belavkin
BIS3226
Contents
1 Databases and Random Variables
1
2 Measures of Location
2
3 Measures of Dispersion
2
4 Correlation
4
1
Databases and Random Variables
Databases and Random Variables
Case:
Age
G
Lecture 2: Choice and Optimisation
Dr. Roman V Belavkin
BIS3226
Contents
1 Choice and Preference Relation
1
2 Utility Function
4
3 Multicriteria Decision Making
5
4 Types and Phases of Decisions
7
References
7
1
Choice and Preference Relation
AI and Decis
Lecture 2s: Elements of Order Theory
Dr. Roman V Belavkin
BIS3226
Binary Relation
Denition 1 (Binary Relation). on set A is any subset R A A.
Notation (a, b) R or aRb means a is related to b.
Example 2. Let A = cfw_, , be three students, and let likes an
Dialog Axiata PLC.
475, Union Place, Colombo 02.
T +94 (0) 77 7 123 456
F +94 (0) 77 7 678 697
+94 (0) 11 2 678 697
E [email protected]
INTERIM USAGE REPORT
MOBILE NUMBER : 772012201
CONTRACT ID
: 5211860
REPORT PERIOD : 2015-05-15 To 2015-05-20
MS CHILDREN
PEO TV 828'
eeeeeeeeeeeeeeeee
Cl
Convenience
an 0.- a Home Menu
V
@ Watch 1]: Channels
Thank You for ChOOSIng-ISLT PEO TV
This user guide WIll take you through all features and value added
services offered by PEO TV 1 ./-# 2 abc
4 ghi 5 N
3 tuv
FortiOS Handbook
WAN Optimization, Web Cache, Explicit Proxy, and
WCCP for FortiOS 5.0
FortiOS Handbook WAN Optimization, Web Cache, Explicit Proxy, and WCCP for FortiOS 5.0
June 10, 2014
01-500-96996-20140610
Copyright 2014 Fortinet, Inc. All rights rese
Job Description
Information Technology
Manager
Information Technology Manager
5/30/2005
Page 1
PURPOSE OF THE POSITION
(The main reason for the position, in what context and what is the overall end result)
The Information Technology Manager is responsible
Overall, how satisfied or dissatisfied are you
with the service that you recieved from
Minsthorpe Sports & Fitness Centre?
Very Satisified
Fairly Satisfied
Neither Satisifed or
dissatisfied
Fairly dissatisfied
Very Dissatisifed
How satisfied or dissatisfi
Last Activity Recorded : June 17, 2012
Microsoft Certification ID : 8061129
BUDDHI N WEERASEKERA
# 32/23
GOLDEN MEDOWS
KIRIGAMPAMUNUWA
POLGASOWITA, 10320 LK
[email protected]
ACTIVE MICROSOFT CERTIFICATIONS:
Microsoft Certified Professional
Certification
701 min, cull IMNTDSA me 8072;. m - um only
For mud. all lung-v Sutton .1 moo-RANGERS (7264071).
um
Mysamm-ADD
95.m., Osman. QM.,_M.,
l . . . I . I I
Play 3 out 01 these premium attractions
1 I I \
Featuring AWESOME ANGLES
Valid '07! day 1mm ElamA @
www.meikeda.com
PHOTO USA ELECTRONIC GRAPHIC INC.
Tel:+8610 58702200 Fax: +8610 58701866
SAFETY PRECAUTIONS
The precautions noted within this guide are intended to instruct you in the safe and correct use of the
products and to prevent injuries or damage
Questions 15:
Genetic Algorithms
Roman Belavkin
Middlesex University
Question 1
Give an example of combinatorial problem. What is the most dicult in
solving these problems?
Answer: One classical example is the Travelling Salesman problem (TSP),
described
Questions 14:
Case-Based Reasoning
Roman Belavkin
Middlesex University
Question 1
Briey describe the main principles of a case-based reasoning (CBR) expert
system, its operation process and possible dierences in implementation.
Answer:
A CBR system uses
Questions 10:
Multilinear Regression
Roman Belavkin
Middlesex University
Question 1
Suppose that a multiple regression model using m = 6 input variables should
be created based on some data. What is the minimum number of cases the
dataset should have?
Ans
Questions 7:
Expectation and Correlation
Roman Belavkin
Middlesex University
Question 1
Let variable x can have values 1, 2 and 3 with probabilities P (1) = 1/5,
P (2) = 3/5 and P (3) = 1/5. What is the expected value of x? Compare it
with mean value of (
Questions 8:
Game Theory
Roman Belavkin
Middlesex University
Question 1
Suppose of you have a choice between two lotteries A and B:
Lottery A: The utility can have values -1, 0 or 1.
Lottery B: The utility can have values -2, 0 or 2.
Suppose that all va
Questions 4:
Search
Roman Belavkin
Middlesex University
Question 1
Briey describe what is uninformed and informed search? Name examples
of uninformed and informed search strategies in lists and trees.
Answer:
Uninformed search uses some xed strategy that
Questions 5:
Knowledge Representation
Roman Belavkin
Middlesex University
Question 1
Describe four approaches to knowledge representation according to Mylopoulos & Levesque (1984).
Answer:
Logical calculus is used, such as rst-order predicate calculus, mo
Questions 6:
Uncertainty and Information
Roman Belavkin
Middlesex University
Question 1
Name and briey describe three main sources of uncertainty.
Answer: Here, we emphasise the following sources of uncertainty: Complexity, ignorance and randomness.
Compl
Questions 3:
Logic and Rule-Based Reasoning
Roman Belavkin
Middlesex University
Question 1
Use the equivalence of Boolean operations and set-theoretic operations to
prove the duality (De Morgans) laws:
(a b) = a b ,
(a b) = a b
Hint: you can use Venn diag
Questions 2:
Choice and Optimisation
Roman Belavkin
Middlesex University
Question 1
Consider a set of all integers z such that z 2 < 10. Is it an ordered set? Does
this set have the top (maximum) or the bottom (minimum) elements? What
are their values if