COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati"
|
|
- Lesley Simmons
- 5 years ago
- Views:
Transcription
1 COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati"
2 Last week" Main components of PRM" Collision check for a configuration" Collision check for a line segment" Sampling strategy" 2
3 Once the state graph is constructed," Given an initial & a goal configurations," Find the vertex q i nearest to the initial configuration, where the straight line segment between initial configuration & q i is collision free." Find the vertex q g nearest to the goal configuration, where the straight line segment between goal configuration & q g is collision free." Find a path from q i to q g using the search algorithms we have discussed (blind/informed search)." When is the state graph construction done? i.e., whatʼs the stopping criteria? Use time limit or interleave" 3
4 Today" Sampling-based approach without state graph" EST" RRT" Why sampling-based approach works?" 4
5 We donʼt always need to construct the state graph explicitly" Build a search tree directly." Expansive Space Tree (EST)" Set the initial configuration as a root node." Repeat" Select a node q to expand with probability 1/N(q), where N(q) is #nodes in the tree that are within D distance from q." Sample a configuration qʼ uniformly at random from all possible configurations within D distance from q. " If qʼ is collision-free and the straight line segment between q and qʼ is collision-free, add qʼ as a child node of q. " Usually bidirectional search." 5
6 A different sampling strategy" Rapidly exploring Random Trees (RRT)" Set the initial configuration as a root node." Repeat" Sample a configuration q uniformly at random from the configuration space." Find a node nearest to q. Suppose this node is qʼ. " Find a configuration q new in line segment qʼq, such that the line segment qʼq new lies entirely in the free space and the distance between qʼ and q new is less than D." Add q new as a child node of qʼ in the tree. " Usually bidirectional search." 6
7 Today" Sampling-based approach without state graph" EST" RRT" Why sampling-based approach works?" 7
8 From toy problems to real world problems" Workspace 8
9 Why Sampling-based Approaches work? (Intuitively)" Abundant solutions." To solve the problem, we only need to find one of the solutions" C-space" G I" 9
10 Why Sampling-based Approaches work? " In most free spaces of real world problems, every configuration sees a significant fraction of the free space" A configuration q sees another configuration qʼ whenever the straight line segment between q & qʼ lies entirely in the free space. " A relatively small number of vertices & edges are sufficient to cover most free spaces with high probability, and hence solve the given queries." 10 C-space"
11 Slightly more formal" C-space" F 1! F 2! The lookout of a subset F 1 of the free space is the set of all configurations in F 1 from which it is possible to see a significant fraction of the free space outside F 1." β-lookout(f 1 ): The set of configurations in F 1 from which it is possible to see β fraction of the free space outside F 1. " 11
12 Slightly more formal" C-space" F 1! F 2! 12 The free space F is expansive if all of its subsets have a large lookout" F is αβ-expansive if for any connected subset F i of F, " "Vol(β-lookout(F i )) αvol(f i )." The number of samples to capture the correct connectivity of the free space with probability at least P is inversely proportional to α, β, and (1-P)." PRM (and its variants) performs well when the free space of the problem has large α and β."
13 Which one is easier to solve by samplingbased approaches?" C-space" C-space" 13
14 Slightly more formal Notes " If we know α and β of the free space, we can compute the number of samples to solve a given problem with high probability." But, to compute α and β, we need the geometry of the free space. " PRM is successful exactly because itʼs not computing the geometry of the free space." Practically, we donʼt know α and β, nor the exact #samples to use." So, why bother? " Sometimes, we can guess α and β from the workspace know when to use PRM and when not." Guarantees that we will eventually get a solution (if a solution exists)." 14
15 Narrow passages problem" The set of valid solutions is much smaller compared to the set of all possible solutions. " When the problem is likely to occur?" Cluttered environments" High dimensional C-space" C-space" 15
16 Today" Sampling-based approach without state graph" EST" RRT" Why sampling-based approach works?" 16
17 COMP3702/7702 Artificial Intelligence Week 5: Logic (Russell & Norvig ch. 7)" Hanna Kurniawati"
18 Today" What is logic?" Propositional logic: Syntax & Semantics" Example of using logic to represent a problem" Two types of problems:" Validity" Satisfiability" 18
19 What is logic?" A formal language to represent sets of states" A convenient abstraction for dealing with many states." Recall in PRM: We can view a vertex in a roadmap to represent a set of nearby states." Regardless of whether thereʼs a natural notion of near or not (i.e., not a metric space), we can use logic to group different states together." Ex.: " "I have a laptop. Includes any brand & model" "There is a laptop on the table. Can be at any position on the table" 19
20 Where is Logic used?" Action planning (since the first general purpose mobile robot, Shakeyʼ69)" IC design" Esp. after Pentium FDIV (Floating-point Division) bug in ʻ94." Karnaugh map (K-map)" Database, e.g., SQL" Semantic web" Game player" 20
21 A formal language" Defined by 2 things: Syntax & Semantics" Syntax" What expressions are legal." Example:" "for (j = 0; j < 3; j++) { }" "Coloring books sleep furiously." Semantics" Meaning of the legal expression." 21
22 Many types of logic" Propositional logic." Predicate / first order logic." High order logic." 22
23 Today" What is logic?" Propositional logic: Syntax & Semantics" Example of using logic to represent a problem" Two types of problems:" Validity" Satisfiability" 23
24 Propositional logic Syntax " Atomic sentence." An expression that is known to either be true or false." Are these propositions?" What is the distance between Mars and Earth?" x + 2 = 2x." x + 2 = 2x when x = 1." 2x < 3x." Often represented with a symbol called propositional variable, e.g., P, Q." 24
25 Propositional logic Syntax " Complex sentences" Constructed from atomic sentences and logical connectives: bracket ( () ), negation (~), and ( ), or ( ), implication ( ), biconditional ( ). " If S is a sentence, (S) is a sentence." If S is a sentence, ~S is a sentence (negation)." If S 1 and S 2 are sentences, S 1 S 2 is a sentence (conjunction)." If S 1 and S 2 are sentences, S 1 S 2 is a sentence (disjunction)." If S 1 and S 2 are sentences, S 1 S 2 is a sentence (implication)." If S 1 and S 2 are sentences, S 1 S 2 is a sentence (biconditional)." 25
26 Propositional logic Semantics " Meaning of a sentence: Truth values {True, False}." The truth value of a complex sentence can be derived from the truth values of logical connectives for the given interpretation. " P Q ~P P Q P Q P Q P F F T F F T T F T T F T T F T F F F T F F T T F T T T T Q 26
27 Propositional logic Semantics " Interpretation: Assignment of truth values to propositional variables." A model of a sentence: An interpretation that makes the sentence to be true. " A sentence A entails another sentence B (denoted as A = B) iff every model of A is also a model of B (A B is true)" All models of A" 27 All models of sentence B" All possible interpretations"
28 Entailment" Relation between sentences are based on relation between their interpretations" A" entails" B" semantics" semantics" Interpretations" Interpretations" Models of A" subset" Models of B" 28
29 Some terminology" A sentence is valid: Its truth value is T for all possible interpretations." "Ex.: P ~P" A sentence is satisfiable: Its truth value is T for at least one of the possible interpretations." "Ex.: ~P" "Everything thatʼs valid is also satisfiable." A sentence is unsatisfiable: Its truth value is F for all possible interpretations." "Ex.: P ~P" For propositional logic, we can always decide if a sentence is valid/satisfiable/unsatisfiable in finite time (decidable). "" 29
30 Today" What is logic?" Propositional logic: Syntax & Semantics" Example of using logic to represent a problem" Two types of problems:" Validity" Satisfiability" 30
31 An example on how logic is used to represent a problem" Formulate information as propositional logic sentences" Create a knowledge base (KB)." KB: a set of sentences, such that KB is false in models that contradict what the agent knows" Example: The Wumpus World" 31
32 Example: Wumpus world Representing the problem" 32
33 Example: Wumpus world Representing the problem" Suppose:" P x,y is true iff thereʼs a pit in (x, y)." B x,y is true iff the agent perceives a breeze in (x, y)." W x,y is true iff thereʼs Wumpus in (x, y)." S x,y is true iff the agent perceives a smell in (x, y)." Go x,y is true iff thereʼs gold in (x,y)." G x,y is true iff the agent perceives glitter in (x,y)." Initial knowledge base:" Rules of the environment, e.g.:" 33 S 1 : B 1,1 <-> (P 1,2 P 2,1 )." S 2 : B 2,1 <-> (P 1,1 P 2,2 P 3,1 )." :"
34 Example: Wumpus world Representing the problem" Results of perception up to the current time can be added to KB" Ex.: Suppose the agent has only visited (1,1) and perceives:" P 1,1 = F ; B 1,1 = F ; W 1,1 = F ; S 1,1 = F ; Go 1,1 = F ; G 1,1 = F." Then, we can add the following sentences to the initial KB: ~P 1,1, ~B 1,1, ~W 1,1, ~S 1,1, ~Go 1,1, ~G 1,1" 34
35 Example: Wumpus world What can we use KB for?" Deduce new information: Sentences entailed by the current KB can be added to the KB" Answering questions such as can we conclude thereʼs no pit in (1, 2)?" "Formally:" Given the knowledge base: S 1, S 2, S 3,., S n" Does KB entails ~P 1,2?" Meaning: Is the sentence" "S 1 S 2 S 3 S n ~P 1,2 " "valid?" 35
36 Today" What is logic?" Propositional logic: Syntax & Semantics" Example of using logic to represent a problem" Two types of problems:" Validity" Satisfiability" 36
37 Validity Problems" Is a given sentence valid?" The sentence is true under all interpretations" 37
38 Example: Wumpus world Representing the problem" Question: Can we conclude thereʼs no pit in (1, 2)?" Formally: Does the sentence" " " "S 1 S 2 S 3 S 52 ~P 1,2 " "valid?" Two ways:" Model checking." Check validity by checking all models." Theorem proving" Check validity without checking all models. " 38
39 (Simple) Model checking" KB:" R 1 : ~P 1,1" R 2 : B 1,1 (P 1,2 V P 2,1 )" R 3 : B 2,1 (P 1,1 V P 2,2 V P 3,1 )" R 4 : ~B 1,1" R 5 : B 2,1" Check if ~P 1,2 is entailed by KB." 39
40 (Simple) Model checking" Enumerate the models." All true/false values for P 1,1, B 1,1, P 1,2, P 2,1, B 2,1, P 2,2, P 3,1." Check if ~P 1,2 is true in all models where the knowledge base (R 1 R 2 R 3 R 4 R 5 ) is true."
41 (Simple) Model checking" Sound." The result is correct." Complete" It always gives an answer." Complexity:" Time: O(2 n ). " Space: O(n). " n is #propositional variables." 41
42 Question: Can we conclude thereʼs no pit in (1, 2)?" Easy for us to see, but how to enable computers see it, too? " Formally: Does the sentence" " " "S 1 S 2 S 3 S 4 S 5 ~P 1,2 " "valid?" Two ways:" Model checking." Check validity by checking all models." Theorem proving" Check validity without checking all models. " 42
43 Logical equivalences" α, β: Sentence (atomic or complex)." 43
44 Inference rules" Transformation for logical expressions. " Modus ponens" "α β" "α" "β" Modus tollens" "α β" "~β" "~α" And-elimination" "α β " "α" 44
45 Theorem proving Natural deduction" Use inference rules to deduce a sentence from the set of sentences in the knowledge base." Example:" KB:" S 1 : ~P 1,1" S 2 : B 1,1 (P 1,2 V P 2,1 )" S 3 : B 2,1 (P 1,1 V P 2,2 V P 3,1 )" S 4 : ~B 1,1" S 5 : B 2,1" Check if ~P 1,2 is entailed by KB." 45
46 Example " S 1 : ~P 1,1" S 2 : B 1,1 (P 1,2 V P 2,1 )" S 3 : B 2,1 (P 1,1 V P 2,2 V P 3,1 )" S 4 : ~B 1,1" S 5 : B 2,1" S 6 : Biconditional elimination to S 2 :" "(B 1,1 (P 1,2 P 2,1 )) ((P 1,2 P 2,1 ) B 1,1 ) " S 7 : And-elimination to S 6: (P 1,2 P 2,1 ) B 1,1 " S 8 : Modus tollens on S 4 and S 7 : ~(P 1,2 P 2,1 )" S 9 : De Morgan to S 8 : ~P 1,2 ~P 2,1." S 10 : And elimination to S 9 : ~P 1,2" 46
47 Theorem proving Natural deduction Using Search" State space: " All possible set of sentences." Action space: " All inference rules." World dynamics: " Apply the inference rule to all sentences that match the above the line part of the inference rule. Become the sentence that lies below the line of the inference rule." Initial state: " Initial knowledge base." Goal state: " The state contains the sentence weʼre trying to prove." 47
48 Theorem proving Natural deduction" Sound." May not be complete." Depend on whether we can provide a complete list of inference rules." When we can, the branching factor can be very high." 48
49 Resolution" A single inference rule." "α β" "~β α " α, β: Sentence (atomic or complex)." But, the single inference rule is sound & complete only when applied to propositional logic sentences written in Conjunctive Normal Form (CNF)." 49
50 Conjunctive Normal Form (CNF)" Conjunctions of disjunctions." Example: (~A B) (C D) (E F)." Some terminologies" Clause: A disjunctions of literals, e.g., (~A B)." Literals: variables or the negation of variables, e.g., ~A and B." 50
51 Converting to CNF" Every sentence in propositional logic can be written in CNF." Three steps conversion:" Eliminate arrows using definitions." Drive in negations using De Morganʼs Laws." Distribute OR over AND." 51
52 Example" Convert (A B) (C D) to CNF" Eliminate arrows: " "~(A B) (~C D)" Drive in negations: " "(~A ~B) (~C D)" Distribute OR over AND:" "(~A ~C D) (~B ~C D)" 52
53 Theorem proving -- Resolution refutation " Three steps:" Convert all sentences into CNF." Negate the desired conclusion." Apply resolution rule until" Derive false (a contradiction)." Canʼt apply the rule anymore. " Sound & complete (for propositional logic)." If we derive a contradiction, the conclusion follows from the axioms." If we canʼt apply any more, the conclusion cannot be proved from the axioms. " 53
54 Example" Knowledge base: (P Q) (P R) (Q R)." Does the knowledge base entails R?" Knowledge base: P ~P" Does the knowledge base entails R?" 54
55 Today" What is logic?" Propositional logic: Syntax & Semantics" Example of using logic to represent a problem" Two types of problems:" Validity" Satisfiability" 55
56 Satisfiability Problems " Is a given sentence satisfiable?" There is at least one interpretation that makes the sentence to be True." Various applications" Many problems can be phrase as a list of constraints, and a solution is an assignment that satisfies all constraints." Verify air-traffic controller" Write the rules as a set of logical sentences." Check whether the set of sentences and the sentence two airplanes on the same runway at the same time is satisfiable?" Satisfiable: the rules are followed, two airplanes may still happens. " 56
57 More efficient Model Checking for Satisfiability Problem" Essentially: Assign & simplify" Consider a search tree where at each level we consider the possible assignments to one variable, say V. " On one branch, we assume V is False and on the other that it is True." Given an assignment for a variable, we can simplify the sentence and then repeat the process for another variable." 57
58 Example" (A B) (~C V A) (C V B)" (P Q) (P ~Q R) (T ~R) (~P ~T) (P S) (T R S) (~S T )" 58
59 SAT Solvers " Program that automatically detects if a propositional logic sentence is satisfiable." Ex.: Davis Putnam Logeman Loveland (DPLL) Recursive DFS" Speed & memory consumption depend a lot on:" Which symbol is being assigned first " Which assignment is being followed first" A lot of methods have been proposed." Check sec of R&N" 59
60 Today" What is logic?" Propositional logic: Syntax & Semantics" Example of using logic to represent a problem" Two types of problems:" Validity" Satisfiability" 60
61 Next week" Second part of the class!!!" Making decisions when information are inaccurate & limited" Please review your probability (also uploaded in the readings part of the class website)" 61
Price: $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. 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 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 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 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. 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 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 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 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. 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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
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 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 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 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 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 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 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 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 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 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 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 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 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. 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 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 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 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 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 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 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 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 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 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 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 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 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: 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 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 informationPropositional Reasoning
Propositional Reasoning CS 440 / ECE 448 Introduction to Artificial Intelligence Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil Johri Spring 2010 Intro to AI (CS
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 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 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 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 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. 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 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 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. 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: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 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: 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 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 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 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 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 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 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 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 informationPropositional Logic. Testing, Quality Assurance, and Maintenance Winter Prof. Arie Gurfinkel
Propositional Logic Testing, Quality Assurance, and Maintenance Winter 2018 Prof. Arie Gurfinkel References Chpater 1 of Logic for Computer Scientists http://www.springerlink.com/content/978-0-8176-4762-9/
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 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 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 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 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 informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More informationDescription Logics. Deduction in Propositional Logic. franconi. Enrico Franconi
(1/20) Description Logics Deduction in Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/20) Decision
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 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 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 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 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 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 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 informationIntroduction to Artificial Intelligence Propositional Logic & SAT Solving. UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010
Introduction to Artificial Intelligence Propositional Logic & SAT Solving UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010 Today Representation in Propositional Logic Semantics & Deduction
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 information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
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 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 informationComputational Logic. Davide Martinenghi. Spring Free University of Bozen-Bolzano. Computational Logic Davide Martinenghi (1/30)
Computational Logic Davide Martinenghi Free University of Bozen-Bolzano Spring 2010 Computational Logic Davide Martinenghi (1/30) Propositional Logic - sequent calculus To overcome the problems of natural
More informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
More informationPropositional logic. Programming and Modal Logic
Propositional logic Programming and Modal Logic 2006-2007 4 Contents Syntax of propositional logic Semantics of propositional logic Semantic entailment Natural deduction proof system Soundness and completeness
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 informationSAT Solvers: Theory and Practice
Summer School on Verification Technology, Systems & Applications, September 17, 2008 p. 1/98 SAT Solvers: Theory and Practice Clark Barrett barrett@cs.nyu.edu New York University Summer School on Verification
More information