Last update: March 4, Logical agents. CMSC 421: Chapter 7. CMSC 421: Chapter 7 1
|
|
- Emmeline Collins
- 5 years ago
- Views:
Transcription
1 Last update: March 4, 00 Logical agents CMSC 4: Chapter 7 CMSC 4: Chapter 7
2 Outline Knowledge-based agents Wumpus world Logic in general models and entailment Propositional (oolean) logic Equivalence, validity, satisfiability Inference rules and theorem proving forward chaining backward chaining resolution CMSC 4: Chapter 7
3 Knowledge bases Inference engine domain independent algorithms Knowledge base domain specific content Knowledge base = set of sentences in a formal language Declarative approach to building an agent (or other system): Tell it what it needs to know Then it can sk itself what to do answers should follow from the K gents can be viewed at the knowledge level i.e., what they know, regardless of how implemented Or at the implementation level i.e., data structures in K and algorithms that manipulate them CMSC 4: Chapter 7 3
4 simple knowledge-based agent function K-gent( percept) returns an action static: K, a knowledge base t, a counter, initially 0, indicating time Tell(K, Make-Percept-Sentence( percept, t)) action sk(k, Make-ction-Query(t)) Tell(K, Make-ction-Sentence(action, t)) t t + return action The agent must be able to: Represent states, actions, etc. Incorporate new percepts Update internal representations of the world Deduce hidden properties of the world Deduce appropriate actions CMSC 4: Chapter 7 4
5 Wumpus World PES description Environment: One wumpus, one heap of gold P (pit) = 0. for each square Squares net to wumpus are smelly Shooting into wumpus s square kills it Shooting uses up the only arrow Squares net to pit are breezy Glitter iff the gold is in your square Grabbing picks it up Releasing drops it 4 3 Stench Stench STRT reeze Stench Gold reeze reeze reeze reeze reeze 3 4 Performance measure: gold +000, death 000, per step, 0 for using the arrow ctuators: Left turn, Right turn, Forward, Grab, Release, Shoot Sensors: reeze, Glitter, Smell CMSC 4: Chapter 7 5
6 Fully observable? Wumpus world characterization CMSC 4: Chapter 7 6
7 Wumpus world characterization Fully observable? No only local perception Deterministic? CMSC 4: Chapter 7 7
8 Wumpus world characterization Fully observable? No only local perception Deterministic? Yes outcomes eactly specified Episodic? CMSC 4: Chapter 7 8
9 Wumpus world characterization Fully observable? No only local perception Deterministic? Yes outcomes eactly specified Episodic? No sequential at the level of actions Static? CMSC 4: Chapter 7 9
10 Wumpus world characterization Fully observable? No only local perception Deterministic? Yes outcomes eactly specified Episodic? No sequential at the level of actions Static? Yes Wumpus, pits, and gold do not move Discrete? CMSC 4: Chapter 7 0
11 Wumpus world characterization Fully observable? No only local perception Deterministic? Yes outcomes eactly specified Episodic? No sequential at the level of actions Static? Yes Wumpus, pits, and gold do not move Discrete? Yes Single-agent? CMSC 4: Chapter 7
12 Wumpus world characterization Fully observable? No only local perception Deterministic? Yes outcomes eactly specified Episodic? No sequential at the level of actions Static? Yes Wumpus, pits, and gold do not move Discrete? Yes Single-agent? Yes Wumpus is essentially a natural feature CMSC 4: Chapter 7
13 Eploring a wumpus world CMSC 4: Chapter 7 3
14 Eploring a wumpus world CMSC 4: Chapter 7 4
15 Eploring a wumpus world P? P? CMSC 4: Chapter 7 5
16 Eploring a wumpus world P? P? S CMSC 4: Chapter 7 6
17 Eploring a wumpus world P P? P? S W CMSC 4: Chapter 7 7
18 Eploring a wumpus world P P? P? S W CMSC 4: Chapter 7 8
19 Eploring a wumpus world P P? P? S W CMSC 4: Chapter 7 9
20 Eploring a wumpus world P P? P? GS S W CMSC 4: Chapter 7 0
21 Other tight spots P? reeze in (,) and (,) no safe actions P? P? P(pit in (,)) 0.86 P(pits in (,3) and (3,)) 0.3 P? In a later chapter we ll see how to compute this S Smell in (,) cannot move safely Can use a strategy of coercion: shoot straight ahead wumpus was there dead safe wumpus wasn t there safe CMSC 4: Chapter 7
22 Logic in general Logics are formal languages for representing information such that conclusions can be drawn Synta defines the sentences in the language Semantics define the meaning of sentences; i.e., define truth of a sentence in a world E.g., the language of arithmetic + y is a sentence; + y > is not a sentence + y is true iff the number + is at least as big as the number y + y is true in a world where = 7, y = + y is false in a world where = 0, y = 6 CMSC 4: Chapter 7
23 Entailment Entailment means that one thing follows from another: K = α Knowledge base K entails sentence α if and only if α is true in all worlds where K is true E.g., if a K contains Maryland won and Duke won, the K entails Maryland won or* Duke won E.g., + y = 4 entails 4 = + y Entailment is a relationship between sentences (i.e., synta) that is based on semantics Note: brains process synta (of some sort) *The or is inclusive, not eclusive. CMSC 4: Chapter 7 3
24 Models model is a formally structured world in which truth can be evaluated We say m is a model of a sentence α if α is true in m M(α) is the set of all models of α Then K = α if and only if M(K) M(α) E.g. K = Maryland won and Duke won α = Maryland won M( ) M(α) M(K) M(K) CMSC 4: Chapter 7 4
25 Entailment in the wumpus world Situation after detecting nothing in [,], moving right, breeze in [,] For now, ignore the wumpus and gold. Which of the?s are pits? For each possible combination of pit locations, check whether it s a model. 3 oolean choices 8 possible models??? CMSC 4: Chapter 7 5
26 Wumpus models reeze reeze 3 3 reeze 3 reeze 3 reeze 3??? reeze 3 reeze 3 reeze 3 K = wumpus-world rules + observations Eight possible combinations of pit locations: which ones are models of K? CMSC 4: Chapter 7 6
27 Wumpus models reeze reeze K 3 3 reeze 3 reeze 3 reeze 3??? reeze 3 reeze 3 reeze 3 K = wumpus-world rules + observations Three models CMSC 4: Chapter 7 7
28 Wumpus models reeze reeze K 3 3 reeze 3 reeze 3 reeze 3??? reeze 3 reeze 3 reeze 3 K = wumpus-world rules + observations α = [,] is safe, K = α, proved by model checking CMSC 4: Chapter 7 8
29 Wumpus models reeze reeze K 3 3 reeze 3 reeze 3 reeze 3??? reeze 3 reeze 3 reeze 3 K = wumpus-world rules + observations CMSC 4: Chapter 7 9
30 Wumpus models K reeze 3 reeze 3 reeze 3 reeze 3 reeze 3??? reeze 3 reeze 3 reeze 3 K = wumpus-world rules + observations α = [,] is safe, K = α CMSC 4: Chapter 7 30
31 Inference K i α = sentence α can be derived from K by procedure i Consequences of K are a haystack; α is a needle. Entailment = needle in haystack; inference = finding it Soundness: i is sound if whenever K i α, it is also true that K = α Completeness: i is complete if whenever K = α, it is also true that K i α Model checking (what we just did) is one kind of inference procedure, but not the only one Model checking is sound Model checking is complete if the set of all possible models is finite CMSC 4: Chapter 7 3
32 Preview of where we re going Later, we ll define a logic (first-order logic) which is epressive enough to say almost anything of interest, and for which there eists a sound and complete inference procedure. That is, the procedure will answer any question whose answer follows from what is known by the K. ut first, let s look at propositional logic. CMSC 4: Chapter 7 3
33 Propositional logic: Synta Propositional logic is the simplest logic illustrates basic ideas The proposition symbols P, P etc are sentences If S is a sentence, S is a sentence (negation) If S and S are sentences, S S is a sentence (conjunction) If S and S are sentences, S S is a sentence (disjunction) If S and S are sentences, S If S and S are sentences, S S is a sentence (implication) S is a sentence (biconditional) CMSC 4: Chapter 7 33
34 Propositional logic: Semantics Each model specifies a true/false value for every proposition symbol E.g. P, P, P 3, true true f alse (8 possible models, can be enumerated automatically) Rules for evaluating truth with respect to a model m: S is true iff S is false S S is true iff S is true and S is true S S is true iff S is true or S is true S S is true iff S is false or S is true i.e., is false iff S is true and S is false S S is true iff S S is true and S S is true Simple recursive process evaluates an arbitrary sentence, e.g., P, (P, P 3, ) = true (false true) = true true = true CMSC 4: Chapter 7 34
35 Truth tables for connectives P Q P P Q P Q P Q P Q false false true false false true true false true true false true true false true false false false true false false true true false true true true true CMSC 4: Chapter 7 35
36 Wumpus world sentences Let P i,j be true if there is a pit in [i, j]. Let i,j be true if there is a breeze in [i, j]. P,,, Pits cause breezes in adjacent squares CMSC 4: Chapter 7 36
37 Wumpus world sentences Let P i,j be true if there is a pit in [i, j]. Let i,j be true if there is a breeze in [i, j]. P,,, Pits cause breezes in adjacent squares, (P, P, ), (P, P, P 3, ) square is breezy if and only if there is an adjacent pit CMSC 4: Chapter 7 37
38 Truth tables for inference,, P, P, P, P, P 3, K α false false false false false false false false don t care false. false. false. false. false. false. true. false. don t care. false true false false false false false false don t care false true false false false false true true true false true false false false true false true true false true false false false true true true true false. true. false. false. true. false. false. false. don t care. true true true true true true true false don t care Model checking in propositional logic = inference using truth tables Each row is a potential model: an assignment of truth values to symbols if K is true in row, is α true too? CMSC 4: Chapter 7 38
39 Inference by enumeration Depth-first enumeration of all models is sound and complete function TT-Entails?(K, α) returns true or false inputs: K, the knowledge base, a sentence in propositional logic α, the query, a sentence in propositional logic symbols a list of the proposition symbols in K and α return TT-Check-ll(K, α, symbols, [ ]) function TT-Check-ll(K, α, symbols, model) returns true or false if Empty?(symbols) then if PL-True?(K, model) then return PL-True?(α, model) else return true else do P First(symbols); rest Rest(symbols) return TT-Check-ll(K, α, rest, Etend(P, true, model)) and TT-Check-ll(K, α, rest, Etend(P, false, model)) O( n ) for n symbols; problem is co-np-complete CMSC 4: Chapter 7 39
40 Logical equivalence Two sentences are logically equivalent iff true in same models: α β if and only if α = β and β = α (α β) (β α) commutativity of (α β) (β α) commutativity of ((α β) γ) (α (β γ)) associativity of ((α β) γ) (α (β γ)) associativity of ( α) α double-negation elimination (α β) ( β α) contraposition (α β) ( α β) implication elimination (α β) ((α β) (β α)) biconditional elimination (α β) ( α β) De Morgan (α β) ( α β) De Morgan (α (β γ)) ((α β) (α γ)) distributivity of over (α (β γ)) ((α β) (α γ)) distributivity of over CMSC 4: Chapter 7 40
41 Validity and satisfiability sentence is valid if it is true in all models, e.g., T rue,,, ( ( )) Validity is connected to inference via the Deduction Theorem: K = α if and only if (K α) is valid sentence is satisfiable if it is true in at least one model e.g.,, C sentence is unsatisfiable if it is true in no models e.g., Satisfiability is connected to inference via the following: K = α if and only if (K α) is unsatisfiable i.e., prove α by reductio ad absurdum CMSC 4: Chapter 7 4
42 Proof methods Proof methods divide into (roughly) two kinds: pplication of inference rules Legitimate (sound) generation of new sentences from old Proof = a sequence of inference rule applications Can use inference rules as operators in a standard search alg. Typically require translation of sentences into a normal form Model checking truth table enumeration (always eponential in n) improved backtracking, e.g., Davis Putnam Logemann Loveland heuristic search in model space (sound but incomplete) e.g., min-conflicts-like hill-climbing algorithms CMSC 4: Chapter 7 4
43 Forward and backward chaining Horn Form K = conjunction of Horn clauses Horn clause = proposition symbol; or (conjunction of symbols) symbol E.g., C ( ) (C D ) This is a restricted subset of propositional logic e.g., the following is not a Horn clause, and can t be translated into one: Modus Ponens (for Horn Form): complete for Horn Ks α,..., α n, α α n β β Can be used with forward chaining or backward chaining. These algorithms are very natural and run in linear time CMSC 4: Chapter 7 43
44 Forward chaining Idea: fire any rule whose premises are satisfied in the K, add its conclusion to the K, until query is found P Q L M P L M P L L L Q P M CMSC 4: Chapter 7 44
45 Forward chaining algorithm function PL-FC-Entails?(K, q) returns true or false inputs: K, the knowledge base, a set of propositional Horn clauses q, the query, a proposition symbol local variables: count(c), number of c s premises not yet inferred inferred(c), whether or not c has been inferred agenda, {all clauses that are ready to be inferred} while agenda is not empty do p Pop(agenda) unless inferred[p] do inferred[p] true for each Horn clause c in whose premise p appears do decrement count[c] if count[c] = 0 then do if Head[c] = q then return true Push(Head[c], agenda) return false CMSC 4: Chapter 7 45
46 Forward chaining eample Q P Q L M P L M P L L P M L CMSC 4: Chapter 7 46
47 Forward chaining eample Q P Q L M P L M P L L P M L CMSC 4: Chapter 7 47
48 Forward chaining eample Q P Q L M P L M P L L P L M 0 CMSC 4: Chapter 7 48
49 Forward chaining eample Q P Q L M P L M P L L P L M 0 0 CMSC 4: Chapter 7 49
50 Forward chaining eample Q P Q L M P L M P L L P 0 L M 0 0 CMSC 4: Chapter 7 50
51 Forward chaining eample Q 0 P Q L M P L M P L L 0 P 0 L M 0 0 CMSC 4: Chapter 7 5
52 Forward chaining eample Q 0 P Q L M P L M P L L 0 P 0 L M 0 0 CMSC 4: Chapter 7 5
53 Forward chaining eample Q 0 P Q L M P L M P L L 0 P 0 L M 0 0 CMSC 4: Chapter 7 53
54 Proof of completeness FC derives every atomic sentence that is entailed by K. t i th iteration of the while loop, can create a world m i as follows: assign true to every atomic symbol that has been derived assign false to all other atomic symbols.. There are only finitely many atomic sentences, so FC must reach a fied point where no new atomic sentences are derived. Let n be the iteration where this happens. 3. Every clause in the original K is true in m n Proof: Suppose a clause a... a k b is false in m i. Then a... a k is true in m i and b is false in m i. Thus count(b) = 0, so b will be inferred in a future iteration, so iteration i isn t a fied point. Hence at the fied point, m n is a model of K. 5. If q is atomic and K = q, then q is true in every model of K, including m. Hence FC must have derived q. CMSC 4: Chapter 7 54
55 ackward chaining Idea: work backwards from the query q: to prove q by C, check if q is known already, or recursively call C to prove all premises of some rule concluding q void loops: check if new subgoal is already on the recursion stack void repeated work: check if new subgoal ) has already been proved true, or ) has already failed CMSC 4: Chapter 7 55
56 ackward chaining eample Q P Q L M P L M P L L L P M CMSC 4: Chapter 7 56
57 ackward chaining eample Q P Q L M P L M P L L L P M CMSC 4: Chapter 7 57
58 ackward chaining eample Q P Q L M P L M P L L L P M CMSC 4: Chapter 7 58
59 ackward chaining eample Q P Q L M P L M P L L L P M CMSC 4: Chapter 7 59
60 ackward chaining eample Q P Q L M P L M P L L L P M CMSC 4: Chapter 7 60
61 ackward chaining eample Q P Q L M P L M P L L L P M CMSC 4: Chapter 7 6
62 ackward chaining eample Q P Q L M P L M P L L L P M CMSC 4: Chapter 7 6
63 ackward chaining eample Q P Q L M P L M P L L L P M CMSC 4: Chapter 7 63
64 ackward chaining eample Q P Q L M P L M P L L L P M CMSC 4: Chapter 7 64
65 ackward chaining eample Q P Q L M P L M P L L L P M CMSC 4: Chapter 7 65
66 ackward chaining eample Q P Q L M P L M P L L L P M CMSC 4: Chapter 7 66
67 Forward vs. backward chaining FC is data-driven data-driven algorithms can be used for automatic, unconscious processing, e.g., object recognition, routine decisions May do lots of work that is irrelevant to the goal C is goal-driven, appropriate for problem-solving, e.g., Where are my keys? How do I get into a PhD program? Compleity of C can be much less than linear in size of K CMSC 4: Chapter 7 67
68 Resolution Conjunctive Normal Form (CNF): conjunction of disjunctions of literals }{{} clauses E.g., ( ) ( C D) Resolution inference rule: If l i and m j are negations of each other, l l i l k, m m j m n l l i l i+ l k m m j m j+ m n i.e., the disjunct of everything other than l i and m j Eample: P,3 P,, P, P,3 P P? P? S W CMSC 4: Chapter 7 68
69 Resolution Resolution is equivalent to Modus Ponens: clauses from CNF: C D rewrite as implications: C D apply modus ponens: C D rewrite as clauses: C D Resolution is sound and complete for propositional logic ut to use it, you need to convert all your propositional statements to CNF CMSC 4: Chapter 7 69
70 Conversion to CNF There s a breeze in (,) iff there s a pit in (,) or (,):, (P, P, ). Eliminate, by replacing α β with (α β) (β α). (, (P, P, )) ((P, P, ), ). Eliminate, by replacing α β with α β. (, P, P, ) ( (P, P, ), ) 3. Move inwards using de Morgan s rules and double-negation: (, P, P, ) (( P, P, ), ) 4. pply distributivity law ( over ) and flatten: (, P, P, ) ( P,, ) ( P,, ) CMSC 4: Chapter 7 70
71 Resolution algorithm Proof by contradiction: to prove K α, show K α is unsatisfiable function PL-Resolution(K, α) returns true or false inputs: K, the knowledge base, a sentence in propositional logic α, the query, a sentence in propositional logic clauses the set of clauses in the CNF representation of K α new { } loop do ;; compute all possible resolvents from clauses, and add them to clauses for each C i, C j in clauses do resolvents PL-Resolve(C i, C j ) if resolvents contains the empty clause then return true new new resolvents if new clauses then return false clauses clauses new CMSC 4: Chapter 7 7
72 Resolution eample K: there s a breeze in (,) iff there s a pit in (,) or (,); and there s no breeze in (,) K = (, (P, P, )), = (, P, P, ) ( P,, ) ( P,, ), α = P, we want to show there s no pit in (,) α = P, suppose there is one (for proof by contradiction) CMSC 4: Chapter 7 7
73 Summary Logical agents apply inference to a knowledge base to derive new information and make decisions asic concepts of logic: synta: formal structure of sentences semantics: truth of sentences wrt models entailment: necessary truth of one sentence given another inference: deriving sentences from other sentences soundess: derivations produce only entailed sentences completeness: derivations can produce all entailed sentences Wumpus world requires the ability to represent partial and negated information, reason by cases, etc. Forward, backward chaining are linear-time, complete for Horn clauses Resolution is complete for propositional logic Propositional logic lacks epressive power CMSC 4: Chapter 7 73
Logical 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 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 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 1 Outline Knowledge-based agents Logic in general models and entailment Propositional (oolean) logic Equivalence, validity, satisfiability Inference rules and theorem
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 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. 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 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 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. 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 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 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 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: 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 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. 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 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 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 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 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 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 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 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 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 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 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 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 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 380: ARTIFICIAL INTELLIGENCE LOGICAL AGENTS. Santiago Ontañón
CS 380: RTIFICIL INTELLIGENCE LOGICL GENTS Santiago Ontañón so367@dreel.edu Summary so far: What is I? Rational gents Problem solving: Systematic search Uninformed search: DFS, BFS, ID Informed search:
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 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 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 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 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 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 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 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 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: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 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 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 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 (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 007 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence
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 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 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: 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 & 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 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 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 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 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 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 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 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 & Logic Agents Chapter 7 (& Some background)
Lecture Notes on Logic & Logic Agents University of Birzeit, Palestine 2013 Artificial Intelligence Logic & Logic Agents Chapter 7 (& Some background) Dr. Mustafa Jarrar Sina Institute, University of Birzeit
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 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 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 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 informationCS 2710 Foundations of AI Lecture 12. Propositional logic. Logical inference problem
CS 2710 Foundations of I ecture 12 ropositional logic ilos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square ogical inference problem ogical inference problem: Given: a knowledge base K (a set of sentences)
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
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 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 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 informationLogical Agents. September 14, 2004
Logical Agents September 14, 2004 The aim of AI is to develop intelligent agents that can reason about actions and their effects and about the environment, create plans to achieve a goal, execute the plans,
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 informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationKnowledge- Based Agents. Logical Agents. Knowledge Base. Knowledge- Based Agents 10/7/09
Knowledge- Based Agents Logical Agents CISC481/681, Lecture #8 Ben Cartere>e A knowledge- based agent has a base of knowledge about the world It uses that base to make new inferences about the world From
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 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 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 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 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 information