1 Final Exam Review CS 171/271. 2 Coverage Problem Solving and Searching Chapters 3,4,6 Logic Chapters 7,8,9 LISP Only those sections covered in the slides.

Slides:

Advertisements

Similar presentations

Inference in First-Order Logic

Advertisements

First-Order Logic.

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

Search I: Chapter 3 Aim: achieving generality Q: how to formulate a problem as a search problem?

Inference in first-order logic Chapter 9. Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward.

UIUC CS 497: Section EA Lecture #2 Reasoning in Artificial Intelligence Professor: Eyal Amir Spring Semester 2004.

Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)

Logical Inference 1 introduction Chapter 9 Some material adopted from notes by Andreas Geyer-Schulz,, Chuck Dyer, and Mary Getoor.

Methods of Proof Chapter 7, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.

Part2 AI as Representation and Search

1 Resolution in First Order Logic CS 171/271 (Chapter 9, continued) Some text and images in these slides were drawn from Russel & Norvig’s published material.

Proof methods Proof methods divide into (roughly) two kinds: –Application of inference rules Legitimate (sound) generation of new sentences from old Proof.

Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.

Midterm Review CMSC421 – Fall CH1 Summary: Intro AI Definitions: dimensions human/rational think/act Three Major Components of AI Algorithms Representation.

Carla P. Gomes CS4700 CS 4700: Foundations of Artificial Intelligence Carla P. Gomes Exam-Info.

Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9 Spring 2004.

Artificial Intelligence Course review AIMA. Four main themes Problem solving by search Uninformed search Informed search Constraint satisfaction Adversarial.

Games with Chance Other Search Algorithms CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 3 Adapted from slides of Yoonsuck Choe.

Cooperating Intelligent Systems Course review AIMA.

Computing & Information Sciences Kansas State University Lecture 11 of 42 CIS 530 / 730 Artificial Intelligence Lecture 11 of 42 William H. Hsu Department.

Big Ideas in Cmput366. Search Blind Search Iterative deepening Heuristic Search A* Local and Stochastic Search Randomized algorithm Constraint satisfaction.

Methods of Proof Chapter 7, second half.

Inference in First-Order Logic

CS121 Heuristic Search Planning CSPs Adversarial Search Probabilistic Reasoning Probabilistic Belief Learning.

1 Midterm Review cmsc421 Fall Outline Review the material covered by the midterm Questions?

What is AI? The exciting new effort to make computers thinks … machine with minds, in the full and literal sense” (Haugeland 1985) “The art of creating.

INFERENCE IN FIRST-ORDER LOGIC IES 503 ARTIFICIAL INTELLIGENCE İPEK SÜĞÜT.

Review ECE457 Applied Artificial Intelligence Spring 2008 Lecture #14.

 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.

CHAPTERS 7, 8 Oliver Schulte Logical Inference: Through Proof to Truth.

Artificial Intelligence Recap & Expectation Maximization CSE 473 Dan Weld.

Artificial Intelligence LECTURE 4 ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA.

An Introduction to Artificial Intelligence – CE Chapter 7- Logical Agents Ramin Halavati

S P Vimal, Department of CSIS, BITS, Pilani

Unification Algorithm Input: a finite set Σ of simple expressions Output: a mgu for Σ (if Σ is unifiable) 1. Set k = 0 and  0 = . 2. If Σ  k is a singleton,

1 2010/2011 Semester 2 Introduction: Chapter 1 ARTIFICIAL INTELLIGENCE.

Computing & Information Sciences Kansas State University Lecture 13 of 42 CIS 530 / 730 Artificial Intelligence Lecture 13 of 42 William H. Hsu Department.

Logical Agents Chapter 7. Knowledge bases Knowledge base (KB): set of sentences in a formal language Inference: deriving new sentences from the KB. E.g.:

1 Logical Agents Chapter 7. 2 A simple knowledge-based agent The agent must be able to: –Represent states, actions, etc. –Incorporate new percepts –Update.

Computing & Information Sciences Kansas State University Lecture 14 of 42 CIS 530 / 730 Artificial Intelligence Lecture 14 of 42 William H. Hsu Department.

1 Logical Inference Algorithms CS 171/271 (Chapter 7, continued) Some text and images in these slides were drawn from Russel & Norvig’s published material.

CPSC 386 Artificial Intelligence Ellen Walker Hiram College

Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 15 of 41 Friday 24 September.

1 Inference in First Order Logic CS 171/271 (Chapter 9) Some text and images in these slides were drawn from Russel & Norvig’s published material.

© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional Logic.

Computing & Information Sciences Kansas State University Lecture 12 of 42 CIS 530 / 730 Artificial Intelligence Lecture 12 of 42 William H. Hsu Department.

1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.

1 Uninformed Search Strategies Slides drawn from Andrew Moore’s Machine Learning Tutorials:

CHAPTER 2 SEARCH HEURISTIC. QUESTION ???? What is Artificial Intelligence? The study of systems that act rationally What does rational mean? Given its.

Artificial Intelligence Midterm 고려대학교 컴퓨터학과 자연어처리 연구실 임 해 창.

Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.

Lecture 2-1CS251: Intro to AI/Lisp II Today Quiz Announcements –Allegro for Windows checkout –Guest lecture on Thursday Today’s topics –More on macros.

Proof Methods for Propositional Logic CIS 391 – Intro to Artificial Intelligence.

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.

Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.

EA C461 Artificial Intelligence

Logical Inference 1 introduction

EA C461 – Artificial Intelligence Logical Agent

Artificial Intelligence

CS 416 Artificial Intelligence

First Order Logic: Logical Inference

Artificial Intelligence

فصل نهم استدلال در منطق مرتبه اول Session 5

CSE 4705 Artificial Intelligence

Artificial Intelligence: Agents and Propositional Logic.

CS 416 Artificial Intelligence

CS 416 Artificial Intelligence

SEG 4560 Midterm Review.

Presentation transcript:

1 Final Exam Review CS 171/271

2 Coverage Problem Solving and Searching Chapters 3,4,6 Logic Chapters 7,8,9 LISP Only those sections covered in the slides

3 Emphasis on Algorithms Given sample problems, environments, inputs Carry out an algorithm/determine the corresponding output Rough breakdown 70% of questions on carrying out algorithms 15% on LISP programming 15% on other question types (true-false, identification, writing logical sentences)

4 Algorithms on Searching Not so much on Chapter 3 BFS, UCS, DFS, Iterative Deepening DFS (recognize as simple cases of other algorithms) Heuristics Greedy Best-First Search A* search Hill-Climbing MiniMax, alpha-beta pruning

5 Logical Inference Algorithms Inference by enumeration (for Propositional Logic) Propositionalization (for FOL) Unification Resolution (PL & FOL) Forward Chaining (PL &FOL) No algorithm questions on backward ch Conversion to CNF