The Wumpus Game. Stench Gold. Start. Cao Hoang Tru CSE Faculty - HCMUT
|
|
- Gwendoline Hampton
- 5 years ago
- Views:
Transcription
1 The Wumpus Game Stench Stench Gold Stench Start 1
2 The Wumpus Game Stench in the square containing the wumpus and in the directly adjacent squares in the squares directly adjacent to a pit Glitter in the square where the gold is Bump when an agent walks into a wall Scream when the wumpus is killed 2
3 The Wumpus Game Agent s percept: [Stench,, Glitter, Bump, Scream] Agent s actions: Go forward, turn right 90 o, turn left 90 o Grab to pick up an object in the same square Fire 1 arrow in a straight line in the faced direction Climb to leave the cave Death if entering a square of a pit or a live wumpus Agent s goal: find and bring the gold back to the start 3
4 The Wumpus Game Stench A = Agent B = Stench Gold G = Glitter/Gold OK = Safe square P = Pit Stench OK S = Stench V = Visited Start W = Wumpus A OK 4
5 The Wumpus Game Stench A = Agent B = Stench Gold G = Glitter/Gold OK = Safe square P = Pit Stench S = Stench OK P? V = Visited Start W = Wumpus V A P? 5
6 The Wumpus Game Stench A = Agent B = Stench Gold G = Glitter/Gold OK = Safe square P = Pit Stench S = Stench A OK V = Visited Start W = Wumpus V V 6
7 The Wumpus Game Stench A = Agent B = Stench Gold G = Glitter/Gold OK = Safe square P = Pit Stench S = Stench V A V = Visited Start W = Wumpus V V 7
8 The Wumpus Game Stench A = Agent B = Stench Gold A G = Glitter/Gold OK = Safe square P = Pit Stench S = Stench V V V = Visited Start W = Wumpus V V 8
9 Propositional Logic Syntax Logical constants:, Propositional symbols: P, Q, Logical connectives:,,,, Sentences (formulas): Logical constants Proposition symbols If α is a sentence, then so are α and (α) If α and β are sentences, then so are α β, α β, α β, and α β 9
10 Propositional Logic Semantics Interpretation: propositional symbol / The truth value of a sentence is defined by the truth table P Q P P Q P Q P Q P Q 10
11 Propositional Logic Semantics Satisfiable: under an interpretation Valid: under all interpretations P Q P P (P Q) Q ((P Q) Q) P unsatisfiable satisfiable valid 11
12 Propositional Logic Semantics Model: an interpretation under which the sentence is P Q P Q P Q P Q P Q P Q P Q P Q 12
13 Propositional Logic Semantics Entailment: KB = α iff every model of KB is a model of α α is a logical consequence of KB P Q P Q P Q, P {P Q, P} = Q 13
14 Propositional Logic Semantics Equivalence: α β iff α = β and β = α P Q P Q P Q P Q P Q 14
15 Propositional Logic Semantics Theorems: α = β iff α β is valid KB = α can be proved by validity of KB α α = β iff α β is unsatisfiable KB = α can be proved by refutation of KB α 15
16 Inference Rules Rule R: Premises: α 1, α 2,..., α n Conclusion: β Soundness: R is sound iff {α 1, α 2,..., α n } = β 16
17 Inference Rules Modus Ponens: α β, α β -Elimination: α 1 α 2... α n α i 17
18 Inference Rules -Introduction: α 1, α 2,, α n α 1 α 2 α n -Introduction: α i α 1 α 2 α n 18
19 Inference Rules Double-negation elimination: α α 19
20 Resolution Unit resolution: P 1 P i P n, Q P i Q (all P i and Q are literals) P 1 P i-1 P i+1 P n Full resolution: P i Q j P 1 P i P n, Q 1 Q j Q m P 1 P i-1 P i+1 P n Q 1 Q j-1 Q j+1 Q m 20
21 Resolution Conjunctive normal form (CNF): conjunction of disjunctions of literals (L 11 L 1k ) (L n1 L nm ) clause k-cnf: each clause contains at most k literals Every sentence can be written in CNF 21
22 Resolution Conjunctive normal form (CNF): conjunction of disjunctions of literals (P Q) R (P Q) R P Q R (S T) Q (S T) Q ( S Q) ( T Q) 22
23 Inference Algorithms To derive/assert a sentence given a knowledge base (i.e., a set of sentences) Inference algorithm = Inference rules + a searching algorithm 23
24 Inference Algorithms Algorithm PL-Resolution(KB, α) input: KB and α are PL sentences output: (to assert KB = α) or (otherwise) Clauses = set of clauses in the CNF representation of KB α New = {} loop for each C i, C j in Clauses do Resolvents = PL-Resolve(C i, C j ) if Resolvents contains an empty clause then return New = New Resolvents if New Clauses then return Clauses = Clauses New 24
25 Example: Inference Algorithms KB = {P, (P Q) R, (S T) Q, T} α = R 25
26 Inference Algorithms Soundness: every deduced answer is correct 26
27 Inference Algorithms Completeness: every correct answer is deducible 27
28 Inference Algorithms Example: Google search 28
29 Inference Algorithms Soundness Completeness Complexity 29
30 Inference Algorithms Soundness: every deduced answer is correct if PL-Resolution returns then KB = α 30
31 Inference Algorithms Completeness: every correct answer is deducible if KB = α then PL-Resolution returns 31
32 Inference Algorithms PL-Resolution is sound and complete 32
33 Inference Algorithms Modus Ponens with any searching algorithm is not complete KB = {P Q, Q R} α = P R 33
34 Inference Algorithms Horn clause: disjunction of literals of which at most one is positive or P 1 P 2 P n Q P 1 P 2 P n Q Forward or backward chaining can be used for inference on Horn clauses 34
35 Satisfiability Problem SAT problem: to determine if a sentence is satisfiable (to determine if the symbols in the sentence can be assigned / as to make it evaluate to ) ( D B C) (B A C) ( C B E) (E D B) (B E C) 35
36 Satisfiability Problem SAT problem in propositional logic is NP-complete This does not mean all instances of PL inference has the exponential complexity Polynomial-time inference procedures for Horn clauses 36
37 Satisfiability Problem Many combinatorial problems in computer science can be reduced to SAT 37
38 Satisfiability Problem Backtracking algorithms Davis and Putnam (1960) Davis, Logemann, Loveland (1962) DPLL 38
39 DPLL algorithm: Satisfiability Problem Recursive, depth-first enumeration of possible models 39
40 DPLL algorithm: Satisfiability Problem Early termination: a clause is if any literal is (A B) (A C) is if A is regardless of B and C. 40
41 DPLL algorithm: Satisfiability Problem Pure symbol: has the same sign in all clauses (A B) ( B C) (C A) A model would have the literals of pure symbols assigned. Satisfied clause removal makes new pure symbols. 41
42 DPLL algorithm: Satisfiability Problem Unit clause: has just one literal (A B) B Unit clause satisfaction makes new unit clauses (unit propagation). 42
43 Statisfiability Problem Algorithm DPLL(Clauses, Symbols, Model) if every clause in Clauses is in Model then return if some clause in Clauses is in Model then return (P, value) = PURE-SYMBOL(Clauses, Symbols, Model) if P null then return DPLL(Clauses, Symbols - P, EXT(P, value, Model)) (P, value) = UNIT-CLAUSE(Clauses, Symbols, Model) if P null then return DPLL(Clauses, Symbols - P, EXT(P, value, Model)) choose a P in Symbols return DPLL(Clauses, Symbols - P, EXT(P,, Model)) or DPLL(Clauses, Symbols - P, EXT(P,, Model)) 43
44 DPLL algorithm: Satisfiability Problem ( D B C) (B A C) ( C B E) (E D B) (B E C) 44
45 Satisfiability Problem Local search algorithms Evaluation function counts the number of unsatisfied clauses 45
46 Satisfiability Problem Local search algorithms Evaluation function counts the number of unsatisfied clauses Randomness to escape local minima Flipping the truth value of one symbol at a time 46
47 Statisfiability Problem Algorithm WalkSAT(Clauses, p, max_flips) /*1996*/ input: p is flipping probability, max_flips is number of flips allowed output: a model or failure Model = a random assignment of truth values to the symbols for i = 1 to max_flips do if Model satisfies Clauses then return Model C = a randomly selected clause from Clauses that is in Model with probability p flip the value in Model of a symbol from C else flip whichever symbol in C to maximizes no. of satisfied clauses return failure 47
48 Satisfiability Problem WalkSAT algorithm: ( D B C) (B A C) ( C B E) (E D B) ( A E C) Initial model: A = B = C = D = E = 48
49 Satisfiability Problem The larger the ratio clause/symbol is, the less likely the clause is satisfiable. 49
50 Satisfiability Problem The probability of satisfiability drops sharply around the ratio of
51 Satisfiability Problem That is actually when the problem is hard. 51
52 Satisfiability Problem WalkSAT is much faster than DPLL. 52
53 Inference Monotonicity Monotonicity: the set of entailed sentences can only increase when information is added to the KB if KB 1 = α then (KB 1 KB 2 ) = α 53
54 Inference Monotonicity Propositional logic is monotone 54
55 An Agent for the Wumpus Game Knowledge Base: X ij = column i, row j S 11 B 11 4 Stench S B S B Stench Gold Stench 2 Start
56 An Agent for the Wumpus Game Knowledge Base: X ij = column i, row j R 1 : S 11 W 11 W 12 W 21 R 2 : S 21 W 11 W 21 W 22 W 31 R 3 : S 12 W 11 W 12 W 22 W 13 R 4 : S 12 W 13 W 12 W 22 W 11 56
57 Agent for the Wumpus Game Finding the wumpus: Modus Ponens ( S 11 + R 1 ): W 11 W 12 W 21 -Elimination: W 11 W 12 W 21 Modus Ponens ( S 21 + R 2 ): W 11 W 21 W 22 W 31 -Elimination: W 11 W 21 W 22 W 31 Modus Ponens (S 12 + R 4 ): W 13 W 12 W 22 W 11 Unit resolution ( W 11 + W 13 W 12 W 22 W 11 ): W 13 W 12 W 22 Unit resolution ( W 22 + W 13 W 12 W 22 ): W 13 W 12 Unit resolution ( W 12 + W 13 W 12 ): W 13 57
58 Agent for the Wumpus Game Translating knowledge into action: A 11 East A W 21 Forward 58
59 Agent for the Wumpus Game Problems with the propositional agent: Too many propositions to handle: "Don t go forward if the wumpus is in front of you!" requires 16 x 4 = 64 propositions. Hard to deal with time and change Not expressive enough to represent or answer a question like "What action should the agent take?", 59
60 Homework In Russell & Norvig s AIMA (2 nd ed.): Exercises of Chapter 7. 60
Proof Methods for Propositional Logic
Proof Methods for Propositional Logic Logical equivalence Two sentences are logically equivalent iff they are true in the same models: α ß iff α β and β α Russell and Norvig Chapter 7 CS440 Fall 2015 1
More informationLogical Agents. Outline
Logical Agents *(Chapter 7 (Russel & Norvig, 2004)) Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability
More informationChapter 7 R&N ICS 271 Fall 2017 Kalev Kask
Set 6: Knowledge Representation: The Propositional Calculus Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask Outline Representing knowledge using logic Agent that reason logically A knowledge based agent Representing
More informationIntelligent Agents. Pınar Yolum Utrecht University
Intelligent Agents Pınar Yolum p.yolum@uu.nl Utrecht University Logical Agents (Based mostly on the course slides from http://aima.cs.berkeley.edu/) Outline Knowledge-based agents Wumpus world Logic in
More informationLogical Agents. Chapter 7
Logical Agents Chapter 7 Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem
More informationEE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 10, 5/9/2005 University of Washington, Department of Electrical Engineering Spring 2005 Instructor: Professor Jeff A. Bilmes Logical Agents Chapter 7
More informationLogical Agents. Santa Clara University
Logical Agents Santa Clara University Logical Agents Humans know things Humans use knowledge to make plans Humans do not act completely reflexive, but reason AI: Simple problem-solving agents have knowledge
More informationTitle: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5)
B.Y. Choueiry 1 Instructor s notes #12 Title: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5) Introduction to Artificial Intelligence CSCE 476-876, Fall 2018 URL: www.cse.unl.edu/ choueiry/f18-476-876
More informationClass Assignment Strategies
Class Assignment Strategies ì Team- A'ack: Team a'ack ì Individualis2c: Search for possible ì Poli2cal: look at others and make decision based on who is winning, who is loosing, and conversa;on ì Emo2on
More informationArtificial Intelligence
Artificial Intelligence Propositional Logic Marc Toussaint University of Stuttgart Winter 2015/16 (slides based on Stuart Russell s AI course) Outline Knowledge-based agents Wumpus world Logic in general
More information7 LOGICAL AGENTS. OHJ-2556 Artificial Intelligence, Spring OHJ-2556 Artificial Intelligence, Spring
109 7 LOGICAL AGENS We now turn to knowledge-based agents that have a knowledge base KB at their disposal With the help of the KB the agent aims at maintaining knowledge of its partially-observable environment
More informationLogical agents. Chapter 7. Chapter 7 1
Logical agents Chapter 7 Chapter 7 Outline Knowledge-based agents Wumpus world Logic in general models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules
More informationArtificial Intelligence
Artificial Intelligence Propositional Logic Marc Toussaint University of Stuttgart Winter 2016/17 (slides based on Stuart Russell s AI course) Motivation: Most students will have learnt about propositional
More informationTDT4136 Logic and Reasoning Systems
TDT436 Logic and Reasoning Systems Chapter 7 - Logic gents Lester Solbakken solbakke@idi.ntnu.no Norwegian University of Science and Technology 06.09.0 Lester Solbakken TDT436 Logic and Reasoning Systems
More informationCS 771 Artificial Intelligence. Propositional Logic
CS 771 Artificial Intelligence Propositional Logic Why Do We Need Logic? Problem-solving agents were very inflexible hard code every possible state E.g., in the transition of 8-puzzle problem, knowledge
More informationLogical Agents: Propositional Logic. Chapter 7
Logical Agents: Propositional Logic Chapter 7 Outline Topics: Knowledge-based agents Example domain: The Wumpus World Logic in general models and entailment Propositional (Boolean) logic Equivalence, validity,
More informationLogical Agent & Propositional Logic
Logical Agent & Propositional Logic Berlin Chen 2005 References: 1. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Chapter 7 2. S. Russell s teaching materials Introduction The representation
More informationLogical Inference. Artificial Intelligence. Topic 12. Reading: Russell and Norvig, Chapter 7, Section 5
rtificial Intelligence Topic 12 Logical Inference Reading: Russell and Norvig, Chapter 7, Section 5 c Cara MacNish. Includes material c S. Russell & P. Norvig 1995,2003 with permission. CITS4211 Logical
More informationCS 380: ARTIFICIAL INTELLIGENCE PREDICATE LOGICS. Santiago Ontañón
CS 380: RTIFICIL INTELLIGENCE PREDICTE LOGICS Santiago Ontañón so367@drexeledu Summary of last day: Logical gents: The can reason from the knowledge they have They can make deductions from their perceptions,
More informationCS:4420 Artificial Intelligence
CS:4420 Artificial Intelligence Spring 2018 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2004 18, Cesare Tinelli and Stuart Russell a a These notes were originally developed by Stuart
More informationCS 380: ARTIFICIAL INTELLIGENCE
CS 380: RTIFICIL INTELLIGENCE PREDICTE LOGICS 11/8/2013 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2013/cs380/intro.html Summary of last day: Logical gents: The can
More informationIntroduction to Artificial Intelligence. Logical Agents
Introduction to Artificial Intelligence Logical Agents (Logic, Deduction, Knowledge Representation) Bernhard Beckert UNIVERSITÄT KOBLENZ-LANDAU Winter Term 2004/2005 B. Beckert: KI für IM p.1 Outline Knowledge-based
More informationLogical Agent & Propositional Logic
Logical Agent & Propositional Logic Berlin Chen Department of Computer Science & Information Engineering National Taiwan Normal University References: 1. S. Russell and P. Norvig. Artificial Intelligence:
More informationInf2D 06: Logical Agents: Knowledge Bases and the Wumpus World
Inf2D 06: Logical Agents: Knowledge Bases and the Wumpus World School of Informatics, University of Edinburgh 26/01/18 Slide Credits: Jacques Fleuriot, Michael Rovatsos, Michael Herrmann Outline Knowledge-based
More informationArtificial Intelligence. Propositional logic
Artificial Intelligence Propositional logic Propositional Logic: Syntax Syntax of propositional logic defines allowable sentences Atomic sentences consists of a single proposition symbol Each symbol stands
More informationRevised by Hankui Zhuo, March 21, Logical agents. Chapter 7. Chapter 7 1
Revised by Hankui Zhuo, March, 08 Logical agents Chapter 7 Chapter 7 Outline Wumpus world Logic in general models and entailment Propositional (oolean) logic Equivalence, validity, satisfiability Inference
More information7. Logical Agents. COMP9414/ 9814/ 3411: Artificial Intelligence. Outline. Knowledge base. Models and Planning. Russell & Norvig, Chapter 7.
COMP944/984/34 6s Logic COMP944/ 984/ 34: rtificial Intelligence 7. Logical gents Outline Knowledge-based agents Wumpus world Russell & Norvig, Chapter 7. Logic in general models and entailment Propositional
More informationLogical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14
0/0/4 Knowledge based agents Logical Agents Agents need to be able to: Store information about their environment Update and reason about that information Russell and Norvig, chapter 7 Knowledge based agents
More informationLogical Agents (I) Instructor: Tsung-Che Chiang
Logical Agents (I) Instructor: Tsung-Che Chiang tcchiang@ieee.org Department of Computer Science and Information Engineering National Taiwan Normal University Artificial Intelligence, Spring, 2010 編譯有誤
More informationLast update: March 4, Logical agents. CMSC 421: Chapter 7. CMSC 421: Chapter 7 1
Last update: March 4, 00 Logical agents CMSC 4: Chapter 7 CMSC 4: Chapter 7 Outline Knowledge-based agents Wumpus world Logic in general models and entailment Propositional (oolean) logic Equivalence,
More informationKecerdasan Buatan M. Ali Fauzi
Kecerdasan Buatan M. Ali Fauzi Artificial Intelligence M. Ali Fauzi Logical Agents M. Ali Fauzi In which we design agents that can form representations of the would, use a process of inference to derive
More informationLogic. proof and truth syntacs and semantics. Peter Antal
Logic proof and truth syntacs and semantics Peter Antal antal@mit.bme.hu 10/9/2015 1 Knowledge-based agents Wumpus world Logic in general Syntacs transformational grammars Semantics Truth, meaning, models
More informationCS 188: Artificial Intelligence Spring 2007
CS 188: Artificial Intelligence Spring 2007 Lecture 8: Logical Agents - I 2/8/2007 Srini Narayanan ICSI and UC Berkeley Many slides over the course adapted from Dan Klein, Stuart Russell or Andrew Moore
More informationArtificial Intelligence Chapter 7: Logical Agents
Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent State University February 20, 2006 AI: Chapter 7: Logical Agents 1 Contents Knowledge Based Agents
More informationIntroduction to Intelligent Systems
Logical Agents Objectives Inference and entailment Sound and complete inference algorithms Inference by model checking Inference by proof Resolution Forward and backward chaining Reference Russel/Norvig:
More informationIntroduction to Intelligent Systems
Logical Agents Objectives Inference and entailment Sound and complete inference algorithms Inference by model checking Inference by proof Resolution Forward and backward chaining Reference Russel/Norvig:
More informationLogical Agents. Chapter 7
Logical Agents Chapter 7 Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard, Maren Bennewitz, and Marco Ragni Albert-Ludwigs-Universität Freiburg Contents 1 Agents
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 17, 2016
More informationLogical Agents. Soleymani. Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 7
Logical Agents CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2016 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 7 Knowledge-based agents
More informationAgenda. Artificial Intelligence. Reasoning in the Wumpus World. The Wumpus World
Agenda Artificial Intelligence 10. Propositional Reasoning, Part I: Principles How to Think About What is True or False 1 Introduction Álvaro Torralba Wolfgang Wahlster 2 Propositional Logic 3 Resolution
More informationLecture 6: Knowledge 1
rtificial Intelligence, CS, Nanjing University Spring, 08, Yang Yu Lecture 6: Knowledge http://cs.nju.edu.cn/yuy/course_ai8.ash Previously... Basic ability: search Path-based search Iterative-improvement
More informationLogical Agents. Course material: Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 7
Logical Agents CE417: Introduction to Artificial Intelligence Sharif University of Technology Soleymani In which we design agents that can form representations of a complex world, use a process of inference
More information7. Propositional Logic. Wolfram Burgard and Bernhard Nebel
Foundations of AI 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard and Bernhard Nebel Contents Agents that think rationally The wumpus world Propositional logic: syntax and semantics
More informationLogical Agents. Soleymani. Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 7
Logical Agents CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2018 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 7 Wumpus world Wumpus
More informationCSC242: Intro to AI. Lecture 11. Tuesday, February 26, 13
CSC242: Intro to AI Lecture 11 Propositional Inference Propositional Inference Factored Representation Splits a state into variables (factors, attributes, features, things you know ) that can have values
More informationLogic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001
Logic Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001 Last Lecture Games Cont. α-β pruning Outline Games with chance, e.g. Backgammon Logical Agents and thewumpus World
More informationLecture 7: Logical Agents and Propositional Logic
Lecture 7: Logical Agents and Propositional Logic CS 580 (001) - Spring 2018 Amarda Shehu Department of Computer Science George Mason University, Fairfax, VA, USA March 07, 2018 Amarda Shehu (580) 1 1
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Frank Hutter and Bernhard Nebel Albert-Ludwigs-Universität Freiburg
More informationCS 4700: Foundations of Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence Bart Selman selman@cs.cornell.edu Module: Knowledge, Reasoning, and Planning Part 2 Logical Agents R&N: Chapter 7 1 Illustrative example: Wumpus World (Somewhat
More informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationOutline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference
Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 008 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence
More informationOutline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference
Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 007 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence
More informationPrice: $25 (incl. T-Shirt, morning tea and lunch) Visit:
Three days of interesting talks & workshops from industry experts across Australia Explore new computing topics Network with students & employers in Brisbane Price: $25 (incl. T-Shirt, morning tea and
More informationLogical agents. Chapter 7. Chapter 7 1
Logical agents Chapter 7 Chapter 7 1 Outline Knowledge-based agents Logic in general models and entailment Propositional (oolean) logic Equivalence, validity, satisfiability Inference rules and theorem
More informationLogical Agents. Outline
ogical gents Chapter 6, Ie Chapter 7 Outline Knowledge-based agents Wumpus world ogic in general models and entailment ropositional (oolean) logic Equivalence, validity, satisfiability Inference rules
More informationCS 331: Artificial Intelligence Propositional Logic I. Knowledge-based Agents
CS 331: Artificial Intelligence Propositional Logic I 1 Knowledge-based Agents Can represent knowledge And reason with this knowledge How is this different from the knowledge used by problem-specific agents?
More informationDeliberative Agents Knowledge Representation I. Deliberative Agents
Deliberative Agents Knowledge Representation I Vasant Honavar Bioinformatics and Computational Biology Program Center for Computational Intelligence, Learning, & Discovery honavar@cs.iastate.edu www.cs.iastate.edu/~honavar/
More informationKnowledge-based Agents. CS 331: Artificial Intelligence Propositional Logic I. Knowledge-based Agents. Outline. Knowledge-based Agents
Knowledge-based Agents CS 331: Artificial Intelligence Propositional Logic I Can represent knowledge And reason with this knowledge How is this different from the knowledge used by problem-specific agents?
More informationOutline. Logic. Knowledge bases. Wumpus world characteriza/on. Wumpus World PEAS descrip/on. A simple knowledge- based agent
Outline Logic Dr. Melanie Mar/n CS 4480 October 8, 2012 Based on slides from hap://aima.eecs.berkeley.edu/2nd- ed/slides- ppt/ Knowledge- based agents Wumpus world Logic in general - models and entailment
More informationAdversarial Search & Logic and Reasoning
CSEP 573 Adversarial Search & Logic and Reasoning CSE AI Faculty Recall from Last Time: Adversarial Games as Search Convention: first player is called MAX, 2nd player is called MIN MAX moves first and
More informationINF5390 Kunstig intelligens. Logical Agents. Roar Fjellheim
INF5390 Kunstig intelligens Logical Agents Roar Fjellheim Outline Knowledge-based agents The Wumpus world Knowledge representation Logical reasoning Propositional logic Wumpus agent Summary AIMA Chapter
More informationPropositional inference, propositional agents
ropositional inference, propositional agents Chapter 7.5 7.7 Chapter 7.5 7.7 1 Outline Inference rules and theorem proving forward chaining backward chaining resolution Efficient model checking algorithms
More informationPropositional Logic: Methods of Proof. Chapter 7, Part II
Propositional Logic: Methods of Proof Chapter 7, Part II Inference in Formal Symbol Systems: Ontology, Representation, ti Inference Formal Symbol Systems Symbols correspond to things/ideas in the world
More informationLogic and Inferences
Artificial Intelligence Logic and Inferences Readings: Chapter 7 of Russell & Norvig. Artificial Intelligence p.1/34 Components of Propositional Logic Logic constants: True (1), and False (0) Propositional
More informationLogic in AI Chapter 7. Mausam (Based on slides of Dan Weld, Stuart Russell, Dieter Fox, Henry Kautz )
Logic in AI Chapter 7 Mausam (Based on slides of Dan Weld, Stuart Russell, Dieter Fox, Henry Kautz ) Knowledge Representation represent knowledge in a manner that facilitates inferencing (i.e. drawing
More informationPropositional Logic: Methods of Proof (Part II)
Propositional Logic: Methods of Proof (Part II) You will be expected to know Basic definitions Inference, derive, sound, complete Conjunctive Normal Form (CNF) Convert a Boolean formula to CNF Do a short
More informationCSCI 5582 Artificial Intelligence. Today 9/28. Knowledge Representation. Lecture 9
CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin Today 9/28 Review propositional logic Reasoning with Models Break More reasoning Knowledge Representation A knowledge representation is a formal scheme
More informationArtificial Intelligence
Torralba and Wahlster Artificial Intelligence Chapter 10: Propositional Reasoning, Part I 1/46 Artificial Intelligence 10. Propositional Reasoning, Part I: Principles How to Think About What is True or
More informationAI Programming CS S-09 Knowledge Representation
AI Programming CS662-2013S-09 Knowledge Representation David Galles Department of Computer Science University of San Francisco 09-0: Overview So far, we ve talked about search, which is a means of considering
More informationPropositional Logic: Methods of Proof (Part II)
Propositional Logic: Methods of Proof (Part II) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (previous lecture, Part I) Chapter 7.5 (this lecture, Part II) (optional: 7.6-7.8)
More informationAgents that reason logically
Artificial Intelligence Sanguk Noh Logical Agents Agents that reason logically A Knowledge-Based Agent. function KB-Agent (percept) returns an action Tell(KB, Make-Percept-Sentence(percept,t)) action Ask(KB,
More informationA simple knowledge-based agent. Logical agents. Outline. Wumpus World PEAS description. Wumpus world characterization. Knowledge bases.
simple knowledge-based agent ogical agents Chapter 7 function K-gent( percept) returns an action static: K, a knowledge base t, a counter, initially, indicating time Tell(K, ake-ercept-entence( percept,
More informationLogic in AI Chapter 7. Mausam (Based on slides of Dan Weld, Stuart Russell, Subbarao Kambhampati, Dieter Fox, Henry Kautz )
Logic in AI Chapter 7 Mausam (Based on slides of Dan Weld, Stuart Russell, Subbarao Kambhampati, Dieter Fox, Henry Kautz ) 2 Knowledge Representation represent knowledge about the world in a manner that
More informationCOMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati"
COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati" Last week" Main components of PRM" Collision check for a configuration"
More informationChương 3 Tri th ức và lập luận
Chương 3 Tri thức và lập luận Nội dung chính chương 3 Lecture 1 Lecture 2 Lecture 3,4 I. Logic ngôn ngữ của tư duy II. Logic mệnh đề (cú pháp, ngữ nghĩa, sức mạnh biểu diễn, các thuật toán suy diễn) III.
More informationPropositional logic II.
Lecture 5 Propositional logic II. Milos Hauskrecht milos@cs.pitt.edu 5329 ennott quare Propositional logic. yntax yntax: ymbols (alphabet) in P: Constants: True, False Propositional symbols Examples: P
More informationLecture 7: Logic and Planning
Lecture 7: Logic and Planning Planning and representing knowledge Logic in general Propositional (Boolean) logic and its application to planning COMP-424, Lecture 8 - January 30, 2013 1 What is planning?
More informationCOMP219: Artificial Intelligence. Lecture 20: Propositional Reasoning
COMP219: Artificial Intelligence Lecture 20: Propositional Reasoning 1 Overview Last time Logic for KR in general; Propositional Logic; Natural Deduction Today Entailment, satisfiability and validity Normal
More informationPropositional Logic: Logical Agents (Part I)
Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (this lecture, Part I) Chapter 7.5 (next lecture, Part II) Next lecture topic: First-order
More informationPart 1: Propositional Logic
Part 1: Propositional Logic Literature (also for first-order logic) Schöning: Logik für Informatiker, Spektrum Fitting: First-Order Logic and Automated Theorem Proving, Springer 1 Last time 1.1 Syntax
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 31. Propositional Logic: DPLL Algorithm Malte Helmert and Gabriele Röger University of Basel April 24, 2017 Propositional Logic: Overview Chapter overview: propositional
More informationCS 4700: Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence Fall 2017 Instructor: Prof. Haym Hirsh Lecture 12 Prelim Tuesday, March 21 8:40-9:55am Statler Auditorium Homework 2 To be posted on Piazza 4701 Projects:
More informationKnowledge based Agents
Knowledge based Agents Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University Slides prepared from Artificial Intelligence A Modern approach by Russell & Norvig Knowledge Based Agents
More informationInference Methods In Propositional Logic
Lecture Notes, Artificial Intelligence ((ENCS434)) University of Birzeit 1 st Semester, 2011 Artificial Intelligence (ENCS434) Inference Methods In Propositional Logic Dr. Mustafa Jarrar University of
More informationPropositional Logic. Logic. Propositional Logic Syntax. Propositional Logic
Propositional Logic Reading: Chapter 7.1, 7.3 7.5 [ased on slides from Jerry Zhu, Louis Oliphant and ndrew Moore] Logic If the rules of the world are presented formally, then a decision maker can use logical
More informationPropositional Logic: Methods of Proof (Part II)
Propositional Logic: Methods of Proof (Part II) You will be expected to know Basic definitions Inference, derive, sound, complete Conjunctive Normal Form (CNF) Convert a Boolean formula to CNF Do a short
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
More informationInference Methods In Propositional Logic
Lecture Notes, Advanced Artificial Intelligence (SCOM7341) Sina Institute, University of Birzeit 2 nd Semester, 2012 Advanced Artificial Intelligence (SCOM7341) Inference Methods In Propositional Logic
More informationLogic in AI Chapter 7. Mausam (Based on slides of Dan Weld, Stuart Russell, Subbarao Kambhampati, Dieter Fox, Henry Kautz )
Logic in AI Chapter 7 Mausam (Based on slides of Dan Weld, Stuart Russell, Subbarao Kambhampati, Dieter Fox, Henry Kautz ) 2 Knowledge Representation represent knowledge about the world in a manner that
More informationThe Calculus of Computation: Decision Procedures with Applications to Verification. Part I: FOUNDATIONS. by Aaron Bradley Zohar Manna
The Calculus of Computation: Decision Procedures with Applications to Verification Part I: FOUNDATIONS by Aaron Bradley Zohar Manna 1. Propositional Logic(PL) Springer 2007 1-1 1-2 Propositional Logic(PL)
More informationIntroduction to Arti Intelligence
Introduction to Arti Intelligence cial Lecture 4: Constraint satisfaction problems 1 / 48 Constraint satisfaction problems: Today Exploiting the representation of a state to accelerate search. Backtracking.
More informationPropositional Logic: Logical Agents (Part I)
Propositional Logic: Logical Agents (Part I) First Lecture Today (Tue 21 Jun) Read Chapters 1 and 2 Second Lecture Today (Tue 21 Jun) Read Chapter 7.1-7.4 Next Lecture (Thu 23 Jun) Read Chapters 7.5 (optional:
More informationCS 7180: Behavioral Modeling and Decision- making in AI
CS 7180: Behavioral Modeling and Decision- making in AI Review of Propositional Logic Prof. Amy Sliva September 7, 2012 Outline General properties of logics Syntax, semantics, entailment, inference, and
More informationLecture 2 Propositional Logic & SAT
CS 5110/6110 Rigorous System Design Spring 2017 Jan-17 Lecture 2 Propositional Logic & SAT Zvonimir Rakamarić University of Utah Announcements Homework 1 will be posted soon Propositional logic: Chapter
More informationInference in Propositional Logic
Inference in Propositional Logic Deepak Kumar November 2017 Propositional Logic A language for symbolic reasoning Proposition a statement that is either True or False. E.g. Bryn Mawr College is located
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More informationDeductive Systems. Lecture - 3
Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth
More informationCS:4420 Artificial Intelligence
CS:4420 rtificial Intelligence Spring 2018 Logical gents Cesare Tinelli The University of Iowa Copyright 2004 18, Cesare Tinelli and Stuart Russell a a These notes were originally developed by Stuart Russell
More informationLogic & Logic Agents Chapter 7 (& background)
Lecture Notes, Advanced Artificial Intelligence (SCOM7341) Sina Institute, University of Birzeit 2 nd Semester, 2012 Advanced Artificial Intelligence (SCOM7341) Logic & Logic Agents Chapter 7 (& background)
More information