Introduction to Artificial Intelligence. Planning
|
|
|
- Brian McKinney
- 7 years ago
- Views:
Transcription
1 Introduction to Artificial Intelligence Planning Bernhard Beckert UNIVERSITÄT KOBLENZ-LANDAU Summer Term 2003 B. Beckert: Einführung in die KI / KI für IM p.1
2 Outline Search vs. planning STRIPS operators Partial-order planning The real world Conditional planning Monitoring and replanning B. Beckert: Einführung in die KI / KI für IM p.2
3 Search vs. Planning Consider the following task Get milk, bananas, and a cordless drill Standard search algorithms seem to fail miserably Talk to Parrot Go To Pet Store Buy a Dog Go To School Go To Class Start Go To Supermarket Buy Tuna Fish Go To Sleep Buy Arugula Read A Book Buy Milk... Finish Sit in Chair Sit Some More Etc. Etc Read A Book B. Beckert: Einführung in die KI / KI für IM p.3
4 Search vs. Planning Actions have requirements & consequences that should constrain applicability in a given state stronger interaction between actions and states needed Most parts of the world are independent of most other parts solve subgoals independently Human beings plan goal-directed; they construct important intermediate solutions first flexible sequence for construction of solution B. Beckert: Einführung in die KI / KI für IM p.4
5 Search vs. Planning Planning systems do the following Unify action and goal representation to allow selection (use logical language for both) Divide-and-conquer by subgoaling Relax requirement for sequential construction of solutions B. Beckert: Einführung in die KI / KI für IM p.5
6 STRIPS STRIPS STandford Research Institute Problem Solver Tidily arranged actions descriptions Restricted language (function-free literals) Efficient algorithms B. Beckert: Einführung in die KI / KI für IM p.6
7 STRIPS: States States represented by: Conjunction of ground (function-free) atoms Example At Home Have Bread Closed world assumption Atoms that are not present are assumed to be false Example State: At Home Have Bread Implicitly: Have Milk Have Bananas Have Drill B. Beckert: Einführung in die KI / KI für IM p.7
8 STRIPS: Operators Operator description consists of: Action name Positive literal Buy Milk Precondition Conjunction of positive literals At Shop Sells Shop Milk Effect Conjunction of literals Have Milk Operator schema Operator containing variables At(p) Sells(p,x) Buy(x) Have(x) B. Beckert: Einführung in die KI / KI für IM p.8
9 STRIPS: Operator Application Operator applicability Operator o applicable in state s if: there is substitution Subst of the free variables such that Subst precond o s Example Buy x is applicable in state At Shop Sells Shop Milk Have Bread with substitution Subst p Shop x Milk At(p) Sells(p,x) Buy(x) Have(x) B. Beckert: Einführung in die KI / KI für IM p.9
10 STRIPS: Operator Application Resulting state Computed from old state and literals in Subst effect Positive literals are added to the state Negative literals are removed from the state All other literals remain unchanged (avoids the frame problem) Formally s s P P a positive atom P Subst effect o P P a positive atom P Subst effect o B. Beckert: Einführung in die KI / KI für IM p.10
11 STRIPS: Operator Application Example Application of to state Drive a b precond: At a Road a b effect: At b At a At Koblenz Road Koblenz Landau results in At Landau Road Koblenz Landau B. Beckert: Einführung in die KI / KI für IM p.11
12 State Space vs. Plan Space Planning problem Find a sequence of actions that make instance of the goal true Nodes in search space Standard search: Planning search: node = concrete world state node = partial plan (Partial) Plan consists of Set of operator applications S i Partial (temporal) order constraints S i S j Causal links S i c S j Meaning: S i achieves c precond S j (record purpose of steps) B. Beckert: Einführung in die KI / KI für IM p.12
13 State Space vs. Plan Space Operators on partial plans add an action and a causal link to achieve an open condition add a causal link from an existing action to an open condition add an order constraint to order one step w.r.t. another Open condition A precondition of an action not yet causally linked Note We move from incomplete/vague plans to complete, correct plans B. Beckert: Einführung in die KI / KI für IM p.13
14 Partially Ordered Plans Start Start Left Sock Right Sock LeftShoeOn, RightShoeOn Finish LeftSockOn Left Shoe RightSockOn Right Shoe LeftShoeOn, RightShoeOn Special steps with empty action Finish Start Finish no precond, initial assumptions as effect) goal as precond, no effect Note Different paths in partial plan are not alternative plans, but alternative sequences of actions B. Beckert: Einführung in die KI / KI für IM p.14
15 Partially Ordered Plans Complete plan A plan is complete iff every precondition is achieved A precondition c of a step S j is achieved (by S i ) if S i c S j effect S i there is no S k with S i S k S j and c effect S k (otherwise S k is called a clobberer or threat) Clobberer / threat A potentially intervening step that destroys the condition achieved by a causal link B. Beckert: Einführung in die KI / KI für IM p.15
16 Clobbering and Promotion/Demotion Example Go Home clobbers At HWS Go(HWS) DEMOTION Demotion Put before Go HWS At(HWS) Buy(Drill) Go(Home) At(Home) Promotion Put after Buy Drill PROMOTION At(Home) Finish B. Beckert: Einführung in die KI / KI für IM p.16
17 Example: Blocks world "Sussman anomaly" problem A B C A B C Start State Goal State Clear(x) On(x,z) Clear(y) PutOn(x,y) ~On(x,z) ~Clear(y) Clear(z) On(x,y) Clear(x) On(x,z) PutOnTable(x) ~On(x,z) Clear(z) On(x,Table) + several inequality constraints B. Beckert: Einführung in die KI / KI für IM p.17
18 Example: Blocks World START On(C,A) On(A,Table) Cl(B) On(B,Table) Cl(C) B C A On(A,B) On(B,C) FINISH A B C B. Beckert: Einführung in die KI / KI für IM p.18
19 Example: Blocks World START On(C,A) On(A,Table) Cl(B) On(B,Table) Cl(C) B C A Cl(B) On(B,z) Cl(C) PutOn(B,C) On(A,B) On(B,C) FINISH A B C B. Beckert: Einführung in die KI / KI für IM p.18
20 Example: Blocks World START On(C,A) On(A,Table) Cl(B) On(B,Table) Cl(C) B C A PutOn(A,B) clobbers Cl(B) => order after PutOn(B,C) Cl(A) On(A,z) Cl(B) PutOn(A,B) Cl(B) On(B,z) Cl(C) PutOn(B,C) On(A,B) On(B,C) FINISH A B C B. Beckert: Einführung in die KI / KI für IM p.18
21 Example: Blocks World START On(C,A) On(A,Table) Cl(B) On(B,Table) Cl(C) B C A On(C,z) Cl(C) PutOnTable(C) Cl(A) On(A,z) Cl(B) PutOn(A,B) Cl(B) On(B,z) Cl(C) PutOn(B,C) PutOn(A,B) clobbers Cl(B) => order after PutOn(B,C) PutOn(B,C) clobbers Cl(C) => order after PutOnTable(C) On(A,B) On(B,C) FINISH A B C B. Beckert: Einführung in die KI / KI für IM p.18
22 POP Algorithm (Cont d) procedure CHOOSE-OPERATOR(plan, operators, S need, c) choose a step S add from operators or STEPS( plan) that has c as an effect if there is no such step then fail add the causal link S add c S need to LINKS( plan) add the ordering constraint S add S need to ORDERINGS( plan) if S add is a newly added step from operators then add S add to STEPS( plan) add Start S add Finish to ORDERINGS( plan) B. Beckert: Einführung in die KI / KI für IM p.20
23 POP Algorithm (Cont d) procedure RESOLVE-THREATS(plan) for each S threat that threatens a link S i c S j in LINKS( plan) do choose either Demotion: Add S threat Promotion: Add S j if not CONSISTENT( plan) then fail end S i to ORDERINGS( plan) S threat to ORDERINGS( plan) B. Beckert: Einführung in die KI / KI für IM p.21
24 Properties of POP Non-deterministic search for plan, backtracks over choicepoints on failure: choice of S add to achieve S need choice of promotion or demotion for clobberer Sound and complete There are extensions for: disjunction, universal quantification, negation, conditionals Efficient with good heuristics from problem description But: very sensitive to subgoal ordering Good for problems with loosely related subgoals B. Beckert: Einführung in die KI / KI für IM p.22
25 The Real World On(x) ~Flat(x) START FINISH ~Flat(Spare) Intact(Spare) Off(Spare) On(Tire1) Flat(Tire1) On(x) Remove(x) Off(x) ClearHub Off(x) ClearHub Puton(x) On(x) ~ClearHub Intact(x) Flat(x) Inflate(x) ~Flat(x) B. Beckert: Einführung in die KI / KI für IM p.23
26 Things Go Wrong Incomplete information Unknown preconditions Example: Intact Spare? Disjunctive effects Example: Incorrect information Inflate x causes Inflated x SlowHiss x Burst x BrokenPump Current state incorrect Example: spare NOT intact Missing/incorrect postconditions in operators Qualification problem Can never finish listing all the required preconditions and possible conditional outcomes of actions B. Beckert: Einführung in die KI / KI für IM p.24
27 Solutions Conditional planning Plan to obtain information (observation actions) Subplan for each contingency Example: Check Tire1 If Intact Tire1 Inflate Tire1 CallHelp Disadvantage: Expensive because it plans for many unlikely cases Monitoring/Replanning Assume normal states / outcomes Check progress during execution, replan if necessary Disadvantage: Unanticipated outcomes may lead to failure B. Beckert: Einführung in die KI / KI für IM p.25
28 Conditional Planning Execution of conditional plan If p thenplan elseplan Check p against current knowledge base, execute thenplan or elseplan Conditional planning Just like POP except: If an open condition can be established by observation action add the action to the plan complete plan for each possible observation outcome insert conditional step with these subplans CheckTire(x) KnowsIf(Intact(x)) B. Beckert: Einführung in die KI / KI für IM p.26
29 Conditional Planning Example Start On(Tire1) Flat(Tire1) Inflated(Spare) On( x ) Inflated( x ) Finish (True) B. Beckert: Einführung in die KI / KI für IM p.27
30 Conditional Planning Example Start On(Tire1) Flat(Tire1) Inflated(Spare) Flat(Tire1) Intact(Tire1) Inflate(Tire1) (Intact(Tire1)) Tire1 On( x ) Tire1 Inflated( x ) Finish (True) B. Beckert: Einführung in die KI / KI für IM p.27
31 Conditional Planning Example Start On(Tire1) Flat(Tire1) Inflated(Spare) Check(Tire1) Intact(Tire1) Flat(Tire1) Intact(Tire1) Inflate(Tire1) (Intact(Tire1)) Tire1 On( x ) Tire1 Inflated( x ) Finish (True) (Intact(Tire1)) B. Beckert: Einführung in die KI / KI für IM p.27
32 L Conditional Planning Example Start On(Tire1) Flat(Tire1) Inflated(Spare) Check(Tire1) Intact(Tire1) Flat(Tire1) Intact(Tire1) Inflate(Tire1) (Intact(Tire1)) Tire1 On( x ) Tire1 Inflated( x ) Finish (True) (Intact(Tire1)) On( x ) Finish Inflated( x ) ( Intact(Tire1)) B. Beckert: Einführung in die KI / KI für IM p.27
33 L Conditional Planning Example Start On(Tire1) Flat(Tire1) Inflated(Spare) Check(Tire1) Intact(Tire1) Flat(Tire1) Intact(Tire1) Inflate(Tire1) (Intact(Tire1)) Tire1 On( x ) Tire1 Inflated( x ) Finish (True) (Intact(Tire1)) Spare On( x ) Spare Finish Inflated( x ) ( Intact(Tire1)) B. Beckert: Einführung in die KI / KI für IM p.27
34 L L L Conditional Planning Example Start On(Tire1) Flat(Tire1) Inflated(Spare) Check(Tire1) Intact(Tire1) Flat(Tire1) Intact(Tire1) Inflate(Tire1) (Intact(Tire1)) Tire1 On( x ) Tire1 Inflated( x ) Finish (True) (Intact(Tire1)) LIntact(Tire1) Remove(Tire1) ( Intact(Tire1)) Puton(Spare) ( Intact(Tire1)) Spare On( x ) Spare Finish Inflated( x ) ( Intact(Tire1)) B. Beckert: Einführung in die KI / KI für IM p.27
35 Monitoring Execution monitoring Failure: Preconditions of remaining plan not met Action monitoring Failure: Preconditions of next action not met (or action itself fails, e.g., robot bump sensor) Consequence of failure Need to replan B. Beckert: Einführung in die KI / KI für IM p.28
36 Preconditions for Remaining Plan Start At(Home) Go(HWS) At(HWS) Sells(HWS,Drill) Buy(Drill) At(HWS) Go(SM) At(SM) Sells(SM,Milk) At(SM) Sells(SM,Ban.) At(HWS) Have(Drill) Sells(SM,Ban.) Sells(SM,Milk) Buy(Milk) Buy(Ban.) At(SM) Go(Home) Have(Milk) At(Home) Have(Ban.) Have(Drill) Finish B. Beckert: Einführung in die KI / KI für IM p.29
37 Replanning Simplest On failure, replan from scratch Better Plan to get back on track by reconnecting to best continuation Failure B. Beckert: Einführung in die KI / KI für IM p.30
38 Replanning: Example PRECONDITIONS FAILURE RESPONSE START Color(Chair,Blue) ~Have(Red) Get(Red) Have(Red) Paint(Red) Color(Chair,Red) FINISH none Have(Red) Color(Chair,Red) N/A Fetch more red Repaint B. Beckert: Einführung in die KI / KI für IM p.31
39 Summary Planning Differs from general problem search; subgoals solved independently STRIPS: restricted format for actions, logic-based Nodes in search space are partial plans POP algorithm Standard planning cannot cope with incomplete/incorrect information Conditional planning with sensing actions to complete information; expensive at planning stage Replanning based on monitoring of plan execution; expensive at execution stage B. Beckert: Einführung in die KI / KI für IM p.32
Outline. Planning. Search vs. Planning. Search vs. Planning Cont d. Search vs. planning. STRIPS operators Partial-order planning.
Outline Searh vs. planning Planning STRIPS operators Partial-order planning Chapter 11 Artifiial Intelligene, lp4 2005/06, Reiner Hähnle, partly based on AIMA Slides Stuart Russell and Peter Norvig, 1998
Partial-Order Planning Algorithms
6.825 Techniques in Artificial Intelligence Partial-Order Planning Algorithms Lecture 11 1 Last time we talked about partial order planning, and we got through the basic idea and the formal description
Introduction to Planning
Introduction to Planning Course: CS40022 Instructor: Dr. Pallab Dasgupta Department of Computer Science & Engineering Indian Institute of Technology Kharagpur Outline Planning versus Search Representation
In which we see how an agent can take advantage of the structure of a problem to construct complex plans of action.
11 PLANNING In which we see how an agent can take advantage of the structure of a problem to construct complex plans of action. CLASSICAL PLANNING The task of coming up with a sequence of actions that
Plan-Space Search. Searching for a Solution Plan in a Graph of Partial Plans
Plan-Space Search Searching for a Solution Plan in a Graph of Partial Plans Literature Malik Ghallab, Dana Nau, and Paolo Traverso. Automated Planning Theory and Practice, chapter 2 and 5. Elsevier/Morgan
Introduction to Artificial Intelligence. Intelligent Agents
Introduction to Artificial Intelligence Intelligent Agents Bernhard Beckert UNIVERSITÄT KOBLENZ-LANDAU Winter Term 2004/2005 B. Beckert: KI für IM p.1 Outline Agents and environments PEAS (Performance,
Hybrid Planning in Cyber Security Applications
Louisa Pragst 20. November 2013 Hybrid Planning in Cyber Security Applications Bachelor Thesis 2 Hybrid Planning in Cyber Security Applications Introduction Overview Transformation of a POCL domain into
AN AI PLANNING APPROACH FOR GENERATING BIG DATA WORKFLOWS
AN AI PLANNING APPROACH FOR GENERATING BIG DATA WORKFLOWS Wesley Deneke 1, Wing-Ning Li 2, and Craig Thompson 2 1 Computer Science and Industrial Technology Department, Southeastern Louisiana University,
Introduction. Real World Planning. Planning with Time. Time 15/11/2012. COMP219: Artificial Intelligence. COMP219: Artificial Intelligence
COMP219: Artificial Intelligence COMP219: Artificial Intelligence Dr. Annabel Latham Room 2.05 Ashton Building Department of Computer Science University of Liverpool Lecture 26: Real World Planning: Scheduling
Threat-Removal Strategies for Partial-Order Planning
In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), 993 Threat-Removal Strategies for Partial-Order Planning Mark A Peot Department of Engineering-Economic Systems
Management and optimization of multiple supply chains
Management and optimization of multiple supply chains J. Dorn Technische Universität Wien, Institut für Informationssysteme Paniglgasse 16, A-1040 Wien, Austria Phone ++43-1-58801-18426, Fax ++43-1-58801-18494
Satisfiability Checking
Satisfiability Checking SAT-Solving Prof. Dr. Erika Ábrahám Theory of Hybrid Systems Informatik 2 WS 10/11 Prof. Dr. Erika Ábrahám - Satisfiability Checking 1 / 40 A basic SAT algorithm Assume the CNF
Dynamic Temporal Planning for Multirobot Systems
Dynamic Temporal Planning for Multirobot Systems C. Ugur Usug and Sanem Sarıel-Talay {usugc,sariel}@itu.edu.tr Istanbul Technical University Artificial Intelligence and Robotics Laboratory (AIR http://air.cs.itu.edu.tr
Problems, Methods and Tools of Advanced Constrained Scheduling
Problems, Methods and Tools of Advanced Constrained Scheduling Victoria Shavyrina, Spider Project Team Shane Archibald, Archibald Associates Vladimir Liberzon, Spider Project Team 1. Introduction In this
Data exchange. L. Libkin 1 Data Integration and Exchange
Data exchange Source schema, target schema; need to transfer data between them. A typical scenario: Two organizations have their legacy databases, schemas cannot be changed. Data from one organization
Measuring the Performance of an Agent
25 Measuring the Performance of an Agent The rational agent that we are aiming at should be successful in the task it is performing To assess the success we need to have a performance measure What is rational
2. The Language of First-order Logic
2. The Language of First-order Logic KR & R Brachman & Levesque 2005 17 Declarative language Before building system before there can be learning, reasoning, planning, explanation... need to be able to
Verifying Semantic of System Composition for an Aspect-Oriented Approach
2012 International Conference on System Engineering and Modeling (ICSEM 2012) IPCSIT vol. 34 (2012) (2012) IACSIT Press, Singapore Verifying Semantic of System Composition for an Aspect-Oriented Approach
Demonstrating WSMX: Least Cost Supply Management
Demonstrating WSMX: Least Cost Supply Management Eyal Oren 2, Alexander Wahler 1, Bernhard Schreder 1, Aleksandar Balaban 1, Michal Zaremba 2, and Maciej Zaremba 2 1 NIWA Web Solutions, Vienna, Austria
Figure 4-1 Price Quantity Quantity Per Pair Demanded Supplied $ 2 18 3 $ 4 14 4 $ 6 10 5 $ 8 6 6 $10 2 8
Econ 101 Summer 2005 In-class Assignment 2 & HW3 MULTIPLE CHOICE 1. A government-imposed price ceiling set below the market's equilibrium price for a good will produce an excess supply of the good. a.
Logic in general. Inference rules and theorem proving
Logical Agents Knowledge-based agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledge-based agents Inference engine Knowledge base Domain-independent
Agents: Rationality (2)
Agents: Intro Agent is entity that perceives and acts Perception occurs via sensors Percept is one unit of sensory input Percept sequence is complete history of agent s percepts In general, agent s actions
InvGen: An Efficient Invariant Generator
InvGen: An Efficient Invariant Generator Ashutosh Gupta and Andrey Rybalchenko Max Planck Institute for Software Systems (MPI-SWS) Abstract. In this paper we present InvGen, an automatic linear arithmetic
Linear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
Data Validation with OWL Integrity Constraints
Data Validation with OWL Integrity Constraints (Extended Abstract) Evren Sirin Clark & Parsia, LLC, Washington, DC, USA evren@clarkparsia.com Abstract. Data validation is an important part of data integration
Scheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
Questions? Assignment. Techniques for Gathering Requirements. Gathering and Analysing Requirements
Questions? Assignment Why is proper project management important? What is goal of domain analysis? What is the difference between functional and non- functional requirements? Why is it important for requirements
Project Time Management
Project Time Management Plan Schedule Management is the process of establishing the policies, procedures, and documentation for planning, developing, managing, executing, and controlling the project schedule.
FUNDAMENTALS OF ARTIFICIAL INTELLIGENCE KNOWLEDGE REPRESENTATION AND NETWORKED SCHEMES
Riga Technical University Faculty of Computer Science and Information Technology Department of Systems Theory and Design FUNDAMENTALS OF ARTIFICIAL INTELLIGENCE Lecture 7 KNOWLEDGE REPRESENTATION AND NETWORKED
Error recovery in robots through failure reason analysis*
Error recovery in robots through failure reason analysis* by s. SRINIV AS* California Institute of Technology Pasadena, California INTRODUCTION In performing a task, a robot may encounter a variety of
Interactive Timetabling
Interactive Timetabling Tomáš Müller, Roman Barták * Charles University Department of Theoretical Computer Science Malostranské náměstí 2/25, Praha 1, Czech Republic tomas.muller@st.mff.cuni.cz bartak@kti.mff.cuni.cz
Algorithms and Data Structures
Algorithms and Data Structures Part 2: Data Structures PD Dr. rer. nat. habil. Ralf-Peter Mundani Computation in Engineering (CiE) Summer Term 2016 Overview general linked lists stacks queues trees 2 2
Planning Configuration Relocation on the BonFIRE Infrastructure
Planning Configuration Relocation on the BonFIRE Infrastructure Herry Herry and Paul Anderson School of Informatics, University of Edinburgh Edinburgh, UK h.herry@sms.ed.ac.uk, dcspaul@ed.ac.uk Abstract
CS510 Software Engineering
CS510 Software Engineering Propositional Logic Asst. Prof. Mathias Payer Department of Computer Science Purdue University TA: Scott A. Carr Slides inspired by Xiangyu Zhang http://nebelwelt.net/teaching/15-cs510-se
UML TUTORIALS THE USE CASE MODEL
UML TUTORIALS THE USE CASE MODEL www.sparxsystems.com.au Sparx Systems 2004 Page 1/5 describes the proposed functionality of the new system. A Use Case represents a discrete unit of interaction between
AN INTEGRATED LIFE CYCLE FOR WORKFLOW MANAGEMENT BASED ON LEARNING AND PLANNING
Electronic version of an article published as: International Journal of Cooperative Information Systems (IJCIS), Volume: 15, Issue: 4 (2006) pp. 485-505 DOI: 10.1142/S0218843006001463 c World Scientific
Data Masking and Data Migration
Product Description March 2014 Contents INTRODUCTION... 3 DATA MASKING... 4 Introduction... 4 Data Masking What it Does... 4 How it Works... 5 Pre-Processing Activities... 5 Post-Processing Activities...
AUTOMATED TEST GENERATION FOR SOFTWARE COMPONENTS
TKK Reports in Information and Computer Science Espoo 2009 TKK-ICS-R26 AUTOMATED TEST GENERATION FOR SOFTWARE COMPONENTS Kari Kähkönen ABTEKNILLINEN KORKEAKOULU TEKNISKA HÖGSKOLAN HELSINKI UNIVERSITY OF
Formal Verification Coverage: Computing the Coverage Gap between Temporal Specifications
Formal Verification Coverage: Computing the Coverage Gap between Temporal Specifications Sayantan Das Prasenjit Basu Ansuman Banerjee Pallab Dasgupta P.P. Chakrabarti Department of Computer Science & Engineering
Topic 2: Structure of Knowledge-Based Systems
Engineering (Ingeniería del Conocimiento) Escuela Politécnica Superior, UAM Course 2007-2008 Topic 2: Structure of -Based Systems Contents 2.1 Components according to the Final User 2.2 Components according
Course Outline Department of Computing Science Faculty of Science. COMP 3710-3 Applied Artificial Intelligence (3,1,0) Fall 2015
Course Outline Department of Computing Science Faculty of Science COMP 710 - Applied Artificial Intelligence (,1,0) Fall 2015 Instructor: Office: Phone/Voice Mail: E-Mail: Course Description : Students
MSc Project Planning
MSc Project Planning Dr Paul Brunn 4 th February 2009 Project Planning and Control Intro to General Methods Some simple examples How to plan and complete an MSc Dissertation project EPS Graduate Education
Mario Guarracino. Data warehousing
Data warehousing Introduction Since the mid-nineties, it became clear that the databases for analysis and business intelligence need to be separate from operational. In this lecture we will review the
Software Modeling and Verification
Software Modeling and Verification Alessandro Aldini DiSBeF - Sezione STI University of Urbino Carlo Bo Italy 3-4 February 2015 Algorithmic verification Correctness problem Is the software/hardware system
Formal Verification of Software
Formal Verification of Software Sabine Broda Department of Computer Science/FCUP 12 de Novembro de 2014 Sabine Broda (DCC-FCUP) Formal Verification of Software 12 de Novembro de 2014 1 / 26 Formal Verification
Software Engineering
Software Engineering Lecture 04: The B Specification Method Peter Thiemann University of Freiburg, Germany SS 2013 Peter Thiemann (Univ. Freiburg) Software Engineering SWT 1 / 50 The B specification method
Optimizing Description Logic Subsumption
Topics in Knowledge Representation and Reasoning Optimizing Description Logic Subsumption Maryam Fazel-Zarandi Company Department of Computer Science University of Toronto Outline Introduction Optimization
Network (Tree) Topology Inference Based on Prüfer Sequence
Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,
Practical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
Unified XML/relational storage March 2005. The IBM approach to unified XML/relational databases
March 2005 The IBM approach to unified XML/relational databases Page 2 Contents 2 What is native XML storage? 3 What options are available today? 3 Shred 5 CLOB 5 BLOB (pseudo native) 6 True native 7 The
Trading the Daniel Code Numbers
Trading the Daniel Code Numbers INTRODUCTION... 2 ABOUT THE DC NUMBERS... 2 BEFORE YOU START... 2 GETTING STARTED... 2 Set-Up Bars... 3 DC Number Sequences... 4 Reversal Signals... 4 DC TRADING METHODOLOGY...
SYSM 6304: Risk and Decision Analysis Lecture 5: Methods of Risk Analysis
SYSM 6304: Risk and Decision Analysis Lecture 5: Methods of Risk Analysis M. Vidyasagar Cecil & Ida Green Chair The University of Texas at Dallas Email: M.Vidyasagar@utdallas.edu October 17, 2015 Outline
Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows
TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents
Course: Programming II - Abstract Data Types. The ADT Stack. A stack. The ADT Stack and Recursion Slide Number 1
Definition Course: Programming II - Abstract Data Types The ADT Stack The ADT Stack is a linear sequence of an arbitrary number of items, together with access procedures. The access procedures permit insertions
KS3 Computing Group 1 Programme of Study 2015 2016 2 hours per week
1 07/09/15 2 14/09/15 3 21/09/15 4 28/09/15 Communication and Networks esafety Obtains content from the World Wide Web using a web browser. Understands the importance of communicating safely and respectfully
Chapter 20: Data Analysis
Chapter 20: Data Analysis Database System Concepts, 6 th Ed. See www.db-book.com for conditions on re-use Chapter 20: Data Analysis Decision Support Systems Data Warehousing Data Mining Classification
SEARCHING AND KNOWLEDGE REPRESENTATION. Angel Garrido
Acta Universitatis Apulensis ISSN: 1582-5329 No. 30/2012 pp. 147-152 SEARCHING AND KNOWLEDGE REPRESENTATION Angel Garrido ABSTRACT. The procedures of searching of solutions of problems, in Artificial Intelligence
Environment Modeling for Automated Testing of Cloud Applications
Environment Modeling for Automated Testing of Cloud Applications Linghao Zhang, Tao Xie, Nikolai Tillmann, Peli de Halleux, Xiaoxing Ma, Jian Lv {lzhang25, txie}@ncsu.edu, {nikolait, jhalleux}@microsoft.com,
Artificial Intelligence
Artificial Intelligence ICS461 Fall 2010 1 Lecture #12B More Representations Outline Logics Rules Frames Nancy E. Reed nreed@hawaii.edu 2 Representation Agents deal with knowledge (data) Facts (believe
Stacks. Linear data structures
Stacks Linear data structures Collection of components that can be arranged as a straight line Data structure grows or shrinks as we add or remove objects ADTs provide an abstract layer for various operations
Linear Programming. April 12, 2005
Linear Programming April 1, 005 Parts of this were adapted from Chapter 9 of i Introduction to Algorithms (Second Edition) /i by Cormen, Leiserson, Rivest and Stein. 1 What is linear programming? The first
What is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
XML Data Integration
XML Data Integration Lucja Kot Cornell University 11 November 2010 Lucja Kot (Cornell University) XML Data Integration 11 November 2010 1 / 42 Introduction Data Integration and Query Answering A data integration
How To Handle Missing Information Without Using NULL
How To Handle Missing Information Without Using NULL Hugh Darwen hd@thethirdmanifesto.com www.thethirdmanifesto.com First presentation: 09 May 2003, Warwick University Updated 27 September 2006 Databases,
THE LOGIC OF ADAPTIVE BEHAVIOR
THE LOGIC OF ADAPTIVE BEHAVIOR Knowledge Representation and Algorithms for Adaptive Sequential Decision Making under Uncertainty in First-Order and Relational Domains Martijn van Otterlo Department of
A static representation for ToonTalk programs
A static representation for ToonTalk programs Mikael Kindborg mikki@ida.liu.se www.ida.liu.se/~mikki Department of Computer and Information Science Linköping University Sweden Abstract Animated and static
Software Verification and Testing. Lecture Notes: Temporal Logics
Software Verification and Testing Lecture Notes: Temporal Logics Motivation traditional programs (whether terminating or non-terminating) can be modelled as relations are analysed wrt their input/output
npsolver A SAT Based Solver for Optimization Problems
npsolver A SAT Based Solver for Optimization Problems Norbert Manthey and Peter Steinke Knowledge Representation and Reasoning Group Technische Universität Dresden, 01062 Dresden, Germany peter@janeway.inf.tu-dresden.de
Introducing Formal Methods. Software Engineering and Formal Methods
Introducing Formal Methods Formal Methods for Software Specification and Analysis: An Overview 1 Software Engineering and Formal Methods Every Software engineering methodology is based on a recommended
Chapter 5 More SQL: Complex Queries, Triggers, Views, and Schema Modification
Chapter 5 More SQL: Complex Queries, Triggers, Views, and Schema Modification Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 5 Outline More Complex SQL Retrieval Queries
Scheduling. Getting Started. Scheduling 79
Scheduling 9 Scheduling An event planner has to juggle many workers completing different tasks, some of which must be completed before others can begin. For example, the banquet tables would need to be
Introduction to Database Management Systems
Database Administration Transaction Processing Why Concurrency Control? Locking Database Recovery Query Optimization DB Administration 1 Transactions Transaction -- A sequence of operations that is regarded
High-Level Robot Control Through Logic
High-Level Robot Control Through Logic Murray Shanahan and Mark Witkowski Department of Electrical and Electronic Engineering, Imperial College, Exhibition Road, London SW7 2BT, England. m.shanahan@ic.ac.uk,
Classnotes 5: 1. Design and Information Flow A data flow diagram (DFD) is a graphical technique that is used to depict information flow, i.e.
Classnotes 5: 1. Design and Information Flow A data flow diagram (DFD) is a graphical technique that is used to depict information flow, i.e., a representation of information as a continuous flow that
CHAPTER 1. Basic Concepts on Planning and Scheduling
CHAPTER 1 Basic Concepts on Planning and Scheduling Scheduling, FEUP/PRODEI /MIEIC 1 Planning and Scheduling: Processes of Decision Making regarding the selection and ordering of activities as well as
Overview Motivating Examples Interleaving Model Semantics of Correctness Testing, Debugging, and Verification
Introduction Overview Motivating Examples Interleaving Model Semantics of Correctness Testing, Debugging, and Verification Advanced Topics in Software Engineering 1 Concurrent Programs Characterized by
Planning with Subdomains and forests
Factored Planning Eyal Amir and Barbara Engelhardt Computer Science Division, University of California at Berkeley Berkeley, CA 94720-1776, USA {eyal,bee}@cs.berkeley.edu Abstract We present a general-purpose
Event Calculus Planning Revisited
Event Calculus Planning Revisited Murray Shanahan Department of Computer Science, Queen Mary and Westfield College, Mile End Road, London E1 4NS, England. Email: mps@dcs.qmw.ac.uk Web: http://www.dcs.qmw.ac.uk/~mps
Sudoku Puzzles Generating: from Easy to Evil
Team # 3485 Page 1 of 20 Sudoku Puzzles Generating: from Easy to Evil Abstract As Sudoku puzzle becomes worldwide popular among many players in different intellectual levels, the task is to devise an algorithm
Coverability for Parallel Programs
2015 http://excel.fit.vutbr.cz Coverability for Parallel Programs Lenka Turoňová* Abstract We improve existing method for the automatic verification of systems with parallel running processes. The technique
A Path to Critical Thinking
2 By Vera Schneider Recommended for grade 1 A Path to Critical Thinking Critical thinking skills are essential to every aspect of learning. Studies show that the earlier these skills are introduced, the
Applied Logic in Engineering
Applied Logic in Engineering Logic Programming Technische Universität München Institut für Informatik Software & Systems Engineering Dr. Maria Spichkova M. Spichkova WS 2012/13: Applied Logic in Engineering
Testing LTL Formula Translation into Büchi Automata
Testing LTL Formula Translation into Büchi Automata Heikki Tauriainen and Keijo Heljanko Helsinki University of Technology, Laboratory for Theoretical Computer Science, P. O. Box 5400, FIN-02015 HUT, Finland
Version Spaces. riedmiller@informatik.uni-freiburg.de
. Machine Learning Version Spaces Prof. Dr. Martin Riedmiller AG Maschinelles Lernen und Natürlichsprachliche Systeme Institut für Informatik Technische Fakultät Albert-Ludwigs-Universität Freiburg riedmiller@informatik.uni-freiburg.de
A Numerical Study on the Wiretap Network with a Simple Network Topology
A Numerical Study on the Wiretap Network with a Simple Network Topology Fan Cheng and Vincent Tan Department of Electrical and Computer Engineering National University of Singapore Mathematical Tools of
Project Scheduling in Software Development
Project Scheduling in Software Development Eric Newby, Raymond Phillips, Dario Fanucchi, Byron Jacobs, Asha Tailor, Lady Kokela, Jesal Kika, Nadine Padiyachi University of the Witwatersrand January 13,
Data Integration: A Theoretical Perspective
Data Integration: A Theoretical Perspective Maurizio Lenzerini Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Via Salaria 113, I 00198 Roma, Italy lenzerini@dis.uniroma1.it ABSTRACT
Operating Systems. Virtual Memory
Operating Systems Virtual Memory Virtual Memory Topics. Memory Hierarchy. Why Virtual Memory. Virtual Memory Issues. Virtual Memory Solutions. Locality of Reference. Virtual Memory with Segmentation. Page
Software Engineering Techniques
Software Engineering Techniques Low level design issues for programming-in-the-large. Software Quality Design by contract Pre- and post conditions Class invariants Ten do Ten do nots Another type of summary
Agreement on. Dual Degree Master Program in Computer Science KAIST. Technische Universität Berlin
Agreement on Dual Degree Master Program in Computer Science between KAIST Department of Computer Science and Technische Universität Berlin Fakultät für Elektrotechnik und Informatik (Fakultät IV) 1 1 Subject
Temporal Logics. Computation Tree Logic
Temporal Logics CTL: definition, relationship between operators, adequate sets, specifying properties, safety/liveness/fairness Modeling: sequential, concurrent systems; maximum parallelism/interleaving
On the Modeling and Verification of Security-Aware and Process-Aware Information Systems
On the Modeling and Verification of Security-Aware and Process-Aware Information Systems 29 August 2011 What are workflows to us? Plans or schedules that map users or resources to tasks Such mappings may
A Review And Evaluations Of Shortest Path Algorithms
A Review And Evaluations Of Shortest Path Algorithms Kairanbay Magzhan, Hajar Mat Jani Abstract: Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing
Constraint-Directed Scheduling for Multi-Storey Building Projects
Constraint-Directed Scheduling for Multi-Storey Building Projects Pasit Lorterapong* and Osama Moselhi** ** Department of Civil Engineering, King Mongkut ' s Institute of Technology Thonburi, Pracha u-tid
PREPARATION GUIDE FOR WRITTEN TESTS
PREPARATION GUIDE FOR WRITTEN TESTS Prepared by: The Department of Administrative Services Human Resources Management August 2004 GENERAL INFORMATION ON WRITTEN TESTS Two types of questions are often used
Formal Engineering for Industrial Software Development
Shaoying Liu Formal Engineering for Industrial Software Development Using the SOFL Method With 90 Figures and 30 Tables Springer Contents Introduction 1 1.1 Software Life Cycle... 2 1.2 The Problem 4 1.3
A MODEL TO SOLVE EN ROUTE AIR TRAFFIC FLOW MANAGEMENT PROBLEM:
A MODEL TO SOLVE EN ROUTE AIR TRAFFIC FLOW MANAGEMENT PROBLEM: A TEMPORAL AND SPATIAL CASE V. Tosic, O. Babic, M. Cangalovic and Dj. Hohlacov Faculty of Transport and Traffic Engineering, University of
The First Law of Robotics (a call to arms)
The First Law of Robotics (a call to arms) Daniel Weld Oren Etzioni Department of Computer Science and Engineering University of Washington Seattle, WA 98195 {weld, etzioni}@cs.washington.edu Abstract
Time Management. Part 5 Schedule Development. Richard Boser
Time Management Part 5 Schedule Development Richard Boser 6.5 Schedule Development Inputs Organizational Process Assets Scope Statement Activity List Activity Attributes Network Diagrams Resource Req ms
Disjunction of Non-Binary and Numeric Constraint Satisfaction Problems
Disjunction of Non-Binary and Numeric Constraint Satisfaction Problems Miguel A. Salido, Federico Barber Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia Camino