Chapter 14 Temporal Planning
|
|
- Nigel Howard
- 5 years ago
- Views:
Transcription
1 Lecture slides for Automated Planning: Theory and Practice Chapter 14 Temporal Planning Dana S. Nau CMSC 722, AI Planning University of Maryland, Spring
2 Temporal Planning Motivation: want to do planning in situations where actions have nonzero duration may overlap in time Need an explicit representation of time In Chapter 10 we studied a temporal logic Its notion of time is too simple: a sequence of discrete events Many real-world applications require continuous time How to get this? 2
3 Temporal Planning The book presents two equivalent approaches: 1. Use logical atoms, and extend the usual planning operators to include temporal conditions on those atoms» Chapter 14 calls this the state-oriented view 2. Use state variables, and specify change and persistence constraints on the state variables» Chapter 14 calls this the time-oriented view In each case, the chapter gives a planning algorithm that s like a temporal-planning version of PSP 3
4 The Time-Oriented View We ll concentrate on the time-oriented view : Sections It produces a simpler representation State variables seem better suited for the task States not defined explicitly Instead, can compute a state for any time point, from the values of the state variables at that time 4
5 State Variables A state variable is a partially specified function telling what is true at some time t cpos(c1) : time containers U cranes U robots» Tells what c1 is on at time t rloc(r1) : time locations» Tells where r1 is at time t Might not ever specify the entire function cpos(c) refers to a collection of state variables We ll be sloppy and call it a state variable rather than a collection of state variables 5
6 Example DWR domain, with robot r1 container c1 ship Uranus locations loc1, loc2 cranes crane2, crane4 r1 is in loc1 at time t 1, leaves loc1 at time t 2, enters loc2 at time t 3, leaves loc2 at time t 4, enters l at time t 5 c1 is in pile1 until time t 6, held by crane2 from t 6 to t 7, sits on r1 until t 8, held by crane4 until t 9, and sits on p until t 10 or later Uranus stays at dock5 from t 11 to t 12 6
7 Temporal assertion: Temporal Assertions Event: an expression of the form : (v 1,v 2 )» At time t, x changes from v 1 to v 2 v 1 Persistence condition: x@[t 1,t 2 ) : v» x = v throughout the interval [t 1,t 2 ) where» t, t 1, t 2 are constants or temporal variables» v, v 1, v 2 are constants or object variables Note that the time intervals are semi-open Why are they? 7
8 Temporal assertion: Temporal Assertions Event: an expression of the form : (v 1,v 2 )» At time t, x changes from v 1 to v 2 v 1 Persistence condition: x@[t 1,t 2 ) : v» x = v throughout the interval [t 1,t 2 ) where» t, t 1, t 2 are constants or temporal variables» v, v 1, v 2 are constants or object variables Note that the time intervals are semi-open Why are they? To prevent potential confusion about x s value at the endpoints 8
9 Chronicle: a pair Φ = (F,C) Chronicles F is a finite set of temporal assertions C is a finite set of constraints» temporal constraints and object constraints C must be consistent (i.e., there must exist variable assignments that satisfy it) Timeline: a chronicle for a single state variable The book writes F and C in a calligraphic font Sometimes I will, more often I ll just use italics 9
10 Example Timeline for rloc(r1): 10
11 A timeline (F,C) is consistent if C is consistent Consistency Every pair of assertions in F are either disjoint or they refer to the same value and/or time points:» If F contains both x@[t 1,t 2 ):v 1 and x@[t 3,t 4 ):v 2, then C must entail {t 2 t 3 }, {t 4 t 1 }, or {v 1 = v 2 }» If F contains both x@t : (v 1,v 2 ) and x@[t 1,t 2 ) : v then C must entail {t < t 1 }, {t 2 < t}, {v = v 2, t 1 = t}, or {t 2 = t, v = v 1 }» If F contains both x@t : (v 1,v 2 ) and x@t' : (v' 1,v' 2 ) then C must entail {t t'} or {v 1 = v' 1, v 2 = v' 2 } (F,C) is consistent iff the timelines for all of its state variables are consistent This is stronger than the usual notion of a consistent set of constraints Here, the separation constraints must actually be entailed by C It s sort of like saying that (F,C) contains no threats 11
12 Example Let (F,C) include the timelines given earlier, plus some additional constraints: t 1 t 6, t 7 < t 2, t 3 t 8, t 9 < t 4, attached(p, loc2) Above, I ve drawn the entire set of time constraints All pairs of temporal assertions are either disjoint or refer to the same value at the same point, so (F,C) is consistent 12
13 Support and Enablers Let α be the assertion or the assertion Intuitively, a chronicle Φ = (F,C) supports α when Φ contains an assertion β that we can use to establish x = v at some time s <t,» β is called the support for α it is consistent to have v to persist over [s,t), it is consistent to have α be true Formally, Φ = (F,C) supports α if there is an assertion β in F of the form β = x@s:(w',w) or β = x@[s',s)@w and a set of separation constraints C' that makes the following chronicle consistent:» (F U {α, x@[s,t):v}, C U C' U {w=v, s < t}) The pair δ = ({α, x@[s,t):v}, C' U {w=v, s < t}) is an enabler for α Analogous to a causal link in PSP Can either be absent from Φ or already in Φ Just like there could be more than one possible causal link in PSP, there can be more than one possible enabler 13
14 Example We can support α = rloc(r1)@t:(routes, loc3) in two ways: β 1 = rloc(r1)@t 2 :(loc1, routes) β 2 = rloc(r1)@t 4 :(loc2, routes) An enabler for β 2 is δ = ({rloc(r1)@[t 4, t):routes, rloc(r1)@t: (routes, loc3)}, {t 4 < t < t 5 } 14
15 Φ = (F,C) supports a set of assertions E = {α 1,, α k } if there is a set of enablers φ = {δ 1,, δ k } having the following properties: the chronicle is (F,C) U δ 1 U U δ k is consistent each α i is supported by everything other than α i» i.e., α i is supported by (F U E {α i }, C} Note that some of the assertions in E may support each other! φ = {δ 1,, δ k } is an enabler for E 15
16 Example Four ways to support the pair of assertions α 1 = rloc(r1)@t:(routes, loc3) α 2 = rloc(r1)@[t',t''):loc3) To support α 1, use either β 1 = rloc(r1)@t 2 :(loc1, routes) or β 2 = rloc(r1)@t 4 :(loc2, routes) To support α 2, use either α 1, or β =rloc(r1)@t 5 :(routes,l) with the binding l=loc3 16
17 Enabling and Supporting Another Chronicle 17
18 Chronicles as Planning Operators Chronicle planning operator: a pair o = (name(o), (F(o), C(o))) such that name(o) is an expression of the form o(t s, t e,, v 1, v 2, )» o is an operator symbol» t s, t e,, v 1, v 2, are all the temporal and object variables in o (F(o), C(o)) is a chronicle Action: a (partially) instantiated operator a If Φ supports (F(a), C(a)), then a is applicable to Φ a may be applicable in several ways, so the result is a set of chronicles γ(φ,a) = {Φ φ φ θ(a/φ)} 18
19 Example: moving a robot 19
20 Applying a Set of Actions If we want to execute a set of actions, they may support each other! Couldn t happen in classical planning, because the actions that support a i must finish before a i starts In temporal planning, the actions can overlap Let π = {a 1,, a k } be the set of actions Let Φ π = i (F(a i ),C(a i )) If Φ supports Φ π then π is applicable to Φ Result is a set of chronicles γ(φ,π) = {Φ φ φ θ(φ π /Φ)} 20
21 Domains and Problems Temporal planning domain: a pair D = (Λ Φ,O) O = {all chronicle planning operators in the domain} Λ Φ = {all chronicles allowed in the domain} Temporal planning problem on D: a triple P = (D,Φ 0,Φ g ) D is the domain Φ 0 and Φ g are initial chronicle and goal chronicle O is the set of chronicle planning operators Statement of the problem P: a triple P = (O, Φ 0, Φ g ) O is the set of chronicle planning operators Φ 0 and Φ g are initial chronicle and goal chronicle Solution plan: a set of actions π = {a 1,, a n } such that at least one chronicle in γ(φ 0,π) entails Φ g 21
22 set of open goals set of sets of enablers As in plan-space planning, there are two kinds of flaws: Open goal: a tqe that isn t yet enabled Threat: an enabler that hasn t yet been incorporated into Φ {θ(α/φ)} 22
23 Let α be an open goal Case 1: Φ supports α Resolving Open Goals Resolver: any enabler for α that s consistent with Φ Refinement:» G G {α}» K K θ(α/φ) Case 2: Φ doesn t support α Resolver: an action a = (F(a),C(a)) that supports α» We don t yet require a to be supported by Φ Refinement:» π π {a}» Φ Φ (F(a), C(a))» G G F(a) put all of a s tqes into G» K K θ(a/φ) put a s set of enablers into K 23
24 Resolving Threats Threat: each enabler in K that isn t yet entailed by Φ is threatened For each C in K, we need only one of the enablers in C» They re alternative ways to achieve the same thing Threat means something different here than in PSP, because we won t try to entail all of the enablers» Just the one we select Resolver: any enabler φ in C that is consistent with Φ Refinement:» K K C» Φ Φ φ 24
25 Example Φ 0 is as shown: Φ g = Φ 0 U (E,{}), where E = {α 1 = rloc(r1)@t:(routes, loc3) α 2 = rloc(r1)@[t',t''):loc3)} As before, let β 1 = rloc(r1)@t 2 :(loc1, routes) β 2 = rloc(r1)@t 4 :(loc2, routes) Also, let β = rloc(r1)@t 5 :(routes, l) 25
Chapter 4 Deliberation with Temporal Domain Models
Last update: April 10, 2018 Chapter 4 Deliberation with Temporal Domain Models Section 4.4: Constraint Management Section 4.5: Acting with Temporal Models Automated Planning and Acting Malik Ghallab, Dana
More informationCMSC 722, AI Planning. Planning and Scheduling
CMSC 722, AI Planning Planning and Scheduling Dana S. Nau University of Maryland 1:26 PM April 24, 2012 1 Scheduling Given: actions to perform set of resources to use time constraints» e.g., the ones computed
More informationChapter 17 Planning Based on Model Checking
Lecture slides for Automated Planning: Theory and Practice Chapter 17 Planning Based on Model Checking Dana S. Nau CMSC 7, AI Planning University of Maryland, Spring 008 1 Motivation c Actions with multiple
More informationChapter 7 Propositional Satisfiability Techniques
Lecture slides for Automated Planning: Theory and Practice Chapter 7 Propositional Satisfiability Techniques Dana S. Nau CMSC 722, AI Planning University of Maryland, Spring 2008 1 Motivation Propositional
More informationChapter 5 Plan-Space Planning
Lecture slides for Automated Planning: Theory and Practice Chapter 5 Plan-Space Planning Dana S. Nau University of Maryland 5:10 PM February 6, 2012 1 Problem with state-space search Motivation In some
More informationChapter 16 Planning Based on Markov Decision Processes
Lecture slides for Automated Planning: Theory and Practice Chapter 16 Planning Based on Markov Decision Processes Dana S. Nau University of Maryland 12:48 PM February 29, 2012 1 Motivation c a b Until
More informationChapter 17 Planning Based on Model Checking
Lecture slides for Automated Planning: Theory and Practice Chapter 17 Planning Based on Model Checking Dana S. Nau University of Maryland 1:19 PM February 9, 01 1 Motivation c a b Actions with multiple
More informationCSE 331 Winter 2018 Reasoning About Code I
CSE 331 Winter 2018 Reasoning About Code I Notes by Krysta Yousoufian Original lectures by Hal Perkins Additional contributions from Michael Ernst, David Notkin, and Dan Grossman These notes cover most
More information1 Review of the dot product
Any typographical or other corrections about these notes are welcome. Review of the dot product The dot product on R n is an operation that takes two vectors and returns a number. It is defined by n u
More informationSemantics and Pragmatics of NLP
Semantics and Pragmatics of NLP Alex Ewan School of Informatics University of Edinburgh 28 January 2008 1 2 3 Taking Stock We have: Introduced syntax and semantics for FOL plus lambdas. Represented FOL
More informationLecture Notes: Axiomatic Semantics and Hoare-style Verification
Lecture Notes: Axiomatic Semantics and Hoare-style Verification 17-355/17-665/17-819O: Program Analysis (Spring 2018) Claire Le Goues and Jonathan Aldrich clegoues@cs.cmu.edu, aldrich@cs.cmu.edu It has
More informationMath 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011
Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell
More informationModern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur
Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture 02 Groups: Subgroups and homomorphism (Refer Slide Time: 00:13) We looked
More informationWhat happens to the value of the expression x + y every time we execute this loop? while x>0 do ( y := y+z ; x := x:= x z )
Starter Questions Feel free to discuss these with your neighbour: Consider two states s 1 and s 2 such that s 1, x := x + 1 s 2 If predicate P (x = y + 1) is true for s 2 then what does that tell us about
More informationChapter 7 Propositional Satisfiability Techniques
Lecture slides for Automated Planning: Theory and Practice Chapter 7 Propositional Satisfiability Techniques Dana S. Nau University of Maryland 12:58 PM February 15, 2012 1 Motivation Propositional satisfiability:
More informationLinear Algebra Handout
Linear Algebra Handout References Some material and suggested problems are taken from Fundamentals of Matrix Algebra by Gregory Hartman, which can be found here: http://www.vmi.edu/content.aspx?id=779979.
More informationLecture 11: Extrema. Nathan Pflueger. 2 October 2013
Lecture 11: Extrema Nathan Pflueger 2 October 201 1 Introduction In this lecture we begin to consider the notion of extrema of functions on chosen intervals. This discussion will continue in the lectures
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
More informationCONSTRUCTION OF sequence of rational approximations to sets of rational approximating sequences, all with the same tail behaviour Definition 1.
CONSTRUCTION OF R 1. MOTIVATION We are used to thinking of real numbers as successive approximations. For example, we write π = 3.14159... to mean that π is a real number which, accurate to 5 decimal places,
More informationDiscrete Structures Proofwriting Checklist
CS103 Winter 2019 Discrete Structures Proofwriting Checklist Cynthia Lee Keith Schwarz Now that we re transitioning to writing proofs about discrete structures like binary relations, functions, and graphs,
More informationAt the start of the term, we saw the following formula for computing the sum of the first n integers:
Chapter 11 Induction This chapter covers mathematical induction. 11.1 Introduction to induction At the start of the term, we saw the following formula for computing the sum of the first n integers: Claim
More informationSection 1.x: The Variety of Asymptotic Experiences
calculus sin frontera Section.x: The Variety of Asymptotic Experiences We talked in class about the function y = /x when x is large. Whether you do it with a table x-value y = /x 0 0. 00.0 000.00 or with
More informationLecture 6: Finite Fields
CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going
More informationNondeterministic finite automata
Lecture 3 Nondeterministic finite automata This lecture is focused on the nondeterministic finite automata (NFA) model and its relationship to the DFA model. Nondeterminism is an important concept in the
More informationLine Integrals and Path Independence
Line Integrals and Path Independence We get to talk about integrals that are the areas under a line in three (or more) dimensional space. These are called, strangely enough, line integrals. Figure 11.1
More informationOne sided tests. An example of a two sided alternative is what we ve been using for our two sample tests:
One sided tests So far all of our tests have been two sided. While this may be a bit easier to understand, this is often not the best way to do a hypothesis test. One simple thing that we can do to get
More informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationIntermediate Logic. Natural Deduction for TFL
Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The
More informationCMSC 451: Lecture 7 Greedy Algorithms for Scheduling Tuesday, Sep 19, 2017
CMSC CMSC : Lecture Greedy Algorithms for Scheduling Tuesday, Sep 9, 0 Reading: Sects.. and. of KT. (Not covered in DPV.) Interval Scheduling: We continue our discussion of greedy algorithms with a number
More informationProving logical equivalencies (1.3)
EECS 203 Spring 2016 Lecture 2 Page 1 of 6 Proving logical equivalencies (1.3) One thing we d like to do is prove that two logical statements are the same, or prove that they aren t. Vocabulary time In
More informationGeneral Technical Remarks on PDE s and Boundary Conditions Kurt Bryan MA 436
General Technical Remarks on PDE s and Boundary Conditions Kurt Bryan MA 436 1 Introduction You may have noticed that when we analyzed the heat equation on a bar of length 1 and I talked about the equation
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27
CS 70 Discrete Mathematics for CS Spring 007 Luca Trevisan Lecture 7 Infinity and Countability Consider a function f that maps elements of a set A (called the domain of f ) to elements of set B (called
More informationProbability and the Second Law of Thermodynamics
Probability and the Second Law of Thermodynamics Stephen R. Addison January 24, 200 Introduction Over the next several class periods we will be reviewing the basic results of probability and relating probability
More informationProgramming Languages and Compilers (CS 421)
Programming Languages and Compilers (CS 421) Sasa Misailovic 4110 SC, UIUC https://courses.engr.illinois.edu/cs421/fa2017/cs421a Based in part on slides by Mattox Beckman, as updated by Vikram Adve, Gul
More informationPropositional Logic: Semantics and an Example
Propositional Logic: Semantics and an Example CPSC 322 Logic 2 Textbook 5.2 Propositional Logic: Semantics and an Example CPSC 322 Logic 2, Slide 1 Lecture Overview 1 Recap: Syntax 2 Propositional Definite
More informationQuadratic Equations Part I
Quadratic Equations Part I Before proceeding with this section we should note that the topic of solving quadratic equations will be covered in two sections. This is done for the benefit of those viewing
More informationDesigning Information Devices and Systems I Spring 2019 Lecture Notes Note 3
EECS 6A Designing Information Devices and Systems I Spring 209 Lecture Notes Note 3 3. Linear Dependence Recall the simple tomography example from Note, in which we tried to determine the composition of
More information146 Philosophy of Physics: Quantum Mechanics
Superposition http://philosophy.ucsd.edu/faculty/wuthrich/ 146 Philosophy of Physics: Quantum Mechanics Quantum superposition: Setting things up David Z Albert, Quantum Mechanics and Experience, Harvard
More informationChapter 2. Mathematical Reasoning. 2.1 Mathematical Models
Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................
More information( )( b + c) = ab + ac, but it can also be ( )( a) = ba + ca. Let s use the distributive property on a couple of
Factoring Review for Algebra II The saddest thing about not doing well in Algebra II is that almost any math teacher can tell you going into it what s going to trip you up. One of the first things they
More informationModal Logics. Most applications of modal logic require a refined version of basic modal logic.
Modal Logics Most applications of modal logic require a refined version of basic modal logic. Definition. A set L of formulas of basic modal logic is called a (normal) modal logic if the following closure
More informationChapter 4. Solving Systems of Equations. Chapter 4
Solving Systems of Equations 3 Scenarios for Solutions There are three general situations we may find ourselves in when attempting to solve systems of equations: 1 The system could have one unique solution.
More informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
More informationSection 3.1: Direct Proof and Counterexample 1
Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion
More informationDescriptive Statistics (And a little bit on rounding and significant digits)
Descriptive Statistics (And a little bit on rounding and significant digits) Now that we know what our data look like, we d like to be able to describe it numerically. In other words, how can we represent
More informationAlex s Guide to Word Problems and Linear Equations Following Glencoe Algebra 1
Alex s Guide to Word Problems and Linear Equations Following Glencoe Algebra 1 What is a linear equation? It sounds fancy, but linear equation means the same thing as a line. In other words, it s an equation
More information1.10 Continuity Brian E. Veitch
1.10 Continuity Definition 1.5. A function is continuous at x = a if 1. f(a) exists 2. lim x a f(x) exists 3. lim x a f(x) = f(a) If any of these conditions fail, f is discontinuous. Note: From algebra
More informationDesigning Information Devices and Systems I Spring 2018 Lecture Notes Note 3
EECS 16A Designing Information Devices and Systems I Spring 2018 Lecture Notes Note 3 3.1 Linear Dependence Recall the simple tomography example from Note 1, in which we tried to determine the composition
More informationMust... stay... strong!
Alex Goebel 620 Spring 2016 Paper Presentation of von Fintel & Gillies (2010) Synopsis Must... stay... strong! Von Fintel & Gillies (vf&g) argue against a weakened semantics of must and propose an alternative
More informationUsing Exploration and Technology to Teach Graph Translations
Using Eploration and Technology to Teach Graph Translations Rutgers Precalculus Conference March 16, 2018 Frank Forte Raritan Valley Community College Opening Introduction Motivation learning the alphabet
More informationMain topics for the First Midterm Exam
Main topics for the First Midterm Exam The final will cover Sections.-.0, 2.-2.5, and 4.. This is roughly the material from first three homeworks and three quizzes, in addition to the lecture on Monday,
More information!t + U " #Q. Solving Physical Problems: Pitfalls, Guidelines, and Advice
Solving Physical Problems: Pitfalls, Guidelines, and Advice Some Relations in METR 420 There are a relatively small number of mathematical and physical relations that we ve used so far in METR 420 or that
More informationProof Techniques (Review of Math 271)
Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil
More informationT Reactive Systems: Temporal Logic LTL
Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Temporal Logic LTL Spring 2005, Lecture 4 January 31, 2005 Tik-79.186 Reactive Systems 2 Temporal Logics Temporal logics are currently the most
More information6.080 / Great Ideas in Theoretical Computer Science Spring 2008
MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationMATH 115, SUMMER 2012 LECTURE 12
MATH 115, SUMMER 2012 LECTURE 12 JAMES MCIVOR - last time - we used hensel s lemma to go from roots of polynomial equations mod p to roots mod p 2, mod p 3, etc. - from there we can use CRT to construct
More informationConfidence intervals
Confidence intervals We now want to take what we ve learned about sampling distributions and standard errors and construct confidence intervals. What are confidence intervals? Simply an interval for which
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 informationReasoning About Imperative Programs. COS 441 Slides 10b
Reasoning About Imperative Programs COS 441 Slides 10b Last time Hoare Logic: { P } C { Q } Agenda If P is true in the initial state s. And C in state s evaluates to s. Then Q must be true in s. Program
More informationMATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST
MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST JAMES MCIVOR Today we enter Chapter 2, which is the heart of this subject. Before starting, recall that last time we saw the integers have unique factorization
More informationPhysics 6A Lab Experiment 6
Rewritten Biceps Lab Introduction This lab will be different from the others you ve done so far. First, we ll have some warmup exercises to familiarize yourself with some of the theory, as well as the
More informationChapter 5 Integrals. 5.1 Areas and Distances
Chapter 5 Integrals 5.1 Areas and Distances We start with a problem how can we calculate the area under a given function ie, the area between the function and the x-axis? If the curve happens to be something
More informationSolution to Proof Questions from September 1st
Solution to Proof Questions from September 1st Olena Bormashenko September 4, 2011 What is a proof? A proof is an airtight logical argument that proves a certain statement in general. In a sense, it s
More informationCM10196 Topic 2: Sets, Predicates, Boolean algebras
CM10196 Topic 2: Sets, Predicates, oolean algebras Guy McCusker 1W2.1 Sets Most of the things mathematicians talk about are built out of sets. The idea of a set is a simple one: a set is just a collection
More informationTheFourierTransformAndItsApplications-Lecture28
TheFourierTransformAndItsApplications-Lecture28 Instructor (Brad Osgood):All right. Let me remind you of the exam information as I said last time. I also sent out an announcement to the class this morning
More informationCHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC
1 CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC Here, you ll learn: what it means for a logic system to be finished some strategies for constructing proofs Congratulations! Our system of
More informationCS 301. Lecture 18 Decidable languages. Stephen Checkoway. April 2, 2018
CS 301 Lecture 18 Decidable languages Stephen Checkoway April 2, 2018 1 / 26 Decidable language Recall, a language A is decidable if there is some TM M that 1 recognizes A (i.e., L(M) = A), and 2 halts
More informationKB Agents and Propositional Logic
Plan Knowledge-Based Agents Logics Propositional Logic KB Agents and Propositional Logic Announcements Assignment2 mailed out last week. Questions? Knowledge-Based Agents So far, what we ve done is look
More informationMajor Ideas in Calc 3 / Exam Review Topics
Major Ideas in Calc 3 / Exam Review Topics Here are some highlights of the things you should know to succeed in this class. I can not guarantee that this list is exhaustive!!!! Please be sure you are able
More informationThe Adjoint Functor Theorem.
The Adjoint Functor Theorem. Kevin Buzzard February 7, 2012 Last modified 17/06/2002. 1 Introduction. The existence of free groups is immediate from the Adjoint Functor Theorem. Whilst I ve long believed
More information1 Continuity and Limits of Functions
Week 4 Summary This week, we will move on from our discussion of sequences and series to functions. Even though sequences and functions seem to be very different things, they very similar. In fact, we
More informationMath 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes
Math 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes Written by Santiago Cañez These are notes which provide a basic summary of each lecture for Math 300, Foundations of Higher
More informationAxiomatic systems. Revisiting the rules of inference. Example: A theorem and its proof in an abstract axiomatic system:
Axiomatic systems Revisiting the rules of inference Material for this section references College Geometry: A Discovery Approach, 2/e, David C. Kay, Addison Wesley, 2001. In particular, see section 2.1,
More informationMath 31 Lesson Plan. Day 16: Review; Start Section 8. Elizabeth Gillaspy. October 18, Supplies needed: homework. Colored chalk. Quizzes!
Math 31 Lesson Plan Day 16: Review; Start Section 8 Elizabeth Gillaspy October 18, 2011 Supplies needed: homework Colored chalk Quizzes! Goals for students: Students will: improve their understanding of
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 informationReasoning Under Uncertainty: Introduction to Probability
Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1 Textbook 6.1 Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 1 Lecture Overview 1
More informationNo Solution Equations Let s look at the following equation: 2 +3=2 +7
5.4 Solving Equations with Infinite or No Solutions So far we have looked at equations where there is exactly one solution. It is possible to have more than solution in other types of equations that are
More informationMA103 STATEMENTS, PROOF, LOGIC
MA103 STATEMENTS, PROOF, LOGIC Abstract Mathematics is about making precise mathematical statements and establishing, by proof or disproof, whether these statements are true or false. We start by looking
More information9. TRANSFORMING TOOL #2 (the Multiplication Property of Equality)
9 TRANSFORMING TOOL # (the Multiplication Property of Equality) a second transforming tool THEOREM Multiplication Property of Equality In the previous section, we learned that adding/subtracting the same
More informationPhysics 6A Lab Experiment 6
Biceps Muscle Model Physics 6A Lab Experiment 6 Introduction This lab will begin with some warm-up exercises to familiarize yourself with the theory, as well as the experimental setup. Then you ll move
More informationMath101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2:
Math101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2: 03 17 08 3 All about lines 3.1 The Rectangular Coordinate System Know how to plot points in the rectangular coordinate system. Know the
More informationMath 54 Homework 3 Solutions 9/
Math 54 Homework 3 Solutions 9/4.8.8.2 0 0 3 3 0 0 3 6 2 9 3 0 0 3 0 0 3 a a/3 0 0 3 b b/3. c c/3 0 0 3.8.8 The number of rows of a matrix is the size (dimension) of the space it maps to; the number of
More information3 Finite continued fractions
MTH628 Number Theory Notes 3 Spring 209 3 Finite continued fractions 3. Introduction Let us return to the calculation of gcd(225, 57) from the preceding chapter. 225 = 57 + 68 57 = 68 2 + 2 68 = 2 3 +
More informationLet us first give some intuitive idea about a state of a system and state transitions before describing finite automata.
Finite Automata Automata (singular: automation) are a particularly simple, but useful, model of computation. They were initially proposed as a simple model for the behavior of neurons. The concept of a
More informationGuest Speaker. CS 416 Artificial Intelligence. First-order logic. Diagnostic Rules. Causal Rules. Causal Rules. Page 1
Page 1 Guest Speaker CS 416 Artificial Intelligence Lecture 13 First-Order Logic Chapter 8 Topics in Optimal Control, Minimax Control, and Game Theory March 28 th, 2 p.m. OLS 005 Onesimo Hernandez-Lerma
More informationPredicate Logic. Predicates. Math 173 February 9, 2010
Math 173 February 9, 2010 Predicate Logic We have now seen two ways to translate English sentences into mathematical symbols. We can capture the logical form of a sentence using propositional logic: variables
More informationLectures 11-13: From Work to Energy Energy Conservation
Physics 218: sect.513-517 Lectures 11-13: From Work to Energy Energy Conservation Prof. Ricardo Eusebi for Igor Roshchin 1 Physics 218: sect.513-517 Energy and Work-Energy relationship Prof. Ricardo Eusebi
More informationMath Lecture 3 Notes
Math 1010 - Lecture 3 Notes Dylan Zwick Fall 2009 1 Operations with Real Numbers In our last lecture we covered some basic operations with real numbers like addition, subtraction and multiplication. This
More informationDiscrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction
CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 3 This lecture covers further variants of induction, including strong induction and the closely related wellordering axiom. We then apply these
More informationIntroduction to Semantics. The Formalization of Meaning 1
The Formalization of Meaning 1 1. Obtaining a System That Derives Truth Conditions (1) The Goal of Our Enterprise To develop a system that, for every sentence S of English, derives the truth-conditions
More informationPropositional and Predicate Logic
8/24: pp. 2, 3, 5, solved Propositional and Predicate Logic CS 536: Science of Programming, Spring 2018 A. Why Reviewing/overviewing logic is necessary because we ll be using it in the course. We ll be
More informationMatrix Multiplication
Matrix Multiplication Given two vectors a = [a 1,..., a k ] and b = [b 1,..., b k ], their inner product (or dot product) is a b = k i=1 a ib i [1, 2, 3] [ 2, 4, 6] = (1 2) + (2 4) + (3 6) = 24. We can
More information8. TRANSFORMING TOOL #1 (the Addition Property of Equality)
8 TRANSFORMING TOOL #1 (the Addition Property of Equality) sentences that look different, but always have the same truth values What can you DO to a sentence that will make it LOOK different, but not change
More informationMathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers
Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur Lecture 1 Real Numbers In these lectures, we are going to study a branch of mathematics called
More informationClassical Planning. Content. 16. dubna Definition Conceptual Model Methodology of Planners STRIPS PDDL
Classical Planning Radek Mařík CVUT FEL, K13132 16. dubna 24 Radek Mařík (marikr@fel.cvut.cz) Classical Planning 16. dubna 24 1 / 77 Content 1 Concept of AI Planning Definition Conceptual Model Methodology
More information1 / 9. Due Friday, May 11 th at 2:30PM. There is no checkpoint problem. CS103 Handout 30 Spring 2018 May 4, 2018 Problem Set 5
1 / 9 CS103 Handout 30 Spring 2018 May 4, 2018 Problem Set 5 This problem set the last one purely on discrete mathematics is designed as a cumulative review of the topics we ve covered so far and a proving
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 informationMath 231E, Lecture 13. Area & Riemann Sums
Math 23E, Lecture 3. Area & Riemann Sums Motivation for Integrals Question. What is an integral, and why do we care? Answer. A tool to compute a complicated expression made up of smaller pieces. Example.
More informationDirect Proofs. the product of two consecutive integers plus the larger of the two integers
Direct Proofs A direct proof uses the facts of mathematics and the rules of inference to draw a conclusion. Since direct proofs often start with premises (given information that goes beyond the facts of
More informationFrom Probability, For the Enthusiastic Beginner (Draft version, March 2016) David Morin,
Chapter 2 Probability From Probability, For the Enthusiastic Beginner (Draft version, March 2016 David Morin, morin@physics.harvard.edu Having learned in Chapter 1 how to count things, we can now talk
More information