PRODUCTION SYSTEMS (PRODUCTION RULES SYSTEMS) Dr. Hikmat Jaber
|
|
- Brittney Roberts
- 5 years ago
- Views:
Transcription
1 PROUCTION SYSTEMS (PROUCTION RULES SYSTEMS) r. Hikmat Jaber
2 WHT ROUCTION SYSTEM IS USE OR? The production system describes the systems that represent knowledge in the form of rules for modeling human problem solving and for implementing search algorithms. EINITION production system is a system based on I THEN ules a d o sisti g of 3 parts: 1. Rule Set. 2. Working Memory. 3. Inference Engine.
3 ROUCTION SYSTEM 1. Rule Set: is the set of Production Rules: - If <condition> then action - nalogous to long term memory. 2. Working Memory: Inference Engine Working Memory - Maintains the facts that inference engine matches against. - The current state of the world. - nalogous to short term memory. Rule Set If then B If B then 3. Inference Engine: (Production System Interpreter) - way of choosing between rules (Conflict Resolution) and acting on rules (Recognize-ct Cycle).
4 1. PROUCTION production or a rule is condition-action pair presented in the following form: I condition THEN action Production is a single chunk of problem-solving knowledge. The condition part matched against working memory. The condition part of the rule is a pattern that determines when the rule may be applied to a problem. The process of matching the new or existing facts against Production Rules is called pattern matching, which is performed by the Inference Engine. The action part defines the associated problem-solving step if the condition is true.
5 2. WORKING MEMORY Working memory contains a description of the current state of the problem-solving. 3. INERENCE ENGINE Role to determine what to do i.e. implement search allowing the production system to move towards a goal within the set of rules (this is the role of Recognize-act cycle) I.e. to look at the current state of the world and then find from production rules the best to apply. By 1. Match find relevant rules. Those whose conditions match the current state of long term memory 2. Conflict Resolution choose between relevant rules 3. ct apply or fire the rule 4. Repeat
6 PTTERN-IRECTE SERCH Operations of the recognize-act cycle are based on the pattern-directed search 1. The working memory contains a pattern corresponding to the current state in the problem-solving process. 2. The pattern is matched against I or THEN part of rules (it depends on the direction of search) 3. If several rules match the pattern, the conflict set appears (i.e. conflict appears when many rules being true for the same fact). The production rules in the conflict set are said to be enabled. Selection of one rule from the conflict set is called conflict resolution.
7 PTTERN-IRECTE SERCH (cont.) 4. One of the enabled rules is fired and it changes the content of the working memory. 5. The control cycle repeats with the modified working memory. 6. The process terminates when no rules are matched by the content of the working memory. C-condition -action Working memory [Pattern] Knowledge base I C1 THEN 1 I C2 THEN 2 I Cn THEN n
8 CONTROL O SERCH IN PROUCTION SYSTEMS or real world problems a knowledge base typically i ludes a huge u e of I THEN ules. I o de to make search more effective, developers of intelligent systems must use heuristic control of search. There are 3 control strategies: 1. Control through choice of search strategy 2. Control through rule structure 3. Control through conflict resolution
9 CONTROL THROUGH CHOICE O SERCH STRTEGY It is possible to choose a direction of search in production systems: 1. ata-driven search (forward chaining) 2. Goal-driven search (backward chaining)
10 ORWR CHINING orward chaining or data-driven inference works by repeatedly: starting from the current state, matching the premises of the rules (the I parts), and performing the corresponding actions (the THEN parts) that usually update the knowledge base or working memory. The process continues until no more rules can be applied, or some cycle limit is met, e.g. CTS CTS B E execute match &B C& E C RULES CTS C B match &B C& RULES execute CTS E C B execute E C B match &B C& RULES
11 ORWR CHINING (cont.) In this example there are no more rules, so we can draw the inference chain: C B ata-driven search 1. Begins with a problem description (a pattern) added to the working memory 2. The recognize-act cycle compares matching of the pattern with I part of rules in the knowledge base 3. iring a rule, its THEN part is added to the working memory and the process continues 4. Search stops when the goal is found
12 ORWR CHINING (cont.) search Example: ata-driven B 1. I hmad is a student THEN h ad e jo s stude t s life C B 2. I h ad e jo s stude t s life THEN hmad meets friends N h ad pa ti ipates i u i e sit s e e ts C E E 3. I hmad meets friends THEN hmad needs money 4. I hmad needs money THEN hmad has a job C 5. I hmad meets friends N hmad participates in G u i e sit s e e ts THEN hmad has little free time G 6. I hmad has little free time N hmad has a job THEN H hmad is not successful in studies N hmad doesi not receive scholarship
13 ORWR CHINING (cont.) Example: ata-driven search Knowledge base I THEN B I B THEN C N I C THEN E I E THEN I C N THEN G I G N THEN H N I Iteration Working memory Start Goal I Conflict set ired rule , B 1, 2 2 2, B, C, 1, 2, 3, 5 5 3, B, C,, G 1, 2, 3, 5 3 4, B, C,, G, E 1, 2, 3, 5, 4 4 5, B, C,, G, E, 1, 2, 3, 5, 4, 6 6 6, B, C,, G, E,, H, I 1, 2, 3, 5. 4, 6 goal
14 BCKWR CHINING Backward chaining or goal-driven inference works towards a final state by looking at the working memory to see if the sub-goal states already exist there. If not, the actions (the THEN parts) of the rules that will establish the sub-goals are identified, and new sub-goals are set up for achieving the premises of those rules (the I parts). The previous example now becomes CTS CTS CTS CTS E E B C E E B C B C Want B C Want Want Get, Get B Get C, Get Get &B C& &B C& &B C& RULES RULES RULES RULES CTS E B C E B C Execute Execute &B C& CTS &B C& RULES Execute &B C& RULES
15 BCKWR CHINING (cont.) The first part of the chain works back from the goal until only the initial facts are required, at which point we know how to traverse the chain to achieve the goal state. B C Goal-driven search 1. goal (a pattern) is added to the working memory 2. The recognize-act cycle compares matching of the pattern with THEN part of rules in the knowledge base 3. iring a rule, its I part is added to the working memory and the process continues 4. Search stops when facts on problem are found
16 BCKWR CHINING (cont.) Example: Goal-driven search Knowledge base I p N q THEN goal I r N s THEN p I w N r THEN q I t N u THEN q I v THEN s I start THEN v N r N q Iteration Working memory Start goal Goal start Conflict set ired rule 0 goal goal, p, q 1, 2, 3, goal, p, q, r, s 1, 2, 3, 4, goal, p, q, r, s, w 1, 2, 3, 4, goal, p, q, r, s, w, t, u 1, 2, 3, 4, goal, p, q, r, s, w, t, u, v 1, 2, 3, 4, 5, goal, p, q, r, s, w, t, u, v, start 1, 2, 3, 4. 5, 6 stop
17 CONTROL THROUGH RULE STRUCTURE Human experts encode crucial heuristics within their rules of expertise. The order of conditions encodes important procedural information for solving the problem. It is important that this form be preserved in building an intelligent system that sol es p o le s like the e pe t. Whe a the e gi e o t tu he k the atte e ha i sa s if o e a d the lights do t o e o the, he/she is suggesti g a spe ifi se ue e of things to try. This form of the rules is critical in controlling search, making the system behave logically.
18 CONTROL THROUGH RULE STRUCTURE (cont.) RULE STRUCTURE + RULE ORER IN THE KNOWLEGE BSE efines search order and its effectiveness
19 CONTROL THROUGH RULE STRUCTURE (cont.) RULE STRUCTURE What is the content of I part? What is the content of THEN part? How several What will be the What will be the conditions will order of conditions order of actions if be connected if they are several? they are several? (N, OR)? I a & b & c THEN a & & I b & a & c THEN & a &
20 CONTROL THROUGH CONLICT RESOLUTION The simplest strategy is to choose the first rule that matches the content of the working memory and do not use recently fires rules. Common strategy: 1. Once a rule has fired, it may not fire again until the working memory elements that match its conditions have been modified, this discourages looping. 2. Rules whose conditions match with the patterns most recently added to the working memory are more preferred. This focuses the search on a single line of reasoning. 3. more specific problem-solving rule is preferred to a general rule. rule is more specific than another if it has more conditions. I a THEN c I a N b THEN c more specific
21 EXERCISE Consider the following set of rules: R1: I: engine does not turn N battery is not flat THEN: ask user to test starter motor R2: I: there is no spark THEN: ask user to check the points R3: I: engine turns N engine does not start THEN: ask user to check the spark R4: I: engine does not turn THEN: ask user to check the battery R5: I: battery is flat THEN: ask user to charge battery N EXIT Build a production system to formulate and resolve the above simple mechanical diagnosis problem of a vehicle. The production system should list the working memory (facts), the rule set (rules) and inference engine (recognize-act cycle and conflict set). Your system should specify and verify what search strategy is chosen (forward or backward reasoning). In addition, your answer should include: 1. The table that describes the working memory, conflict set and the rule triggered for each process iteration. 2. The figure that describes the rules, the facts, and the inference engine that apply the rules on the facts for firing the rules on the matched facts.
Propositional 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 informationReasoning Systems Chapter 4. Dr Ahmed Rafea
Reasoning Systems Chapter 4 Dr Ahmed Rafea Introduction In this chapter we will explore how the various knowledge representations can be used for reasoning We will explore : Reasoning with rules Forward
More informationKnowledge-based and Expert Systems - 1. Knowledge-based and Expert Systems - 2. Knowledge-based and Expert Systems - 4
Knowledge-based and Expert Systems - 1 Knowledge-based and Expert Systems - 2 Expert systems (ES) provide expert quality advice, diagnosis or recommendations. ES solve real problems which normally would
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 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 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 informationOutline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference
Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 008 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence
More informationOutline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference
Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 007 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence
More 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 (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 informationInference in first-order logic. Production systems.
CS 1571 Introduction to AI Lecture 17 Inference in first-order logic. Production systems. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Sentences in Horn normal form Horn normal form (HNF) in
More informationLogical Agents. Chapter 7
Logical Agents Chapter 7 Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem
More informationHoare Logic I. Introduction to Deductive Program Verification. Simple Imperative Programming Language. Hoare Logic. Meaning of Hoare Triples
Hoare Logic I Introduction to Deductive Program Verification Işıl Dillig Program Spec Deductive verifier FOL formula Theorem prover valid contingent Example specs: safety (no crashes), absence of arithmetic
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 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 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 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 informationLogic reasoning systems
Lecture 2 Logic reasoning systems Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Administration No class next week PS-5: Due on Thursda October 4, 2004 Submit directly to Tomas Singliar Midterm:
More informationThis addendum describes the use of new termination actions in the Arbitrary Control Experiment in FuelCell Version 3.8d and later.
FuelCell Addendum Arbitrary Control Termination D. Johnson, Scribner Associates, Inc. 4/16/2007, Ver. 2 Introduction This addendum describes the use of new termination actions in the Arbitrary Control
More informationARTIFICIAL NEURAL NETWORK PART I HANIEH BORHANAZAD
ARTIFICIAL NEURAL NETWORK PART I HANIEH BORHANAZAD WHAT IS A NEURAL NETWORK? The simplest definition of a neural network, more properly referred to as an 'artificial' neural network (ANN), is provided
More informationLab 3 Parallel Circuits
Lab 3 Parallel Circuits!!! RED THIS PGE!!!! When a wire or light bulb is connected across a battery, we have evidence that something is happening in the circuit. The wire gets warm. The bulb glows. In
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 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 informationChapter 3 Deterministic planning
Chapter 3 Deterministic planning In this chapter we describe a number of algorithms for solving the historically most important and most basic type of planning problem. Two rather strong simplifying assumptions
More informationStudent Sheet: Self-Assessment
Student s Name Date Class Student Sheet: Self-Assessment Directions: Use the space provided to prepare a KWL chart. In the first column, write things you already know about energy, forces, and motion.
More informationDesirable properties of decompositions 1. Decomposition of relational schemes. Desirable properties of decompositions 3
Desirable properties of decompositions 1 Lossless decompositions A decomposition of the relation scheme R into Decomposition of relational schemes subschemes R 1, R 2,..., R n is lossless if, given tuples
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 informationAn Active Learning Approach For Inferring Discrete Event Automata
An Active Learning Approach For Inferring Discrete Event Automata Mohammad Mahdi Karimi PhD. Candidate, ECE Supervisor: Dr Ali Karimoddini Summer 2015 1 Content 1. Discrete Event Systems Definitions Applications
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 informationLab 4. Current, Voltage, and the Circuit Construction Kit
Physics 2020, Spring 2009 Lab 4 Page 1 of 8 Your name: Lab section: M Tu Wed Th F TA name: 8 10 12 2 4 Lab 4. Current, Voltage, and the Circuit Construction Kit The Circuit Construction Kit (CCK) is a
More informationPhysics 220: Worksheet 7
(1 A resistor R 1 =10 is connected in series with a resistor R 2 =100. A current I=0.1 A is present through the circuit. What is the power radiated in each resistor and also in the total circuit? (2 A
More informationAdvanced Topics in LP and FP
Lecture 3: Logic Programming in Prolog Outline 1 2 3 The control of execution Logic Programming Declarative programming style: Emphasis on What is the solution? instead of How to find the solution? Symbolic
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 informationIntelligent Agents. Formal Characteristics of Planning. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University
Intelligent Agents Formal Characteristics of Planning Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University Extensions to the slides for chapter 3 of Dana Nau with contributions by
More informationPROBLEM SOLVING AND SEARCH IN ARTIFICIAL INTELLIGENCE
Artificial Intelligence, Computational Logic PROBLEM SOLVING AND SEARCH IN ARTIFICIAL INTELLIGENCE Lecture 4 Metaheuristic Algorithms Sarah Gaggl Dresden, 5th May 2017 Agenda 1 Introduction 2 Constraint
More information31.1.1Partial derivatives
Module 11 : Partial derivatives, Chain rules, Implicit differentiation, Gradient, Directional derivatives Lecture 31 : Partial derivatives [Section 31.1] Objectives In this section you will learn the following
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 informationChapter 6 Constraint Satisfaction Problems
Chapter 6 Constraint Satisfaction Problems CS5811 - Artificial Intelligence Nilufer Onder Department of Computer Science Michigan Technological University Outline CSP problem definition Backtracking search
More informationDiscrete Mathematics
Discrete Mathematics Jeremy Siek Spring 2010 Jeremy Siek Discrete Mathematics 1 / 24 Outline of Lecture 3 1. Proofs and Isabelle 2. Proof Strategy, Forward and Backwards Reasoning 3. Making Mistakes Jeremy
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 informationPhysics 2B Notes - Capacitors Spring 2018
Definition of a Capacitor Special Case: Parallel Plate Capacitor Capacitors in Series or Parallel Capacitor Network Definition of a Capacitor Webassign Chapter 0: 8, 9, 3, 4, 5 A capacitor is a device
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 informationProblem Solving and Inferencing REASONING AND INFERENCE Characteristics of Classification Type
REASONING AND INFERENCE Part I: Review of Problem Spaces and Inference Chains Characteristics of Goal-driven Problems 3 Classification Type Problem Space 4 Many initial conditions Initial Conditions Intermd.
More informationSelf-assessment due: Monday 3/18/2019 at 11:59pm (submit via Gradescope)
CS 188 Spring 2019 Introduction to Artificial Intelligence Written HW 6 Sol. Self-assessment due: Monday 3/18/2019 at 11:59pm (submit via Gradescope) Instructions for self-assessment: Take your original
More informationKnowledge-based systems
CS 750 Foundations of I Lecture 6 Knowledge-based systems Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square dministration announcements Midterm: Thursda October 6, 07 In-class Closed book What does
More informationRule-Based Classifiers
Rule-Based Classifiers For completeness, the table includes all 16 possible logic functions of two variables. However, we continue to focus on,,, and. 1 Propositional Logic Meta-theory. Inspection of a
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 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 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 informationLecture 22/Chapter 19 Part 4. Statistical Inference Ch. 19 Diversity of Sample Proportions
Lecture 22/Chapter 19 Part 4. Statistical Inference Ch. 19 Diversity of Sample Proportions Probability versus Inference Behavior of Sample Proportions: Example Behavior of Sample Proportions: Conditions
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 informationHoare Logic and Model Checking
Hoare Logic and Model Checking Kasper Svendsen University of Cambridge CST Part II 2016/17 Acknowledgement: slides heavily based on previous versions by Mike Gordon and Alan Mycroft Introduction In the
More informationCompiling and Executing PDDL in Picat
Compiling and Executing PDDL in Picat Marco De Bortoli, Roman Bartak, Agostino Dovier, Neng-Fa Zhou Università degli Studi di Udine CILC 2016 Picat CILC 2016 1 / 21 Outline Introduction to classical planning
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 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 informationFranz J. Kurfess Computer Science Department California Polytechnic State University San Luis Obispo, CA, U.S.A.
CPE/CSC 481: Knowledge-Based Systems Franz J. Kurfess Computer Science Department California Polytechnic State University San Luis Obispo, CA, U.S.A. Usage of the Slides these slides are intended for the
More informationFrom SAT To SMT: Part 1. Vijay Ganesh MIT
From SAT To SMT: Part 1 Vijay Ganesh MIT Software Engineering & SMT Solvers An Indispensable Tactic for Any Strategy Formal Methods Program Analysis SE Goal: Reliable/Secure Software Automatic Testing
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 informationLecture 4: Simulated Annealing. An Introduction to Meta-Heuristics, Produced by Qiangfu Zhao (Since 2012), All rights reserved
Lecture 4: Simulated Annealing Lec04/1 Neighborhood based search Step 1: s=s0; Step 2: Stop if terminating condition satisfied; Step 3: Generate N(s); Step 4: s =FindBetterSolution(N(s)); Step 5: s=s ;
More informationADDITIONAL RESOURCES. Duration of resource: 12 Minutes. Year of Production: Stock code: VEA12054
ADDITIONAL RESOURCES Any type of motion means a force is at work it is one of the most fundamental concepts in physics, and has formed the basis of the work of many pioneering scientists, including Isaac
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 informationReinforcement Learning and Control
CS9 Lecture notes Andrew Ng Part XIII Reinforcement Learning and Control We now begin our study of reinforcement learning and adaptive control. In supervised learning, we saw algorithms that tried to make
More informationIn this episode of The Verification Corner, Rustan Leino talks about Loop Invariants. He gives a brief summary of the theoretical foundations and
In this episode of The Verification Corner, Rustan Leino talks about Loop Invariants. He gives a brief summary of the theoretical foundations and shows how a program can sometimes be systematically constructed
More informationThe Assignment Axiom (Hoare)
The Assignment Axiom (Hoare) Syntax: V := E Semantics: value of V in final state is value of E in initial state Example: X:=X+ (adds one to the value of the variable X) The Assignment Axiom {Q[E/V ]} V
More informationFrames of reference. Objectives. Assessment. Physics terms. Equations. What is a frame of reference? 5/19/14
Frames of reference Objectives Identify and describe motion relative to different frames of reference. Calculate the one-dimensional velocity of an object in a moving frame of reference. A train is moving
More informationLogic. Propositional Logic: Syntax
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
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 informationLesson 23: The Defining Equation of a Line
Student Outcomes Students know that two equations in the form of and graph as the same line when and at least one of or is nonzero. Students know that the graph of a linear equation, where,, and are constants
More informationAxiomatic Verification II
Axiomatic Verification II Software Testing and Verification Lecture Notes 18 Prepared by Stephen M. Thebaut, Ph.D. University of Florida Axiomatic Verification II Reasoning about iteration (while loops)
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 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 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 informationCockpit System Situational Awareness Modeling Tool
ABSTRACT Cockpit System Situational Awareness Modeling Tool John Keller and Dr. Christian Lebiere Micro Analysis & Design, Inc. Capt. Rick Shay Double Black Aviation Technology LLC Dr. Kara Latorella NASA
More informationLecture 23: Reinforcement Learning
Lecture 23: Reinforcement Learning MDPs revisited Model-based learning Monte Carlo value function estimation Temporal-difference (TD) learning Exploration November 23, 2006 1 COMP-424 Lecture 23 Recall:
More informationNeural Networks. CSE 6363 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington
Neural Networks CSE 6363 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington 1 Perceptrons x 0 = 1 x 1 x 2 z = h w T x Output: z x D A perceptron
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 informationStrong AI vs. Weak AI Automated Reasoning
Strong AI vs. Weak AI Automated Reasoning George F Luger ARTIFICIAL INTELLIGENCE 6th edition Structures and Strategies for Complex Problem Solving Artificial intelligence can be classified into two categories:
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 informationAxiomatic Semantics: Verification Conditions. Review of Soundness and Completeness of Axiomatic Semantics. Announcements
Axiomatic Semantics: Verification Conditions Meeting 12, CSCI 5535, Spring 2009 Announcements Homework 4 is due tonight Wed forum: papers on automated testing using symbolic execution 2 Questions? Review
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 informationIntroduction EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 6: Sequential Logic 3 Registers & Counters 5/9/2010
EE 224: INTROUCTION TO IGITAL CIRCUITS & COMPUTER ESIGN Lecture 6: Sequential Logic 3 Registers & Counters 05/10/2010 Avinash Kodi, kodi@ohio.edu Introduction 2 A Flip-Flop stores one bit of information
More informationElectricity and Magnetism DC Circuits Using Kirchhoff s Laws
Electricity and Magnetism DC Circuits Using Kirchhoff s Laws Lana Sheridan De Anza College Feb 9, 08 Last time power Kirchhoff s laws Overview more Kirchhoff examples Example with Two Batteries Find the
More information1 [15 points] Search Strategies
Probabilistic Foundations of Artificial Intelligence Final Exam Date: 29 January 2013 Time limit: 120 minutes Number of pages: 12 You can use the back of the pages if you run out of space. strictly forbidden.
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 informationAlgorithms and Complexity theory
Algorithms and Complexity theory Thibaut Barthelemy Some slides kindly provided by Fabien Tricoire University of Vienna WS 2014 Outline 1 Algorithms Overview How to write an algorithm 2 Complexity theory
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 informationK owi g yourself is the begi i g of all wisdo.
I t odu tio K owi g yourself is the begi i g of all wisdo. A istotle Why You Need Insight Whe is the last ti e ou a e e e taki g ti e to thi k a out ou life, ou alues, ou d ea s o ou pu pose i ei g o this
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 informationLearning Analytics. Dr. Bowen Hui Computer Science University of British Columbia Okanagan
Learning Analytics Dr. Bowen Hui Computer cience University of British Columbia kanagan Putting the Pieces Together Consider an intelligent tutoring system designed to assist the user in programming Possible
More informationFINAL EXAM PRACTICE PROBLEMS CMSC 451 (Spring 2016)
FINAL EXAM PRACTICE PROBLEMS CMSC 451 (Spring 2016) The final exam will be on Thursday, May 12, from 8:00 10:00 am, at our regular class location (CSI 2117). It will be closed-book and closed-notes, except
More informationSPSS, University of Texas at Arlington. Topics in Machine Learning-EE 5359 Neural Networks
Topics in Machine Learning-EE 5359 Neural Networks 1 The Perceptron Output: A perceptron is a function that maps D-dimensional vectors to real numbers. For notational convenience, we add a zero-th dimension
More informationKNOWLEDGE-BASED AGENTS INFERENCE
AGENTS THAT REASON LOGICALLY KNOWLEDGE-BASED AGENTS Two components: knowledge bse, nd n inference engine. Declrtive pproch to building n gent. We tell it wht it needs to know, nd It cn sk itself wht to
More informationReinforcement Learning II
Reinforcement Learning II Andrea Bonarini Artificial Intelligence and Robotics Lab Department of Electronics and Information Politecnico di Milano E-mail: bonarini@elet.polimi.it URL:http://www.dei.polimi.it/people/bonarini
More informationDynamic Semantics. Dynamic Semantics. Operational Semantics Axiomatic Semantics Denotational Semantic. Operational Semantics
Dynamic Semantics Operational Semantics Denotational Semantic Dynamic Semantics Operational Semantics Operational Semantics Describe meaning by executing program on machine Machine can be actual or simulated
More informationAN AXIOMATIC APPROACH TO KNOWLEDGE-BASED MAP GENERALISATION
POSTER SESSIONS 565 AN AXIOMATIC APPROACH TO KNOWLEDGE-BASED MAP GENERALISATION Wenxing Zhang, Ken Richardson Dept of Information Technology The Waikato Polytechnic (TWP) Hamilton 2000, New Zealand Email:
More informationCollision. Kuan-Yu Chen ( 陳冠宇 ) TR-212, NTUST
Collision Kuan-Yu Chen ( 陳冠宇 ) 2018/12/17 @ TR-212, NTUST Review Hash table is a data structure in which keys are mapped to array positions by a hash function When two or more keys map to the same memory
More informationPropositional Logic. Fall () Propositional Logic Fall / 30
Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically
More informationInf2D 13: Resolution-Based Inference
School of Informatics, University of Edinburgh 13/02/18 Slide Credits: Jacques Fleuriot, Michael Rovatsos, Michael Herrmann Last lecture: Forward and backward chaining Backward chaining: If Goal is known
More informationIntroduction to Reinforcement Learning
CSCI-699: Advanced Topics in Deep Learning 01/16/2019 Nitin Kamra Spring 2019 Introduction to Reinforcement Learning 1 What is Reinforcement Learning? So far we have seen unsupervised and supervised learning.
More informationUnit One Worksheet Motion and Forces WS PS U1
Unit One Worksheet Motion and Forces WS PS U1 Name Period Section 1.1 Short Answer. Answer the following questions. 1. Why is a control important in an experiment? 2. Why is gravity an example of a scientific
More information