CSC242: Intro to AI. Lecture 11. Tuesday, February 26, 13
|
|
- Theodora Tate
- 5 years ago
- Views:
Transcription
1 CSC242: Intro to AI Lecture 11
2 Propositional Inference
3
4 Propositional Inference
5 Factored Representation Splits a state into variables (factors, attributes, features, things you know ) that can have values Factored states can be more or less similar (unlike atomic states) Can also represent uncertainty (don t know value of some attribute)
6 Constraint Satisfaction Problem (CSP) X: Set of variables { X1,..., Xn } D: Set of domains { D1,..., Dn } Each domain Di = set of values { v1,..., vk } C: Set of constraints { C1,..., Cm }
7 4 Stench Breez e PIT Breez e 3 Stench PIT Breez e Gold 2 Stench Breez e 1 Breez e PIT Breez e START
8 Partially Observable Don t know everything about the state of the world Have to represent uncertainty in our knowledge Have to explore
9 Representation Stench Stench Breez e Stench Gold Breez e Breez e PIT Breez e PIT PIT Breez e Breez e START Boolean[][] P = new Boolean[n][n]; Boolean[][] G = new Boolean[n][n]; Boolean[][] W = new Boolean[n][n]; Boolean[][] At = new Boolean[n][n]; Boolean FacingN, FacingS, FacingE, FacingW; Boolean[][] S = new Boolean[n][n]; Boolean[][] B = new Boolean[n][n];
10 A Programming Language for Knowledge
11 if At[i,j] and S[i,j] then (W[i-1,j] or W[i+1,j] or W[i,j-1] or W[i,j+1]) if At[i,j] and (W[i-1,j] or W[i+1,j] or W[i,j-1] or W[i,j+1]) then S[i,j] Warning: not a real programming language
12 Propositional Logic Aristole (384BC - 332BC) George Boole ( )
13 Syntax Propositional (boolean) variables Connectives: Negation (not, ) Conjunction (and, ) Disjunction (or, ) Implication (if-then, ) Biconditional (if and only if, ) Precedence rules and parentheses
14 Semantics P Q P P Q P Q P Q P Q true true false true true true true false true true false true true false true false false true false false false false false false true true
15 Hungry true false true false Cranky false true true false
16 Possible Worlds Hungry=true, Cranky=false Hungry=false, Cranky=true Hungry=true, Cranky=true Hungry=false, Cranky=false
17 Possible Worlds Hungry=true, Cranky=false Hungry=false, Cranky=true Hungry Cranky Hungry=true, Cranky=true Hungry=false, Cranky=false
18 Possible Worlds Hungry=true, Cranky=false Hungry=false, Cranky=true Hungry Cranky Hungry=true, Cranky=true Hungry=false, Cranky=false
19 A sentence or set of sentences in propositional logic reduces the number of possible worlds by ruling out some of them.
20 Satisfaction B1,1 P1,2 P2,1 P1,2 P2,1 B1,1 (P1,2 P2,1) true true true true true false true true true false true false true true true false false true true false true true false true true false true false true false true false false false false false false false false true
21 Model An assignment that satisfies a sentence or set of sentences A possible world where those sentences are true, and so is not ruled out by them May be how the world actually is
22 Unsatisfiable No complete, consistent assignment of truth values to the propositions that makes the sentence or set of sentences true Rules out all possible worlds Cannot describe the actual world
23 2 n Truth Table B1,1 P1,2 P2,1 P1,2 P2,1 B1,1 (P1,2 P2,1) true true true true true false true true true false true false true true true false false true true false true true false true true false true false true false true false false false false false false false false true
24 DFS for Boolean CSP O(2 n ) O(n) Time Complexity Space Complexity
25
26 Exploration Strategy Choose Update Act Observe
27 Inference Use our knowledge of the world to infer facts that we hadn't directly observed
28 Hungry Cranky Hungry Cranky
29 1,4 2,4 3,4 4,4 1,3 W! 2,3 3,3 4,3 1,2 A 2,2 3,2 4,2 S OK OK 1,1 2,1 B 3,1 P! 4,1 V V OK OK A = Agent B = Breeze G = Glitter, Gold OK = Safe square P = Pit S = Stench V = Visited W = Wumpus (a) P[1][1] = false; W[1][1] = false; B[1][1] = false; S[1][1] = false; W[1][2] = false; P[1][2] = false; W[2][1] = false; P[1][2] = false; B[2][1] = true; S[2][1] = false; B[1][2] = false; S[1][2] = true; W[1][3] = true; P[2][2] = false; P[3][1] = true;
30 Inference What other things are we justified in believing, assuming our background knowledge and perceptions are accurate? What other sentences are true, given our background knowledge and perceptions?
31 Inference Infinite number of sentences of propositional logic, even over a finite set of propositional variables So ask whether a given sentence or set of sentences follows from our knowledge
32 What does it mean to follow from our knowledge?
33 α... P[1,1]=true, B[1,2]=false,... P[1,1]=false, B[1,2]=true,... P[1,1]=false, B[1,2]=false,... P[1,1]=false, B[1,2]=false,
34 α β... P[1,1]=true, B[1,2]=false,... P[1,1]=false, B[1,2]=true,... P[1,1]=false, B[1,2]=false,... P[1,1]=false, B[1,2]=false,
35 α β... P[1,1]=true, B[1,2]=false,... P[1,1]=false, B[1,2]=true,... P[1,1]=false, B[1,2]=false,... P[1,1]=false, B[1,2]=false,
36 α β... P[1,1]=true, B[1,2]=false,... P[1,1]=false, B[1,2]=true,... P[1,1]=false, B[1,2]=false,... P[1,1]=false, B[1,2]=false,
37 α β... P[1,1]=true, B[1,2]=false,... P[1,1]=false, B[1,2]=true,... P[1,1]=false, B[1,2]=false,... P[1,1]=false, B[1,2]=false,
38 Entailment α entails β when: β is true in every world considered possible by α Every model of α is also a model of β Models(α) Models(β)
39 Entailment is conservative Only accept a conclusion that is guaranteed to be true whenever the premises are true
40 Language for expressing knowledge: propositional logic Definition of entailment ( follows from ) Need to be able to compute whether α entails β
41 Model Checking P Q... α... β true true... true... true false true... false... false true false... true... true false false... false... false true true... false... true false true... true... true true false... false... false false false... false... true
42 Propositional Inference
43 Model Checking P Q... α... β true true... true... true false true... false... false true false... true... true false false... false... false true true... false... true false true... true... true true false... false... false false false... false... true
44 Intuition: Math
45 Intuition: Math
46 Intuition: Math x + 3 = 7 x = 7-3 x = 7-3 x = 4
47 Mathematical Identities Allow us to rewrite equations Truth-preserving: If the original equation holds, then so does the rewritten one
48 Inference Rules Look for rules that allow us to rewrite sentences in a truth-preserving way We ll call these inference rules, since they will allow us to do inference (draw conclusions, make implicit knowledge explicit)
49 P Q Q P
50 P Q P Q true true true false true true true false false false false true
51 Entailment α entails β when: β is true in every world considered possible by α Every model of α is also a model of β Models(α) Models(β)
52 { P Q, P } = Q
53 { α β, α } = β
54 Modus Ponens α β, α β
55 Derivation β can be derived from α using inference rules `
56 Properties of Inference Rules
57 Soundness Derives only logically entailed sentences Truth-preserving if ` then =
58 Completeness Derives all logically entailed sentences if = then `
59 Inference Rules ^ ( ) ( ) And-elimination Double negation DeMorgan s Laws ),, ( ) ) ^ ( ) ) ( ) ) ^ ( ) ), Modus Ponens Definition of biconditional
60 Want to compute whether = For a sound inference rule: if ` then = ` ` if and then =
61 Proof Sequence of sound inference rule applications that lead from the premises to the desired conclusion
62 Background knowledge: R 1 : P 1,1 R 2 : B 1,1, (P 1,2 _ P 2,1 ) R 3 : B 2,1, (P 1,1 _ P 2,2 _ P 3,1 ) Perceptions: R 4 : B 1,1 R 5 : B 2,1 Biconditional elimination on R2: R 6 :((B 1,1 ) (P 1,2 _ P 2,1 ) ^ ((P 1,2 _ P 2,1 ) ) B 1,1 ) And-elimination on R6: R 7 :(P 1,2 _ P 2,1 ) ) B 1,1 Logical equivalence for contrapositives: R 8 : B 1,1 (P 1,2 P 2,1 ) Modus Ponens on R8 and R4: R 9 : (P 1,2 P 2,1 ) DeMorgan s Rule: And-elimination on R10: R 10 : P 1,2 P 2,1 R 11 : P 1,2
63 Propositional Inference As Search Initial state: Set of facts (initial knowledge base) Actions: Apply an inference rule to the sentences that match their premises Result: Add conclusions of inference rule to knowledge base Goal: The knowledge base contains the sentence we want to prove
64 Theorem Proving Searching for proofs is an alternative to enumerating models In many practical cases, finding a proof can be more efficient because the proof can ignore irrelevant propositions, no matter how many of them there are.
65
66 Propositional Inference Entailment: follows from our knowledge Model checking Inference rules: soundness, completeness Proof: search for sequence of sound inference rules from premises to conclusion
67 Propositional Inference As Search Initial state: Set of facts (initial knowledge base) Actions: Apply an inference rule to the sentences that match their premises Result: Add conclusions of inference rule to knowledge base Goal: The knowledge base contains the sentence we want to prove
68 Inference Rules ^ ( ) ( ) And-elimination Double negation DeMorgan s Laws ),, ( ) ) ^ ( ) ) ( ) ) ^ ( ) ), Modus Ponens Definition of biconditional
69 Hungry Cranky Hungry Cranky
70 1,4 2,4 3,4 4,4 1,3 W! 2,3 3,3 4,3 1,2 A 2,2 P? 3,2 4,2 S OK OK 1,1 2,1 B 3,1 P? P! 4,1 V V OK OK (a) A = Agent B = Breeze G = Glitter, Gold OK = Safe square P = Pit S = Stench V = Visited W = Wumpus P 1,1 _ P 2,2 _ P 3,1 P 1,1 P 2,2 _ P 3,1 P 2,2 P 3,1
71 If A or B is true and you know it s not A, then it must be B
72 Literals Literal: propositional variable (P) or negation of propositional variable ( Q) Complementary literals: one literal is the negation of another (P, P)
73 Clauses Clause: disjunction of literals: P Q R P Unit clause: a single literal: P Q
74 Unit Resolution Clause Clause l 1 l i l k, m l 1 l i 1 l i+1 l k l 1,..., l k and m are literals li and m are complementary Unit Clause Complementary literals: Positive literal: P Negative literal: P
75 Hungry Cranky Hungry Cranky
76 1,4 2,4 3,4 4,4 1,3 W! 2,3 3,3 4,3 1,2 A 2,2 P? 3,2 4,2 S OK OK 1,1 2,1 B 3,1 P? P! 4,1 V V OK OK (a) A = Agent B = Breeze G = Glitter, Gold OK = Safe square P = Pit S = Stench V = Visited W = Wumpus P 1,1 _ P 2,2 _ P 3,1 P 1,1 P 2,2 _ P 3,1 P 2,2 P 3,1
77 Unit Resolution Sound: if ` then = Not complete: if = then `
78 Resolution l 1 l i l k, m 1 m j m n l 1 l i 1 l i+1 l k m 1 m j 1 m j+1 m n l 1,..., l k, m 1,..., m n are literals li and mj are complementary Technical note: Resulting clause must be factored to contain only one copy of each literal.
79 P 1,1 P 3,1, P 1,1 P 2,2 P 3,1 P 2,2
80 1. Hungry Cranky 2. Sleepy Hungry 3. Cranky Sleepy 4. Sleepy Cranky (1,2) 5. Cranky Cranky (3,4) 6. Cranky (factoring)
81 Resolution Sound: if ` then = Easy to show Complete: if = then ` Proof by contradiction (see book)
82 Resolution l 1 l i l k, m 1 m j m n l 1 l i 1 l i+1 l k m 1 m j 1 m j+1 m n l 1,..., l k, m 1,..., m n are literals li and mj are complementary Technical note: Resulting clause must be factored to contain only one copy of each literal.
83 A B P Q (A B) (B C)
84 Conjunctive Normal Form (CNF) Eliminate : α β α β β α Eliminate : α β α β Move negation in: α α (α β) ( α β) (α β) ( α β) Distribute over : (α (β γ)) ((α β ) (α γ))
85 A B P Q (A B) (B C) A B P Q (A B) (B C) A, B P Q ( A B) ( B C) ( A B) ( A C) ( B B) ( B C) ( A B) ( A C) B ( B C) ( A B), ( A C), B, ( B C)
86 Inference Using Resolution Convert sentences (KB) to CNF (set of clauses) Apply resolution inference rule to pairs of clauses with complementary literals Add resulting clause to set of clauses Until...
87 Proof by Contradiction = if and only if ( ) is unsatisfiable If negation of goal is inconsistent with our knowledge Then the goal itself is entailed by our knowledge
88 Resolution Refutation Convert (KB α) to CNF Apply resolution rule until: No new clauses can be added KB does not entail α Two clauses resolve to yield the empty clause KB entails α
89 Proof Using Resolution Proof by contradiction Derive empty clause from (KB α) (converted to CNF, of course)
90 Effective Resolution Definite clauses Disjunction of literals with exactly one positive literal Horn clauses Disjunction of literals with at most one positive literal Natural reading as facts and if-then rules
91 Forward Chaining Knowledge base of definite clauses: facts and rules If premises of a rule (conjunction of literals) are known Add its conclusion (single literal) to set of known facts Until either query is added or no further inferences can be made
92 Backward Chaining Work backward from query q If q is known to be true, we are done Otherwise find all rules whose conclusion (head) is q If all the premises (body) of one of those rules can be proven true, then q is true
93 Effective Resolution Definite clauses Disjunction of literals with exactly one positive literal Horn clauses Disjunction of literals with at most one positive literal Natural reading as facts and if-then rules
94 Propositional Inference Entailment: follows from our knowledge Model checking Intractable But see also AIMA 7.6 & Project 2
95 Propositional Inference Inference rules: soundness, completeness Searching for proofs is an alternative to enumerating models May be faster in practice
96 Propositional Inference Resolution is a sound and complete inference rule Works on clauses (CNF) Special cases: Definite & Horn clauses Forward and backward chaining
97 Project 2: Logical Sudoku Formulate sudoku using logic Write a program that inputs a sudoku and outputs its logical representation Solve the puzzle using an inference engine Which you don t have to write... Write a program that outputs the solution of the sudoku nicely Due: Mon 4 Mar 23:00
98 For next time: AIMA ; fyi Quiz on PL
Outline. 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 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 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 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 informationProof 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 (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 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 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 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 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 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 informationThe Wumpus Game. Stench Gold. Start. Cao Hoang Tru CSE Faculty - HCMUT
The Wumpus Game Stench Stench Gold Stench Start 1 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
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 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 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 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 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. 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationPropositional and First-Order Logic
Propositional and First-Order Logic Chapter 7.4 7.8, 8.1 8.3, 8.5 Some material adopted from notes by Andreas Geyer-Schulz and Chuck Dyer Logic roadmap overview Propositional logic (review) Problems with
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 informationPropositional Logic Part 1
Propositional Logic Part 1 Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [Based on slides from Louis Oliphant, Andrew Moore, Jerry Zhu] slide 1 5 is even
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: 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 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) 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 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 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 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 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 informationArtificial Intelligence Knowledge Representation I
Artificial Intelligence Knowledge Representation I Agents that reason logically knowledge-based approach implement agents that know about their world and reason about possible courses of action needs to
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 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 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 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 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 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 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 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 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 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 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 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 informationCOMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning
COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms
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 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 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 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 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 informationPropositional Logic: Review
Propositional Logic: Review Propositional logic Logical constants: true, false Propositional symbols: P, Q, S,... (atomic sentences) Wrapping parentheses: ( ) Sentences are combined by connectives:...and...or
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 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 informationCSC242: Intro to AI. Lecture 13. Thursday, February 28, 13
CSC242: Intro to AI Lecture 13 Recap Rooms adjacent to pits will have breezes Socrates is a person All people are mortal Anybody s grandmother is either their mother s or their father s mother Elements
More informationLanguage of Propositional Logic
Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called
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 information7.5.2 Proof by Resolution
137 7.5.2 Proof by Resolution The inference rules covered so far are sound Combined with any complete search algorithm they also constitute a complete inference algorithm However, removing any one inference
More informationInference in first-order logic
CS 2710 Foundations of AI Lecture 15 Inference in first-order logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Logical inference in FOL Logical inference problem: Given a knowledge base KB
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 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 informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
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 informationIntroduction Logic Inference. Discrete Mathematics Andrei Bulatov
Introduction Logic Inference Discrete Mathematics Andrei Bulatov Discrete Mathematics - Logic Inference 6-2 Previous Lecture Laws of logic Expressions for implication, biconditional, exclusive or Valid
More information20/c/applet/more.html Local Beam Search The best K states are selected.
Have some fun Checker: http://www.cs.caltech.edu/~vhuang/cs 20/c/applet/more.html 1 Local Beam Search Run multiple searches to find the solution The best K states are selected. Like parallel hill climbing
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 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 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 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 informationCSC242: Intro to AI. Lecture 12. Tuesday, February 26, 13
CSC242: Intro to AI Lecture 12 Quiz Stop Time: 2:15 ULW First draft due Mar 1 8-10 pages minimum First-Order Logic First-Order Logic Propositional Logic Syntax & Semantics Truth tables Model checking
More informationLecture Overview [ ] Introduction to Artificial Intelligence COMP 3501 / COMP Lecture 6. Motivation. Logical Agents
Lecture Overview [7.1-7.4] COMP 3501 / COMP 4704-4 Lecture 6 Prof. JGH 318 Logical Agents Wumpus World Propositional Logic Inference Theorem Proving via model checking Motivation Existing techniques help
More informationPropositional Resolution
Computational Logic Lecture 4 Propositional Resolution Michael Genesereth Spring 2005 Stanford University Modified by Charles Ling and TA, for CS2209 Use with permission Propositional Resolution Propositional
More information