Exploring the relation between knowledge and belief in multi-agent epistemic planning. Number 3.

Slides:



Advertisements
Similar presentations
A small taste of inferential statistics
Advertisements

Sequential Three-way Decision with Probabilistic Rough Sets Supervisor: Dr. Yiyu Yao Speaker: Xiaofei Deng 18th Aug, 2011.
CLASSICAL PLANNING What is planning ?  Planning is an AI approach to control  It is deliberation about actions  Key ideas  We have a model of the.
Probabilistic Planning Jim Blythe November 6th. 2 CS 541 Probabilistic planning A slide from August 30th: Assumptions (until October..) Atomic time All.
Computation and representation Joe Lau. Overview of lecture What is computation? Brief history Computational explanations in cognitive science Levels.
Mental Modules, Mindreading & Male-Female Brain-Based Differences Autism and Baron-Cohen’s “Four Evolutionary Steps” that underlie the Human Mindreading.
Evidence Dynamics in Neighborhood Models Johan van Benthem University of Amsterdam.
Probabilistic Planning Jim Blythe. 2 CS 541 Probabilistic planning Some ‘classical planning’ assumptions Atomic time All effects are immediate Deterministic.
Chapter 12: Expert Systems Design Examples
3/25  Monday 3/31 st 11:30AM BYENG 210 Talk by Dana Nau Planning for Interactions among Autonomous Agents.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin.
Handling non-determinism and incompleteness. Problems, Solutions, Success Measures: 3 orthogonal dimensions  Incompleteness in the initial state  Un.
Presenter: Mai Hinton Mentors: Lindsey Powell & Kate Hobbs February 2011.
+ Executive Function & Theory of Mind Meg Barrow October 14, 2010.
Theories and principles associated with motivation.
CAS LX 502 Semantics 3a. A formalism for meaning (cont ’ d) 3.2, 3.6.
Decision Making Under Uncertainty Lec #4: Planning and Sensing UIUC CS 598: Section EA Professor: Eyal Amir Spring Semester 2005 Uses slides by José Luis.
Dialogue Modeling. Task-Oriented Dialogues  Online appointment manager –Schedules and co-ordinates meetings between people User : Can you schedule a.
Intro to Planning Or, how to represent the planning problem in logic.
Design of Tree Algorithm Objectives –Learning about satisfying safety and liveness of a distributed program –Apply the method of utilizing invariants and.
___________________________________________________ Informatics MSc Course PLAN – Automated Planning The aim of this course is to provide: a solid grounding.
Preparing for the Learning Experience Chapter 7. Objectives Discuss the concept of the learning experience Explain the role of the movement practitioner.
Explanations of Autism Individual Differences. Cognitive Explanations Individual Differences.
Probabilistic Robotics Probability Theory Basics Error Propagation Slides from Autonomous Robots (Siegwart and Nourbaksh), Chapter 5 Probabilistic Robotics.
Managing Response Rates
Strategic Planning – How it All Comes Together
Coaching at a Tier 2 for Grownups
Additive Comparison Situations
Using Use Case Diagrams
Data Types Variables are used in programs to store items of data e.g a name, a high score, an exam mark. The data stored in a variable is entered from.
Scenario Specification and Problem Finding
Chitta Baral.
Planning Search vs. planning STRIPS operators Partial-order planning
Are You Smarter Than a 2nd Grader?
Logical Agents.
EA C461 – Artificial Intelligence Logical Agent
Planning (Chapter 10)
What do you already know?
Christophe Bisciglia 5/16/2003
Mental Modules, Mindreading & Male-Female Brain-Based Differences
Today: Classic & AI Control Wednesday: Image Processing/Vision
Planning Search vs. planning STRIPS operators Partial-order planning
Teaching with Instructional Software
EPISTEMIC LOGIC.
LESSON 11 – WHILE LOOPS UNIT 5 – 1/10/17.
Planning Search vs. planning STRIPS operators Partial-order planning
Commit Protocols CS60002: Distributed Systems
SAD ::: Spring 2018 Sabbir Muhammad Saleh
Student: Fang Hui Supervisor: Teo Yong Meng
You will need the following:
Concurrent Graph Exploration with Multiple Robots
Artificial Intelligence
The VSK logic for Intelligent Agents
Recording and Representing Knowledge
CS 416 Artificial Intelligence
Using Use Case Diagrams
<I-N-C-A> and the I-Room
Theories and principles associated with motivation
CS 416 Artificial Intelligence
Distributed Databases Recovery
SEMINAR FOUR: The Secrets of the PPC and Internet Marketing Millionaires
Data Structures & Algorithms
UNIVERSITY OF MASSACHUSETTS Dept
SMART OBJECTIVES.
UNIVERSITY OF MASSACHUSETTS Dept
Agreement Planning Eva Onaindía 27 de Julio de 2011.
Information Retrieval
FICTION FIXTURES Elements Of Fiction.
Presentation transcript:

Exploring the relation between knowledge and belief in multi-agent epistemic planning. Number 3

Participants Guillaume Aucher (consultant on knowledge/belief) Chitta Baral Esra Erdem Andreas Herzig Mathias Justesen Yongmei Liu Richard Scherl (coordinator) Hans van Ditmarsh Jan van Eijck

Goals: Identify the theoretical and computational challenges in planning with knowledge vs planning with belief; when one or the other is appropriate, or both are needed. How are knowledge and beliefs represented and distinguished from representation of the actual world? How do we formally handle that knowledge may turn into false belief after a partially observable action has occurred? What are the relevant formalisms for planning with knowledge and/or belief and what are their theoretical and computational properties? How do we deal with revision in planning? Are there specific types of interesting goals for epistemic planning? In planning with beliefs, goals can be false beliefs with relevance to formalizing false-belief tasks such as lying and deception.

Discussion: Knowledge vs Belief There was complete agreement here. Some felt that in planning we want to achieve something with certainty and therefore knowledge is needed. Others felt that the certainty required for knowledge is not achievable and so we should work with belief. From an external perspective the planner has a goal involving knowledge, but from an internal perspective each agent executing it’s part of the plan only needs belief. We can define knowledge in terms of belief as true belief. There are also a variety of ways of defining belief in terms of knowledge.

Representation of Epistemic States Possible Worlds (including variants) Plausible Models (Baltag and Smets) Formulas

Motivating Example Initial State: C{1,2} ~f Goal: K1f ⋀ K1K2~f Plan: KD45 agent1 makes f true while agent2 is not looking

Possible Worlds: DEL (continued) Initial State: 1,2 S0 = ~f <T, f:=T> 1 2 <T,⦰> agent1 makes f true while agent2 is not looking Action model: a = f 1 2 ~f 1,2 Result: S0 ⊗ a = S1 =

x Possible Worlds: DEL Possible Worlds: DEL (continued) f f ~f f Action Model Now what if we have public announcement of f f 1 2 ~f f a2 1,2 S1 1 f x S1 ⊗ a = S2 =

Need Belief Revision Plausibility Orderings Syntactic Belief Revision Baltag, A. and S. Smets, 2008a, “Probabilistic dynamic belief revision”, Synthese, 165(2): 179–202. doi:10.1007/s11229-008-9369-8 Syntactic Belief Revision Xiao Hung, Biqing Fang, HaiWan, and Yongmei Liu. “A General Multi-agent Epistemic Planner Based on Higher-order Belief Change.” 2017 IJCAI Recovery Jan van Eijk. Talk Public Lies and How to Recover from them

Plausibility Ordering Initial state 1,2 S0 = ~f Action model: 1,2 1,2 x y 1 2 X >2 Y Y >1 X a = <T, f:=T> <T,⦰> 1,2 X >2 Y Y >1 X f ~f X y 2 1 S0 ⊗ a = S1 =

Plausibility Ordering f 1,2 Public Announcement a2 = 1,2 X >2 Y Y >1 X f ~f X y 2 1 S0 ⊗ a = S1 = f 1,2 x S1 ⊗ a2 = S2 =

Syntactic Revision Algorithm Formulas: Xiao Hung, Biqing Fang, HaiWan, and Yongmei Liu. “A General Multi- agent Epistemic Planner Based on Higher-order Belief Change.” 2017 IJCAI Normal Form: Alternating Cover Disjunctive Formula (ACDF) Algorithm for syntactically manipulating form for update and revision. The result is still in ACDF.

Syntactic a1 effect f ⋀ k1 f a2 effect k1 f ⋀ k2 f ~f ⋀ k1~f ⋀ k2~f a1 update f ⋀ k1 f ⋀ k2~f a2 revision f ⋀ k1 f ⋀ k2 f

Recovering Action Recovering Action before adding result of public announcement R ⋃ (R;Ru) ⋃ Ru Ru inverse R;Ru composition of relation and inverse. Jan van Eijk. talk Public Lies and How to Recover from them

DEL with Recovering f f ~f Public Announcement 1,2 1 Recovered links in red. S1 After recovery

DEL with Recovery (cont) Action Model Now we have public announcement of f f 1 2 ~f f a2 1,2 S1 1,2 f x S1 ⊗ a2 = S2 =

Modify the DEL product operator – work in progress (Baral, Son) For edges in the updated state reached after executing action model A in epistemic state S, add some edges from the action model (even if they are not in S, under certain conditions. These conditions need to be defined so that the modification occurs when appropriate – work in progress.

Formalisms for Planning Model based progression (state-based search) Formula based progression Compilation (translation into classical planning problem) Others

Examples Story Understanding As the many stories progress characters will obtain false beliefs. Sally/Anne Autism Test A short skit is enacted. Sally takes a marble and hides it in her basket. She then leaves the room and Anne takes the marble out of Sally’s basket and puts it in her own basket. The question of where sally will look for her marble is asked. The autistic children tend to reply in Anne’s basket. Inability of people on autism spectrum to distinguish between actual world and a person’s belief about the world.