Professional Documents
Culture Documents
Fall 2013
Kashif Naeem Assistant Professor Department of Computer Science, The Institute of Management Sciences, Lahore
Course Prerequisites
Computer Programming Discrete Structures Vector/Linear Algebra Theory of Automata
Recommended Textbook
Book Title
Artificial Intelligence: A Modern Approach
Edition
3rd Edition
Authors
Russel & Norvig
Publisher
Prentice Hall
Course overview
Introduction and Agents (chapters 1,2) Search (chapters 3,4,5,6) Logic (chapters 7,8,9) Planning (chapters 11,12) Uncertainty (chapters 13,14) Learning (chapters 18,20) Natural Language Processing (chapter 22,23)
Topics
History of AI What is AI? What AI can do? Search
Machine Learning
Graph Search Constraint Satisfaction Games Nearest Neighbors Decision Trees Neural Networks SVM
History of AI
1940-1950: Early days
1943: McCulloch & Pitts: Boolean circuit model of brain 1950: Turing's Computing Machinery and Intelligence
1956: Dartmouth meeting: Artificial Intelligence adopted 1965: Robinson's complete algorithm for logical reasoning E.g., generate plan for driving to the airport 1966: Weizenbaum's Eliza / Turing test
History of AI
197088: Knowledge-based approaches
196979: Early development of knowledge-based systems 198088: Expert systems industry booms 198893: Expert systems industry busts: AI Winter
What is AI?
The Science of making machines that:
Think Humanly Think Rationally
Act Humanly
Act Rationally
Definition
The branch of Computer Science that is concerned with the automation of intelligent behavior. (Luger and Stubblefield, 1993) and many other definitions.
You should surf the internet for some definitions and their type illustration in detail?
reasoning,
language understanding learning
Rational Decisions
Here, the term Rational means: Maximally achieving pre-defined goals It only concerns what decisions are made (not the thought process behind them) Goals are expressed in terms of the utility of outcomes
Intelligent Behavior
Perceiving ones environment Acting in complex environments Learning and understating from experience Reasoning to solve problems and discover hidden knowledge Knowledge applying successfully in new situations Thinking abstractly using analogies Communication with others
Creativity
Ingenuity (originality) Expressiveness Curiosity
Hard / Strong AI
Generally, AI research aims to create AI that can replicate human intelligence completely. Strong AI refers to a machine that approaches or supersedes human intelligence:
If it can do typically human tasks If it can apply a wide range of background knowledge If it has some degree of self-consciousness
Soft / Weak AI
Weak AI refers to the use of software to study or accomplish specific problem solving or reasoning tasks that do not encompass the full range of human cognitive abilities. Example: A chess program such as Deep Blue Weak AI does not achieve self-awareness; it demonstrates wide range of human-level cognitive abilities; a specific problem solver
Goal is to formalize the reasoning process as a system of logical and procedures for inference.
The issue is, not all problems can be solved just by reasoning and inferences.
Doesn't necessarily involve thinking e.g., blinking reflex but thinking should be in the service of rational action
Rational agents
An agent is an entity that perceives and acts Abstractly, an agent is a function from percept histories to actions: [f: P* A] For any given class of environments and tasks, we seek the agent (or class of agents) with the best performance Caveat: computational limitations make perfect rationality unachievable design best program for given machine resources
Action functions causes the change in state. State space is a mathematical model of a physical system as a set of input, output and state variables related to each others. The number of inputs, outputs and states, the variables are expressed as vectors.
AI Techniques
Various techniques are available and are concerned with how we present, manipulate and reason with knowledge in order to solve problems. Example:
Techniques, not all intelligent but used to behave as intelligent
1. Describe and match
2.
3. 4. 5.
Goal reduction
Constraint satisfaction Tree searching Generate and Test (GT)
6.
1. 2. 3.
Shortest solution is the sequence of transitions from the top state downward to the lower left.
2. Goal Reduction
Goal-reduction procedure are special case of the procedural representations of knowledge in AI The process involves the hierarchical sub-division of goals in sub-goals, until the sub-goals which have an immediate solution are reached and said goal has been satisfied. An AND/OR tree structure can represent relations between goals and sub-goals, alternate sub-goals and conjoint sub-goals.
2. Goal Reduction
Goal reduction process is illustrated in the form of AND/OR tree drawn upside-down. Goal levels: Higher-level goals are higher in tree and lower level goals are lower in the tree.
Arcs are directed from a higher-to-lower level node represents the reduction of higher-level goal to lowerlevel sub-goal.
Nodes at the bottom of the tree represents irreducible action goals.
Work hard
Work hard
All solutions,
An optimal, or a good solution Constraint Optimization Problem (COP)
Constraint satisfaction has application in AI programming languages, symbolic computing, computational logic and etc.
(NOTE: Two examples to be illustrated by the students)
4. Tree Searching
Many problems (e.g. goal reduction) can be described in the form of a search tree. A solution to the problem is obtained by finding a path through this tree. A search through the entire tree, until a satisfactory path is found, is called exhaustive search.
In the case of a dead end backtrack to the last node in the tree where a previously unexplored path branches of, and test this path.
2.
Hill Climbing
Like depth-first but involving some quantitative decision on the most likely path to follow at each node
3.
Beam Search
Lie breadth-first (level by level) but selecting only those N nodes at each level that are most likely to lead to a solution
4.
Best-first Search
Like beam search but only proceeding from on most likely node at each level.
Rule syntax is IF <condition> THEN <action> e.g. IF <(temperature, over, 20)> THEN <add (ocean, swimmable, yes)>
If the conditions are matched to the working memory and if fulfilled then rule may be fired. RB actions are: Add Remove Modify fact(s) to WM; fact(s) to WM; fact(s) to WM;
Biology-Inspired AI Techniques