SEG 4560 Midterm Review.

Slides:



Advertisements
Similar presentations
Big Ideas in Cmput366. Search Blind Search State space representation Iterative deepening Heuristic Search A*, f(n)=g(n)+h(n), admissible heuristics Local.
Advertisements

Local Search Jim Little UBC CS 322 – CSP October 3, 2014 Textbook §4.8
Local Search Algorithms Chapter 4. Outline Hill-climbing search Simulated annealing search Local beam search Genetic algorithms Ant Colony Optimization.
CSC411Artificial Intelligence 1 Chapter 3 Structures and Strategies For Space State Search Contents Graph Theory Strategies for Space State Search Using.
Greedy best-first search Use the heuristic function to rank the nodes Search strategy –Expand node with lowest h-value Greedily trying to find the least-cost.
1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)
Search I: Chapter 3 Aim: achieving generality Q: how to formulate a problem as a search problem?
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Methods of Proof Chapter 7, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.
Chapter 4 Search Methodologies.
Lecture 12 Last time: CSPs, backtracking, forward checking Today: Game Playing.
Adversarial Search Board games. Games 2 player zero-sum games Utility values at end of game – equal and opposite Games that are easy to represent Chess.
Lecture 13 Last time: Games, minimax, alpha-beta Today: Finish off games, summary.
Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.
Chapter 14 An Overview of Query Optimization. Copyright © 2005 Pearson Addison-Wesley. All rights reserved Figure 14.1 Typical architecture for.
Midterm Review CMSC421 – Fall CH1 Summary: Intro AI Definitions: dimensions human/rational think/act Three Major Components of AI Algorithms Representation.
1 Using Search in Problem Solving Part II. 2 Basic Concepts Basic concepts: Initial state Goal/Target state Intermediate states Path from the initial.
1 Chapter 4 Search Methodologies. 2 Chapter 4 Contents l Brute force search l Depth-first search l Breadth-first search l Properties of search methods.
Chapter 5 Trees PROPERTIES OF TREES 3 4.
Big Ideas in Cmput366. Search Blind Search Iterative deepening Heuristic Search A* Local and Stochastic Search Randomized algorithm Constraint satisfaction.
Uninformed Search Reading: Chapter 3 by today, Chapter by Wednesday, 9/12 Homework #2 will be given out on Wednesday DID YOU TURN IN YOUR SURVEY?
Methods of Proof Chapter 7, second half.
Implementing the Intelligent Systems Knowledge Units of Computing Curricula 2001 Ingrid Russell Todd Neller.
CS121 Heuristic Search Planning CSPs Adversarial Search Probabilistic Reasoning Probabilistic Belief Learning.
Machine Learning and Review Reading: C Bayesian Approach  Each observed training example can incrementally decrease or increase probability of.
1 Midterm Review cmsc421 Fall Outline Review the material covered by the midterm Questions?
 Define A.I and discuss its application areas in detail.  Explain Turing test. why it is not justifiable to use it to test whether the machine is intelligent.
Artificial Intelligence LECTURE 3 ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA 1.
CHAPTERS 7, 8 Oliver Schulte Logical Inference: Through Proof to Truth.
Computing & Information Sciences Kansas State University Wednesday, 15 Oct 2008CIS 530 / 730: Artificial Intelligence Lecture 20 of 42 Wednesday, 15 October.
1 CSE 4705 Artificial Intelligence Jinbo Bi Department of Computer Science & Engineering
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
MDPs (cont) & Reinforcement Learning
Artificial Intelligence for Games Informed Search (2) Patrick Olivier
KNOWLEDGE BASED SYSTEMS
Search (continued) CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.
1 Final Exam Review CS 171/ Coverage Problem Solving and Searching Chapters 3,4,6 Logic Chapters 7,8,9 LISP Only those sections covered in the slides.
Artificial Intelligence Midterm 고려대학교 컴퓨터학과 자연어처리 연구실 임 해 창.
Domain Splitting, Local Search CPSC 322 – CSP 4 Textbook §4.6, §4.8 February 4, 2011.
Computing & Information Sciences Kansas State University Wednesday, 04 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 17 of 42 Wednesday, 04 October.
Computing & Information Sciences Kansas State University Friday, 13 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 21 of 42 Friday, 13 October.
Romania. Romania Problem Initial state: Arad Goal state: Bucharest Operators: From any node, you can visit any connected node. Operator cost, the.
Constraint Propagation CS121 – Winter Constraint Propagation2 Constraint Propagation … … is the process of determining how the possible values of.
The Hebrew University of Jerusalem School of Engineering and Computer Science Academic Year: 2011/2012 Instructor: Jeff Rosenschein.
Chapter 3.5 Heuristic Search. Learning Objectives Heuristic search strategies –Best-first search –A* algorithm Heuristic functions.
Lecture 3 Problem Solving through search Uninformed Search
Last time: search strategies
AI Classnotes #5, John Shieh, 2012
Iterative Deepening A*
CS 460 Spring 2011 Lecture 4.
Review of AI Professor: Liqing Zhang
CSCI 5582 Artificial Intelligence
Quiz Feb Inf. Search & CSP.
CSE 4705 Artificial Intelligence
Constraint Propagation
CS 416 Artificial Intelligence
Announcements Homework 3 due today (grace period through Friday)
First Order Logic: Logical Inference
CSE 4705 Artificial Intelligence
Artificial Intelligence: Agents and Propositional Logic.
Search Exercise Search Tree? Solution (Breadth First Search)?
Introduction to Artificial Intelligence Lecture 9: Two-Player Games I
Simply Logical – Chapter 5
Approaches to search Simple search Heuristic search Genetic search
Algorithms Lecture # 29 Dr. Sohail Aslam.
Methods of Proof Chapter 7, second half.
Overview Fundamental of Artificial Intelligence (CSC3180)
Midterm Review.
Presentation transcript:

SEG 4560 Midterm Review

Midterm In class, 4:30-6:15pm, March 09, 2009 5 Questions from Chapters 3-8 One A4 size cheat sheet Useful materials: Tutorials 1 and 2, Assignments 1 and 2, and Lecture notes

Chapters 7 and 8 Express sentences in Propositional logic First-order logic Connectives Logical equivalence Forward chaining, backward chaining Resolution algorithm

Chapter 6 Minimax algorithm Alpha-beta algorithm Minimax of nondeterministic games

Chapter 5 CSPs Backtracking search for CSPs Variables Domains Constraints Backtracking search for CSPs Various heuristics to speedup search

Chapter 4 Greedy search and A* search Local search Evaluation function, admissible heuristic Local search Hill-climbing Properties of these search methods Efficiency Completeness Optimality

Chapter 3 Breadth-first search Uniform-cost search Depth-first search Depth-limited search Iterative deepening search Properties and Comparisons Efficiency Space Completeness Optimality

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.