Question Answering with deep reasoning Chitta Baral, Arizona State U. Michael Gelfond, Texas Tech U. Richard Scherl, Monmouth Univ.

Slides:



Advertisements
Similar presentations
PSL and SWSL Michael Gruninger Institute for Systems Research University of Maryland Michael Gruninger Institute for Systems Research University of Maryland.
Advertisements

BioSigNet: Reasoning and Hypothesizing about Signaling Networks Nam Tran.
TU/e technische universiteit eindhoven Hera: Development of Semantic Web Information Systems Geert-Jan Houben Peter Barna Flavius Frasincar Richard Vdovjak.
Answering complex questions and performing deep reasoning in advance question answering systems Chitta Baral 1, Michael Gelfond 2 and Richard Scherl 3.
Creating Interactive Games Your trainer today is: Luke Milner Derbyshire County Council Children and Younger Adults Department.
Question Answering with deep reasoning Chitta Baral, Arizona State U. Michael Gelfond, Texas Tech U. Richard Scherl, Monmouth Univ.
Learning Objectives Explain similarities and differences among algorithms, programs, and heuristic solutions List the five essential properties of an algorithm.
Artificial Intelligence and Lisp Lecture 13 Additional Topics in Artificial Intelligence LiU Course TDDC65 Autumn Semester, 2010
Academic Advisor: Prof. Ronen Brafman Team Members: Ran Isenberg Mirit Markovich Noa Aharon Alon Furman.
© 2005 Prentice Hall4-1 Stumpf and Teague Object-Oriented Systems Analysis and Design with UML.
Measuring With Jugs A Solution in Finite Domain. Intro to Oz * variables -- a set of alphanumeric characters starting with a CAPITAL letter * atoms --
Introduction to CSE 591: Autonomous agents - theory and practice. Chitta Baral Professor Department of Computer Sc. & Engg. Arizona State University.
Using answer set programming to answer complex queries Chitta Baral (joint work with Michael Gelfond and Richard Scherl) Arizona State University Tempe,
Panel on Knowledge Repositories Organizer: Chitta Baral Panel members: Michael Gelfond Vladimir Lifschitz.
Architecture, Deployment Diagrams, Web Modeling Elizabeth Bigelow CS-15499C October 6, 2000.
1212 /k October 5, 2000capaciteitsgroepscolloquium1 Adaptive Systems Paul De Bra.
Sharif University of Technology1 Design and Use-case Realization Software Engineering Laboratory Fall 2006.
Chapter 2: Developing a Program Extended and Concise Prelude to Programming Concepts and Design Copyright © 2003 Scott/Jones, Inc.. All rights reserved.
Objectives Explain the purpose and objectives of object- oriented design Develop design class diagrams Develop interaction diagrams based on the principles.
1 Case Study: Starting the Student Registration System Chapter 3.
Answering complex questions and performing deep reasoning in advance QA systems: ARDA AQUAINT Program Phase 2 Chitta Baral Arizona State university.
KNOWLEDGE REPRESENTATION, REASONING AND DECLARATIVE PROBLEM SOLVING Chitta Baral Arizona State University Tempe, AZ
Software Quality Assurance
Quality Risk Management ICH Q9 Annex I: Methods & Tools
Introduction to Computer Science. A Quick Puzzle Well-Formed Formula  any formula that is structurally correct  may be meaningless Axiom  A statement.
The Fundamentals: Algorithms, the Integers & Matrices.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Extended Prelude to Programming Concepts & Design, 3/e by Stewart Venit and.
Intelligent Tutoring Systems Traditional CAI Fully specified presentation text Canned questions and associated answers Lack the ability to adapt to students.
System Analysis Overview Document functional requirements by creating models Two concepts help identify functional requirements in the traditional approach.
Reading comprehension
University of Toronto Department of Computer Science © 2001, Steve Easterbrook CSC444 Lec22 1 Lecture 22: Software Measurement Basics of software measurement.
Cooperative Query Answering Based on a talk by Erick Martinez.
V Avon High School Tech Club Agenda Old Business –Delete Files New Business –Week 16 Topics: Intro to HTML/CSS –Questions? Tech Club Forums.
Introduction and Chapter 1
Katanosh Morovat.   This concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control of the operation.
Extended Prelude to Programming Concepts & Design, 3/e by Stewart Venit and Elizabeth Drake Chapter 2: Developing a Program.
Levels of Architecture & Language CHAPTER 1 © copyright Bobby Hoggard / material may not be redistributed without permission.
ITCS 6010 SALT. Speech Application Language Tags (SALT) Speech interface markup language Extension of HTML and other markup languages Adds speech and.
9 Chapter Nine Compiled Web Server Programs. 9 Chapter Objectives Learn about Common Gateway Interface (CGI) Create CGI programs that generate dynamic.
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.
Presented by: Rhea McCaslin Dhaval Salvi
Module 5 Planning for SQL Server® 2008 R2 Indexing.
Bernd Bruegge & Allen H. Dutoit Object-Oriented Software Engineering: Using UML, Patterns, and Java 1 Object Modeling.
1 UML Basic Training. UML Basic training2 Agenda  Definitions: requirements, design  Basics of Unified Modeling Language 1.4  SysML.
Systems Analysis and Design in a Changing World, 3rd Edition
CS3773 Software Engineering Lecture 04 UML Class Diagram.
2007. Software Engineering Laboratory, School of Computer Science S E Web-Harvest Web-Harvest: Open Source Web Data Extraction tool 이재정 Software Engineering.
1 Training for the New Georgia Performance Standards Day 2: Unpacking the Standards.
Answering Complex Questions and Performing Deep Reasoning in Advance QA Systems – Reasoning with logic and probability Chitta Baral Arizona State university.
Comp763: Modern Computer Games Using Constraint Logic Programming to Analyze the Chronology in a William Faulkner Story Jennifer BurgSheau-Dong Lang Irwin.
First, a little review: Consider: then: or It doesn’t matter whether the constant was 3 or -5, since when we take the derivative the constant disappears.
Physics for Scientists and Engineers Introduction and Chapter 1 – Physics and Measurements.
Michael A. Hitt C. Chet Miller Adrienne Colella Slides by R. Dennis Middlemist Michael A. Hitt C. Chet Miller Adrienne Colella Chapter 4 Learning and Perception.
For Monday Finish chapter 19 No homework. Program 4 Any questions?
CIRCUITS, PATHS, AND SCHEDULES Euler and Königsberg.
Finite State Machines (FSM) OR Finite State Automation (FSA) - are models of the behaviors of a system or a complex object, with a limited number of defined.
Panel Discussion on Granular Computing at RSCTC2004 J. T. Yao University of Regina Web:
RoOUG Iunie Bucuresti, 26 Iunie Agenda Inregistrarea participantilor ODI – Common Use Cases 2Iunie 2013.
Rigorous Testing by Merging Structural and Behavioral UML Representations Presented by Chin-Yi Tsai.
Artificial Intelligence
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
THE EYESWEB PLATFORM - GDE The EyesWeb XMI multimodal platform GDE 5 March 2015.
CSCI 383 Object-Oriented Programming & Design Lecture 7 Martin van Bommel.
Building the Corporate Data Warehouse Pindaro Demertzoglou Lally School of Management Data Resource Management.
Understanding Depth of Knowledge. Depth of Knowledge (DOK) Adapted from the model used by Norm Webb, University of Wisconsin, to align standards with.
Matt Gomez.  What will occur in the status quo  Factors for good uniqueness  Post-dating – things change  Brink – why is the squo good but not guaranteed.
Artificial Intelligence and Lisp Lecture 13 Additional Topics in Artificial Intelligence LiU Course TDDC65 Autumn Semester,
Software Design Methodologies and Testing
Some Programming Paradigms
Presentation transcript:

Question Answering with deep reasoning Chitta Baral, Arizona State U. Michael Gelfond, Texas Tech U. Richard Scherl, Monmouth Univ.

Text repository Question Domain Knowledge Module N Reasoning Module k Domain Knowledge Module 1 Reasoning Module 1 Processed Text Answer, possibly with explanation

Core efforts: KR Domain Knowledge Modules –Travel Module -- various Intentions [10:45-11:15] AAAI’05 Generalization : a theory of activities [2:15 – 2:45] –Support structure Fundamental extension of AnsProlog –Consistency restoring (CR-Prolog) -- Sep 04 ASU –Probabilistic reasoning (P-log) -- Tampa Modules –AnsProlog Modules -- Feb 05 ASU –KR Modules (AnsProlog + Prolog + CLP) [11:15-11:45] Interfaces and methodologies –AnsProlog GUI -- Feb 05 ASU –Knowledge Modeling Language -- Feb 05 ASU Further development of action languages – ongoing AAAI’05 (continuous actions, triggers, event ordering, etc.)

Core efforts: Reasoning Reasoning Modules –Prediction, planning, explanation -- Baltimore –Detecting lies -- TTU thesis –Trying your best -- Feb’05 ASU –Counterfactuals -- ongoing –Reasoning with incomplete information [11:15-11:45] AAAI’05 Explanation generation modules – Explaining an answer set -- ongoing

Bridge-building efforts – towards an integrated system Logical Form to extracted facts [9:30-10:30] English to Link grammar output to extracted facts [1:45-2:15] Solving Puzzles in English (Bob Leaman’s class project) An end-to-end system with travel module (Matt Hunsaker’s class project) Collaborative Curation -- Feb 05 ASU AQUAINT web site

Today’s Schedule – 5/11/05 9:00 - 9:20 Overview (Chitta) 9: :30 From Logic Forms to ASP query answering (Marcello) 10: :15 Reasoning about intentions (Michael) 11: :45 New reasoning methods (combining ASP and CSP, approximation algorithm for reasoning with incomplete information) (Michael; Ricardo) 12:00 - 1:30 Lunch 1:45 - 2:15 Link grammar based effort at ASU (Luis) 2:15 – 2:45 From travel modules to a theory of activity -- initial thoughts (Chitta)

Theory of Activity: A trip A trip has many participants. People can join and leave the trip. There is a start and an end of a trip. A trip may be interrupted resulting in the trip being paused or canceled. A paused trip might be canceled or continued. A trip has a schedule which is often a sequence of actions intended to be performed at particular times. Usually the schedule is followed, and most often if a particular item in the schedule is not possible then it is delayed until it becomes possible. Some time particular items in the schedule may be canceled.

Example Qs with respect to trips Who are part of a trip at a particular time? What is the status of a trip at a particular time? What are the value of fluents at a particular time? What actions of the trip happened at what time?

Activities Other examples: –insurrections, terrorism, games, elections, concerts, money-laundering, smuggling, strikes, tournaments, demonstrations, wars, etc. –Activities in the virtual world include work- flows. In most of these activities the actions that are intended to happen are not necessarily scheduled as a sequence.

QA with respect to an activity narrative Who are the participants of an activity at a particular time? What is the value of a fluent at a particular time? What is the status of an activity at a particular time? Based on what we know what is a viable schedule of an activity? What is the most likely schedule? When did a particular action (part of the activity) happen? Give the interval when a particular action is likely to happen? How to prevent things from going wrong? How to disrupt an activity?

Knowledge Modeling – objects and properties Trip – basic static attributes – name: a string of characters stops: an ordered list of locations % can be represented as a set of pairs % { (0, locn_0), (1, locn_1)..., (n, locn_n) } % note : locations may be repeated in the list % for trips that include multiple visit % to the same location –derived static attributes – origin: location destination: location intermediate_stops: set of locations number_of_planned_stops: integer

Objects and properties -- Cont. –basic fluent attributes: position: location union {en_route} %encodes current location last_planned_stop_number: integer participants: set of persons – derived fluent attributes: next_planned_stop: location directly_associated actions: {depart, stop, embark, disembark} directly_associated actions: {embark, disembark} Person – basic static attributes – name: a string of characters position: location Location – basic static attributes – name: a string of characters

Actions name: a string of characters parameters: set of property classes executability conditions: fluent formulas conditional effects: list of pairs (phi, f) where phi is a fluent formula, and f is a fluent literal actor: triggers: list of pairs (phi, a) where phi is a fluent formula, and a is an action depart is_an action –name: depart –parameter: {trip} –executability conditions: trip.position \neq enroute, trip.number_of_planned_stops < trip.last_planned_stop_number –conditional effects: { (T, trip.position = en_route) }

Actions (cont.) stop is_an action –name: stop –parameter: {trip.location} –executability condition: trip.position = enroute –conditional effects: { (T, trip.position = trip.location) } embark is_an action – name: embark – parameter: {trip, person} – actor: person – executability condition: trip.participant does_not_include person, trip.position = person.position, trip.position \neq en_route – conditional effects: { (T, trip.participant includes person) } disembark is_an action – name: disembark – parameter: {trip, person} – actor: person – executability condition: trip.participant includes person, trip.position \neq en_route – conditional effects: { (T, trip.participant does_not_include person) }

Compound actions and constraints go_on is_a compound_action –name: go_on –component actions: {embark, disembark} CONSTRAINTS –% connect various properties. –% for example: The position of a trip and a participant of that trip are always the same.