1 Title A Joint Intention Based Dialog Architecture Rajah. A Subramanian University of Rochester.

Slides:



Advertisements
Similar presentations
1 Knowledge Representation Introduction KR and Logic.
Advertisements

FIPA Interaction Protocol. Request Interaction Protocol Summary –Request Interaction Protocol allows one agent to request another to perform some action.
Formal Semantics for an Abstract Agent Programming Language K.V. Hindriks, Ch. Mayer et al. Lecture Notes In Computer Science, Vol. 1365, 1997
Use Case & Use Case Diagram
Co-ordination and Co-operation Between CGF Agents Dr Jeremy Baxter Parallel and Distributed Simulation Group S&P Sector, Malvern.
Copyright © 2006 Addison-Wesley. All rights reserved.1-1 ICS 410: Programming Languages Chapter 3 : Describing Syntax and Semantics Axiomatic Semantics.
ISBN Chapter 3 Describing Syntax and Semantics.
Concrete architectures (Section 1.4) Part II: Shabbir Ssyed We will describe four classes of agents: 1.Logic based agents 2.Reactive agents 3.Belief-desire-intention.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Multiagent Systems and Societies of Agents
Four Dark Corners of Requirements Engineering
Introduction to CSE 591: Autonomous agents - theory and practice. Chitta Baral Professor Department of Computer Sc. & Engg. Arizona State University.
Modeling Teamwork in the CAST Multi-Agent System Thomas R. Ioerger Department of Computer Science Texas A&M University.
Creating Architectural Descriptions. Outline Standardizing architectural descriptions: The IEEE has published, “Recommended Practice for Architectural.
4-1 Chapter 4: PRACTICAL REASONING An Introduction to MultiAgent Systems
Describing Syntax and Semantics
Handouts Software Testing and Quality Assurance Theory and Practice Chapter 11 System Test Design
On Roles of Models in Information Systems (Arne Sølvberg) Gustavo Carvalho 26 de Agosto de 2010.
Computer Science 30/08/20151 Agent Communication BDI Communication CPSC /CPSC Rob Kremer Department of Computer Science University of Calgary.
Introduction to Jadex programming Reza Saeedi
Chapter 6 System Engineering - Computer-based system - System engineering process - “Business process” engineering - Product engineering (Source: Pressman,
Collectively Cognitive Agents in Cooperative Teams Jacek Brzeziński, Piotr Dunin-Kęplicz Institute of Computer Science, Polish Academy of Sciences Barbara.
2APL A Practical Agent Programming Language March 6, 2007 Cathy Yen.
Lecture 12: 22/6/1435 Natural language processing Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Ontologies Reasoning Components Agents Simulations Belief Update, Planning and the Fluent Calculus Jacques Robin.
Business Analysis and Essential Competencies
Cognitive Reasoning to Respond Affectively to the Student Patrícia A. Jaques Magda Bercht Rosa M. Vicari UNIVERSIDADE FEDERAL DO RIO GRANDE DO SUL BRASIL.
Computer Science CPSC 322 Lecture 3 AI Applications 1.
Spoken dialog for e-learning supported by domain ontologies Dario Bianchi, Monica Mordonini and Agostino Poggi Dipartimento di Ingegneria dell’Informazione.
Argumentation and Trust: Issues and New Challenges Jamal Bentahar Concordia University (Montreal, Canada) University of Namur, Belgium, June 26, 2007.
EEL 5937 Agent communication EEL 5937 Multi Agent Systems Lecture 10, Feb. 6, 2003 Lotzi Bölöni.
Using UML, Patterns, and Java Object-Oriented Software Engineering Chapter 4, Requirements Elicitation.
Belief Desire Intention Agents Presented by Justin Blount From Reasoning about Rational Agents By Michael Wooldridge.
Software Multiagent Systems: Lecture 13 Milind Tambe University of Southern California
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
Ayestarán SergioA Formal Model for CPS1 A Formal Model for Cooperative Problem Solving Based on: Formalizing the Cooperative Problem Solving Process [Michael.
Chapter 10 Analysis and Design Discipline. 2 Purpose The purpose is to translate the requirements into a specification that describes how to implement.
Department of Informatics, UC Irvine SDCL Collaboration Laboratory Software Design and sdcl.ics.uci.edu 1 Informatics 43 Introduction to Software Engineering.
Dept. of Computer Science University of Rochester Rochester, NY By: James F. Allen, Donna K. Byron, Myroslava Dzikovska George Ferguson, Lucian Galescu,
Multi-Agent Systems University “Politehnica” of Bucarest Spring 2010 Adina Magda Florea curs.cs.pub.ro.
3 ©2013 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
ERDA : An Empathic Rational Dialog Agent1 Magalie Ochs (1),(2), Catherine Pelachaud (1) and David Sadek (2) (1) IUT de Montreuil, University Paris VIII,
Simultaneously Learning and Filtering Juan F. Mancilla-Caceres CS498EA - Fall 2011 Some slides from Connecting Learning and Logic, Eyal Amir 2006.
By Germaine Cheung Hong Kong Computer Institute
Modeling Speech Acts and Joint Intentions in Modal Markov Logic Henry Kautz University of Washington.
A Quantitative Trust Model for Negotiating Agents A Quantitative Trust Model for Negotiating Agents Jamal Bentahar, John Jules Ch. Meyer Concordia University.
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
Welcome Back, Folks! We’re travelling to a littele bit far-end of Language in Use Studies EAA remains your faithful companion.
EEL 5937 Agent communication EEL 5937 Multi Agent Systems Lotzi Bölöni.
Some Thoughts to Consider 8 How difficult is it to get a group of people, or a group of companies, or a group of nations to agree on a particular ontology?
AAAI Fall Symposium on Mixed-Initiative Problem-Solving Assistants 1 Mixed-Initiative Dialogue Systems for Collaborative Problem-Solving George Ferguson.
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
Agent Communication Languages Speech act theory Speech act theory Semantics of languages Semantics of languages KQML KQML FIPA ACL FIPA ACL Comparison.
Artificial Intelligence Chapter 23 Multiple Agents Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
From Natural Language to LTL: Difficulties Capturing Natural Language Specification in Formal Languages for Automatic Analysis Elsa L Gunter NJIT.
MERL 1 COLLAGEN: Applying Collaborative Discourse Theory to Human-Computer Interaction Charles Rich Candace L. Sidner Neal Lesh Mitsubishi Electric Research.
Intention & Cooperation Discourse and Dialogue CS 359 October 18, 2001.
EEL 5937 Content languages EEL 5937 Multi Agent Systems Lecture 10, Feb. 6, 2003 Lotzi Bölöni.
Agent-Based Dialogue Management Discourse & Dialogue CMSC November 10, 2006.
Artificial Intelligence Knowledge Representation.
Intelligent Agents: Technology and Applications Unit Five: Collaboration and Task Allocation IST 597B Spring 2003 John Yen.
CMSC 691M Agent Architectures & Multi-Agent Systems
Service-Oriented Computing: Semantics, Processes, Agents
Informatics 121 Software Design I
Service-Oriented Computing: Semantics, Processes, Agents
Formal Methods in DAI : Logic-Based Representation and Reasoning
Applying Use Cases (Chapters 25,26)
Applying Use Cases (Chapters 25,26)
Presentation transcript:

1 Title A Joint Intention Based Dialog Architecture Rajah. A Subramanian University of Rochester

2 Need for a Generic Dialog Engine Current spoken dialog systems  Domain based systems.  Need to explicitly code all possible rules and conditions for prompting, informing etc.  Very difficult to port from one domain to another, breaks easily and cannot be used for complex task-based scenarios. We propose an architecture that can reason in a general manner and can replace many of the rules and condition that are explicit in current dialog systems.  Handle over-answering, multi-agent interaction, and certain dynamic changes in the environment.  Build Systems that are robust and domain independent.

3 Dialog Process We are concerned here in the Dialog Management Strategy. Language Understanding Dialog Management. Strategy Back-end (various) Language Generation Speech Recognition Speech Synthesis

4 Outline of the talk Overview  Joint Intentions Theory  Semantics of Communicative Acts  Belief Reasoner  STAPLE interpreter Room Reservation Demo Summary, Future & Related work

5 Joint Intention Theory (JIT) - I Belief, Desire, Intention (BDI) Model – Bratman/Israel/Pollack, Georgeff/Lansky … Joint Intention Theory (JIT) (Cohen, Levesque). Uses modal logic (beliefs, goals), dynamic logic of actions (sequence, concurrent actions, etc.), temporal logic (eventually, always). INTENTION – Choice with commitment. PGOAL x – Individual persistent goal of an agent. Once adopted, the agent is committed to it until achieved, impossible or irrelevant.

6 Joint Intention Theory (JIT) - II PWAG x y – Joint goal between x and y.  PGOAL to achieve the goal relative to PWAG.  if already achieved, impossible or irrelevant, then PGOAL to mutually make it known to concerned agents. Teamwork: JPG x y – Two way PWAG’s/ X has a PWAG towards Y and Y towards X. Prescribes how to execute actions jointly while being in a shared mental state  Requires starting mutual belief (MB)  Requires MB about task completion, impossibility, or irrelevance  It predicts communication in the event of private beliefs

7 Semantics of Communicative Acts Formal compositional semantics of commonly used speech acts using JIT constructs  REQUEST and INFORM are the basic CA’s. The goal of a request (x y a ): y eventually does the action a and also have a PWAG with respect to the requester x to do a. The goal of an inform (x y p) is to establish MB between the informee (x) and the informed (y) that x believes the informed predicate (p).  The other CA’s such as ASK, AGREE, INFORMREF etc. are built from REQUEST and INFORM. For example, ASK is an REQUEST to INFORMREF.  KNOWREF – To know the referent of the description of a required value.

8 Communicative Actions (cont..) Identified speech acts that can be used to create and discharge teams Showed how to achieve mutual belief Explicated defeasible assumptions about communication STAPLE (Sanjeev Kumar) – Implements the constructs JI theory and interprets PGOAL’s, PWAG’s, Communicative Acts, etc. Can you please help me move the table? Sure REQUEST + AGREE = Joint Commitment Back

9 STAPLE Architecture (Kumar 2006)

10 STAPLE Optimization Original version – Java only  Not efficient for unification, that constitutes more than 80% of execution time. To optimize – combined Java and Prolog, completed as part of RPE project.  Java for threads, stacks, triggers etc.  Prolog for knowledge base, unification etc.  More than 150 times faster for single-agent and 70 times faster for multi-agents.

11 Planning Relevant Questions – Snapshot of a Goal Stack in STAPLE INTEND (agent, request (agent, user, action (informref (user, agent, i (D, date (Room,D)))* PGOAL (agent, done (action (ask-ref ( agent, user, i(D, date (Room, D))* PGOAL (agent, (KNOW-REF agent, i (D,date(Room,D))) * PGOAL(agent,  Room (reserved(Room,Date,Time,Size)) PWAG(agent, user, user (done(reserved(Room, Date, Time,…)))) *The PGOAL is actually a bit more complex – the system wants to know the referent of the date that the user wants the room reservation; also the sub-goals are relative to the original goal.

12 STAPLE: Multi-agent Dialog Example Room reservation domain Three Microsoft agent characters play the roles of User, System, & Database agent Peedy (SYSTEM) Robby (USER) Merlin (DATABASE AGENT)

13 Multi-Agent Dialog Example - Setup Robby (USER) 1. Initial state : - Believes that it wants a room at a particular date & time 2. Actions: - Cannot perform any actions other than communicative acts Peedy (SYSTEM) 1. Initial state: - Believes that the user knows the date & time for reserving the room - Believes that the database agent can query for rooms and hold a room if necessary. 2. Actions: - Can perform action reserve room that happens to be a named action expression (i.e., a plan) Merlin (DATABASE AGENT) 1. Initial state : - No domain related beliefs. 2. Actions: - Can perform actions to query the database and to hold a room.

14 Handling Over-Answering PGOAL (KNOW-REF i (D,date(Room,D))) Agent: Please say the date you want the room User: I would like it on March 20 th at Three PM Bel(user, /\ ([ March20 = i(Date, date (Room, Date))), 3PM = i(Time, time (Room, Time)))])). Bel(user, March20 = i(Date, date (Room, Date)))) Bel(user, 3PM = i(Time, time (Room, Time)))). PGOAL (KNOW-REF i (T,time(Room,T))) PGOAL (KNOW-REF i (S,size(Room,S))) PGOAL Discharged

15 Multi-Agent Interaction PGOAL(system-agent, done(action (getrooms, X,E),…. System Agent USER Original JPG to reserve a room Bel(system-agent, cando(getrooms, database-agent)) … (Action Expression Decomposition) Database Agent

16 Multi-Agent Interaction PGOAL(system-agent, done(action (getrooms, X,E),…. INTEND(system, action(establish_jpg([system, database], done(action(getrooms(……relative to PWAG reserveroom ….. INTEND(system, action(request(system,[system, database], action(getrooms, …… Database Agent REQUEST System Agent USER Original JPG to reserve a room

17 Multi-Agent Interaction System Agent USER Original JPG to reserve a room JPG to do getrooms AGREE Database Agent REQUEST Back

18 Handling Dynamic Changes System Agent USER JPG to do holdroom Database Agent Original JPG to reserve a room INTEND(database,action(holdroom,database)..Relative to original PWAG to reserve a room JPG to do holdroom becomes impossible PGOAL(database, mb([system, database], always(not(done(action(holdroom(….. INTEND(database, done(action(inform( database,system,always(not(done (action(holdroom(….. INFORM – not able to hold the room Room is TAKEN!!! Conversation between user and system to confirm the room

19 Handling Dynamic Changes System Agent USER JPG to do holdroom Database Agent Original JPG to reserve a room JPG to do holdroom becomes impossibe Check if there are other rooms that are available or inform user that no rooms are available.

20 Demo Back

21 The Point We get automatic team and task-related communication behavior  If agent believes that somebody else knows an answer then initiates dialogue to find out that answer.  If an agent believes that somebody else can do the action that it wanted done then it establishes a team for that purpose  Dialogue about mutual belief establishment follows automatically.  No mutual observation leads to explicit communication, otherwise explicit communication is absent. The above behavior can be chained to elicit even more interesting behavior.  Example: A sub-dialogue may get started in the middle of joint action execution to find the truth value of a proposition if it is the precondition for doing a part of the jointly committed action.

22 Future Work In Progress  Implicit Confirmations  Explicit Clarifications Still Mulling over…  Partial and weak beliefs  Belief update and revision

23 Related Work Dialogue & Communication  Collagen: MERL – Rich, Sidner, Lesh  Artimis & Arcol: France Telecom - Sadek, Panaget, Bretier,…  TRIPS: University of Rochester – Allen, Ferguson, …  FIPA, KQML Teamwork  STEAM & Teamcore: USC – Tambe et al.  Grate: Liverpool, UK - Jennings)

24 Appendix A: STAPLE Program – Multi Agent Interaction and Dynamic Changes bel(system,can_do(getrooms(Room,List), database)). bel(system,exists(D,bel(user,equals(D,i(Date,date(Room,Date)))))). plan(reserveroom,4) :- [args: [Room, [Date, Time], E1,E2], achieve_precondition: true, effects: [(roomReserved(Room,[Date,Time]),1.0)], body: { action(roominfo([date(Room, Date), time(Room, Time)]),system,E1)}]. plan(roominfo,1) :- [args: [[date(Room, Date), time(Room, Time)]], effects: [(roomsAvailable(Room, [Date, Time]),1.0)], body: { action(getrooms(Room, [Date, Time]),X, Ev1)}].

25 Appendix B: Belief Reasoner (BEL self p) :- p (BEL α p) :- (BEL α □p) (BEL α  p) :- (BEL α p) (BEL α (BEL α p)) :- (BEL α p)  (BEL α p):- (BEL α  p)  (BEL α p) :- \+ (BEL α p) (BEL α  p) :- (BEL α p) (BEL α □□p):-(BEL α □p) (BEL α  p):- (BEL α  p) (BEL α p) :- (BEL α q=>p) /\ (BEL α q) (BEL α p/\q) :- (BEL α p) /\ (BEL α q) (BEL α □  (p/\q)) :- (BEL α □  p)  (BEL α □  q)

26 Appendix C: Mutual Belief Reasoner (BEL self p) :- (MB self y p) (BEL self (BEL y p)) :- (MB self y p) (BMB self y p) :- (MB self y p) (BMB y self p) :- (MB self y p) (BEL self (MB self y (BEL self p))) :- (MB self y p) (BEL self (MB self y (BEL y p))) :- (MB self y p) (BEL self (MB self y p/\q)) :- (BEL self (MB self y p)) /\ (BEL self (MB self y q)) (BEL self (MB self y □  (p/\q))) :- (BEL self (MB self y □  p))  (BEL self (MB self y □  q))