Representational Dimensions Computer Science cpsc322, Lecture 2

Slides:



Advertisements
Similar presentations
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Advertisements

Computer Science CPSC 322 Lecture 3 AI Applications.
Decision Theory: Sequential Decisions Computer Science cpsc322, Lecture 34 (Textbook Chpt 9.3) Nov, 28, 2012.
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) Sept, 11, 2013.
Slide 1 Planning: Representation and Forward Search Jim Little UBC CS 322 October 10, 2014 Textbook §8.1 (Skip )- 8.2)
CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) Sept, 6, 2013.
CPSC 502, Lecture 11Slide 1 Introduction to Artificial Intelligence (AI) Computer Science cpsc502, Lecture 11 Oct, 18, 2011.
CPSC 322, Lecture 26Slide 1 Reasoning Under Uncertainty: Belief Networks Computer Science cpsc322, Lecture 27 (Textbook Chpt 6.3) March, 16, 2009.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
Decision Theory: Single Stage Decisions Computer Science cpsc322, Lecture 33 (Textbook Chpt 9.2) March, 30, 2009.
CPSC 322, Lecture 37Slide 1 Finish Markov Decision Processes Last Class Computer Science cpsc322, Lecture 37 (Textbook Chpt 9.5) April, 8, 2009.
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) January, 12, 2009.
CPSC 322, Lecture 18Slide 1 Planning: Heuristics and CSP Planning Computer Science cpsc322, Lecture 18 (Textbook Chpt 8) February, 12, 2010.
CPSC 322, Lecture 10Slide 1 Finish Search Computer Science cpsc322, Lecture 10 (Textbook Chpt 3.6) January, 25, 2010.
CPSC 322, Lecture 30Slide 1 Reasoning Under Uncertainty: Variable elimination Computer Science cpsc322, Lecture 30 (Textbook Chpt 6.4) March, 23, 2009.
CPSC 322, Lecture 3Slide 1 AI Applications Computer Science cpsc322, Lecture 3 January, 9, 2009.
CPSC 322, Lecture 11Slide 1 Constraint Satisfaction Problems (CSPs) Introduction Computer Science cpsc322, Lecture 11 (Textbook Chpt 4.0 – 4.2) January,
CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) January, 6, 2010.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
CPSC 322, Lecture 12Slide 1 CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12 (Textbook Chpt ) January, 29, 2010.
CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) January, 7, 2009.
Representational Dimensions CPSC 322 – Intro 2 January 7, 2011 Textbook §
CPSC 322, Lecture 17Slide 1 Planning: Representation and Forward Search Computer Science cpsc322, Lecture 17 (Textbook Chpt 8.1 (Skip )- 8.2) February,
CPSC 322, Lecture 17Slide 1 Planning: Representation and Forward Search Computer Science cpsc322, Lecture 17 (Textbook Chpt 8.1 (Skip )- 8.2) February,
CPSC 322, Lecture 31Slide 1 Probability and Time: Markov Models Computer Science cpsc322, Lecture 31 (Textbook Chpt 6.5) March, 25, 2009.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) March, 8, 2010.
CPSC 322, Lecture 32Slide 1 Probability and Time: Hidden Markov Models (HMMs) Computer Science cpsc322, Lecture 32 (Textbook Chpt 6.5) March, 27, 2009.
CPSC 322, Lecture 35Slide 1 Value of Information and Control Computer Science cpsc322, Lecture 35 (Textbook Chpt 9.4) April, 14, 2010.
CPSC 322, Lecture 24Slide 1 Reasoning under Uncertainty: Intro to Probability Computer Science cpsc322, Lecture 24 (Textbook Chpt 6.1, 6.1.1) March, 15,
Computer Science CPSC 322 Lecture 3 AI Applications 1.
Slide 1 Constraint Satisfaction Problems (CSPs) Introduction Jim Little UBC CS 322 – CSP 1 September 27, 2014 Textbook §
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) Oct, 26, 2010.
Constraint Satisfaction Problems (CSPs) CPSC 322 – CSP 1 Poole & Mackworth textbook: Sections § Lecturer: Alan Mackworth September 28, 2012.
CPSC 322, Lecture 32Slide 1 Probability and Time: Hidden Markov Models (HMMs) Computer Science cpsc322, Lecture 32 (Textbook Chpt 6.5.2) Nov, 25, 2013.
Reasoning Under Uncertainty: Conditioning, Bayes Rule & the Chain Rule Jim Little Uncertainty 2 Nov 3, 2014 Textbook §6.1.3.
CPSC 322, Lecture 19Slide 1 (finish Planning) Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt – 5.2) Oct,
Computer Science CPSC 322 Lecture 22 Logical Consequences, Proof Procedures (Ch 5.2.2)
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) Sept, 12, 2012.
CPSC 322, Lecture 2Slide 1 Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) Sept, 7, 2012.
Decision Theory: Single & Sequential Decisions. VE for Decision Networks. CPSC 322 – Decision Theory 2 Textbook §9.2 April 1, 2011.
CPSC 322, Lecture 26Slide 1 Reasoning Under Uncertainty: Belief Networks Computer Science cpsc322, Lecture 27 (Textbook Chpt 6.3) Nov, 13, 2013.
Computer Science CPSC 322 Lecture 2 Representational Dimensions, Search Intro 1.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) Oct, 30, 2013.
Constraint Satisfaction Problems (CSPs) Introduction
Computer Science cpsc322, Lecture 4
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
Planning: Forward Planning and CSP Planning
Constraint Satisfaction Problems (CSPs) Introduction
Reasoning Under Uncertainty: Conditioning, Bayes Rule & Chain Rule
Planning: Representation and Forward Search
Planning Under Uncertainty Computer Science cpsc322, Lecture 11
© James D. Skrentny from notes by C. Dyer, et. al.
Decision Theory: Single Stage Decisions
Planning: Heuristics and CSP Planning
Planning: Heuristics and CSP Planning
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
Planning: Representation and Forward Search
Probability and Time: Markov Models
Probability and Time: Markov Models
Planning: Heuristics and CSP Planning
Decision Theory: Sequential Decisions
Decision Theory: Single Stage Decisions
Probability and Time: Markov Models
Logic: Domain Modeling /Proofs + Computer Science cpsc322, Lecture 22
Probability and Time: Markov Models
Domain Splitting CPSC 322 – CSP 4 Textbook §4.6 February 4, 2011.
Planning: Representation and Forward Search
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 7
Presentation transcript:

Representational Dimensions Computer Science cpsc322, Lecture 2 (Textbook Chpt1) May, 16, 2017 Lecture 2 CPSC 322, Lecture 2

Lecture Overview Recap from last lecture Representation and Reasoning An Overview of This Course Further Dimensions of Representational Complexity CPSC 322, Lecture 2

Course Essentials Course web-page : CHECK IT OFTEN! Textbook: Available online! We will cover at least Chapters: 1, 3, 4, 5, 6, 8, 9 Connect: discussion board, grades AIspace : online tools for learning Artificial Intelligence http://aispace.org/ Lecture slides… Midterm exam, planning to have in on Wed Jun 7 (will have a doodle on piazza) Lecture slides DO NOT contain everything that is said in class, but you are still responsible for this content So, make sure you bring yourself up-to-date if you miss a class CPSC 322, Lecture 2

Agents acting in an environment Representation & Reasoning Environment World State / Possible Worlds What do we need to represent? Different problems Different domains For each of those possibly different reasoning techniques CPSC 322, Lecture 2

Lecture Overview Recap from last lecture Representation and Reasoning An Overview of This Course Further Dimensions of Representational Complexity CPSC 322, Lecture 2

What do we need to represent ? The environment /world : What different configurations (states / possible worlds) can the world be in, and how do we denote them? Chessboard, Info about a patient, Robot Location How the world works (we will focus on) Constraints: sum of current into a node = 0 Causal: what are the causes and the effects of brain disorders? Actions preconditions and effects: when can I press this button? What happens if I press it? 2*6+1 to the 64 Causal is restrictive but I think pedagogically adequate: should add definitional? A dog is a mammal How would the world be changed if we were to take some given action: what are the system dynamics? CPSC 322, Lecture 2

Corresponding Reasoning Tasks / Problems Constraint Satisfaction – Find state that satisfies set of constraints. E.g., What is a feasible schedule for final exams? Answering Query – Is a given proposition true/likely given what is known? E.g., Does this patient suffers from viral hepatitis? Planning – Find sequence of actions to reach a goal state / maximize utility. E.g., Navigate through and environment to reach a particular location. Collect gems and avoid monsters Furthermore, the course will consider two main representational dimensions: Does this person has a PhD? How to get a PhD How many actions does the agent need to select? The agent needs to take a single action Solve a problem (e.g., Sudoku) Provide diagnosis for a patient with a disease The agent needs to take a sequence of actions Planning navigate through an environment to reach a goal state (particular location) Assemble/fix a complex machinery/system Bid in online auctions to purchase a desired good CPSC 322, Lecture 2

Representation and Reasoning System A (representation) language in which the environment and how it works can be described Computational (reasoning) procedures to compute a solution to a problem in that environment (an answer, a sequence of actions) Problem => representation => computation A representation and reasoning system (RRS) consists of: flesh out the task and determine what constitutes a solution represent the problem in a language that a computer can reason with use the computer to compute an output, which is an answer presented to a user or a sequence of actions to be carried out in the environment interpret the output as a solution to the problem. (``syntax'') A way to assign meaning to the symbols (``semantics'') But the choice of an appropriate R&R system depends on a key property of the environment and of the agent’s knowledge CPSC 322, Lecture 2

Deterministic vs. Stochastic (Uncertain) Domains Sensing Uncertainty: Can the agent fully observe the current state of the world? Effect Uncertainty: Does the agent knows for sure what the effects of its actions are? Doctor Diagnosis Poker Is the environment deterministic or stochastic? Is the agent's knowledge certain or uncertain? Factory Floor Chess Doctor Treatment CPSC 322, Lecture 2

Clicker Question: Chess and Poker Stochastic if at least one of these is true Sensing Uncertainty: Can the agent fully observe the current state of the world? Effect Uncertainty: Does the agent knows for sure what the effects of its actions are? Poker and Chess are both stochastic Chess is stochastic and Poker is deterministic Chess is deterministic and Poker is stochastic Textbook example: One binary relation and 10 individuals can represents 102=100 propositions and 2100 states! CPSC 322, Lecture 2

Deterministic vs. Stochastic Domains Historically, AI has been divided into two camps: those who prefer representations based on logic and those who prefer probability. A few years ago, CPSC 322 covered logic, while CPSC 422 introduced probability: now we introduce both representational families in 322, and 422 goes into more depth this should give you a better idea of what's included in AI Note: Some of the most exciting current research in AI is actually building bridges between these camps. CPSC 322, Lecture 2

Lecture Overview Recap from last lecture Representation and Reasoning An Overview of This Course Further Dimensions of Representational Complexity CPSC 322, Lecture 2

Modules we'll cover in this course: R&Rsys Environment Stochastic Deterministic Problem Search Arc Consistency Logics STRIPS Vars + Constraints Constraint Satisfaction Static Value Iteration Var. Elimination Belief Nets Decision Nets Markov Processes Query R&R Sys Representation and reasoning Systems Each cell is a R&R system STRIPS actions preconditions and effects Stanford Research Institute Problem Solver Sequential Planning Representation Reasoning Technique CPSC 322, Lecture 2

Lecture Overview Recap from last lecture Representation An Overview of This Course Further Dimensions of Representational Complexity CPSC 322, Lecture 2

Dimensions of Representational Complexity We've already discussed: Problems /Reasoning tasks (Static vs. Sequential ) Deterministic versus stochastic domains Some other important dimensions of complexity: Explicit state or propositions or relations Flat or hierarchical Knowledge given versus knowledge learned from experience Goals versus complex preferences Single-agent vs. multi-agent begin{itemize} % \item \alert{Key point}: ``stochastic world'' can mean that the world itself has stochastic dynamics, that the world is deterministic but imperfectly observed, or that the world has stochastic dynamics \emph{and} is imperfectly observed. %\end{itemize} CPSC 322, Lecture 2

Explicit State or propositions How do we model the environment? You can enumerate the states of the world. A state can be described in terms of features Often it is more natural to describe states in terms of assignments of values to features (variables). 30 binary features (also called propositions) can represent 230= 1,073,741,824 states. Mars Explorer Example Weather Temperature LocX LocY ~10,500,500 CPSC 322, Lecture 2

Explicit State or propositions or relations States can be described in terms of objects and relationships. There is a proposition for each relationship on each “possible” tuple of individuals. University Example Registred(S,C) Students (S) = { } Courses (C) = { } One binary rel and 2 individual 4 propositions 16 states CPSC 322, Lecture 2

Clicker Question One binary relation (e.g., likes) and 9 individuals (people). How many states? 812 102 281 109 Textbook example: One binary relation and 10 individuals can represents 102=100 propositions and 2100 states! I changed same-nationality to likes because if you reason on the meaning of same-nationality the states are less, they are 236 CPSC 322, Lecture 2

Complete Example CPSC 322, Lecture 2

Flat or hierarchical Is it useful to model the whole world at the same level of abstraction? You can model the world at one level of abstraction: flat You can model the world at multiple levels of abstraction: hierarchical Example: Planning a trip from here to a resort in Cancun, Mexico CPSC 322, Lecture 2

Knowledge given vs. knowledge learned from experience The agent is provided with a model of the world once and far all The agent can learn how the world works based on experience in this case, the agent often still does start out with some prior knowledge CPSC 322, Lecture 2

Goals versus (complex) preferences An agent may have a goal that it wants to achieve e.g., there is some state or set of states of the world that the agent wants to be in e.g., there is some proposition or set of propositions that the agent wants to make true An agent may have preferences e.g., there is some preference/utility function that describes how happy the agent is in each state of the world; the agent's task is to reach a state which makes it as happy as possible How do we represent an agent's desire(s)? If an agent doesn't want to achieve anything, it has no reason to act. Think about preferences for Mars explorer Preferences can be complex… What beverage to order? The sooner I get one the better Cappuccino better than Espresso CPSC 322, Lecture 2

Single-agent vs. Multiagent domains Does the environment include other agents? Everything we've said so far presumes that there is only one agent in the environment. If there are other agents whose actions affect us, it can be useful to explicitly model their goals and beliefs rather than considering them to be part of the environment Other Agents can be: cooperative, competitive, or a bit of both How do we represent an agent's desire(s)? If an agent doesn't want to achieve anything, it has no reason to act. Think about preferences for Mars explorer CPSC 322, Lecture 2

Dimensions of Representational Complexity in CPSC322 Reasoning tasks (Constraint Satisfaction / Logic&Probabilistic Inference / Planning) Deterministic versus stochastic domains Some other important dimensions of complexity: Explicit state or features or relations Flat or hierarchical Knowledge given versus knowledge learned from experience Goals vs. (complex) preferences Single-agent vs. multi-agent begin{itemize} % \item \alert{Key point}: ``stochastic world'' can mean that the world itself has stochastic dynamics, that the world is deterministic but imperfectly observed, or that the world has stochastic dynamics \emph{and} is imperfectly observed. %\end{itemize} CPSC 322, Lecture 2

In class activity Work in pair searching the web to find a cool example of fielded (or experimental AI agents) you found Try to find something different from the usual suspects (IBM Watson, Apple’s Siri and Microsoft’s Cortana) CPSC 322, Lecture 2

Try to answer the following questions (take notes) 1. What does the application do? (e.g,. control a spacecraft, perform medical diagnoses, provide intelligent help for computer users, shop on eBay) 2. List some of the application : goals /preferences; observations that it needs about the environment; types of actions that it performs 3. What AI technologies does the application use (e.g,. belief networks, Markov models, semantic networks, heuristic search, constraint satisfaction, planning) 4. Why is it intelligent? Which aspects make it an intelligent system? 5. Is it an experimental system or a fielded system (i.e., used in a real world setting)? 6. Is evidence provided on how well does the application perform? CPSC 322, Lecture 2

Next part Assignment 0 due: submit electronically and you can't use late days Hint: AAAI is the main AI association Come to class ready to discuss the two examples of fielded AI agents you found I'll show some pictures of cool applications in that class Read carefully Section 1.6 on textbook: “Example Applications” The Tutoring System The trading agent The autonomous delivery robot The diagnostic assistant CPSC 322, Lecture 2

CPSC 322, Lecture 2