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

Slides:



Advertisements
Similar presentations
Short introduction to the use of PEARL General properties First tier assessments Higher tier assessments Before looking at first and higher tier assessments,
Advertisements

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.
1 CHAPTER 4 RELATIONAL ALGEBRA AND CALCULUS. 2 Introduction - We discuss here two mathematical formalisms which can be used as the basis for stating and.
Artificial Intelligence Chapter 21 The Situation Calculus Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Using Link Grammar and WordNet on Fact Extraction for the Travel Domain.
Creating Interactive Games Your trainer today is: Luke Milner Derbyshire County Council Children and Younger Adults Department.
CSE 591 (99689) Application of AI to molecular Biology (5:15 – 6: 30 PM, PSA 309) Instructor: Chitta Baral Office hours: Tuesday 2 to 5 PM.
Question Answering with deep reasoning Chitta Baral, Arizona State U. Michael Gelfond, Texas Tech U. Richard Scherl, Monmouth Univ.
1 CBioC: Collaborative Bio- Curation Chitta Baral Department of Computer Science and Engineering Arizona State University.
Academic Advisor: Prof. Ronen Brafman Team Members: Ran Isenberg Mirit Markovich Noa Aharon Alon Furman.
Aalborg Media Lab 21-Jun-15 Software Design Lecture 1 “ Introduction to Java and OOP”
Measuring With Jugs A Solution in Finite Domain. Intro to Oz * variables -- a set of alphanumeric characters starting with a CAPITAL letter * atoms --
1 SWE Introduction to Software Engineering Lecture 15 – System Modeling Using UML.
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.
1212 /k October 5, 2000capaciteitsgroepscolloquium1 Adaptive Systems Paul De Bra.
1 The Pumping Lemma for Context-Free Languages. 2 Take an infinite context-free language Example: Generates an infinite number of different strings.
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
7.1 Zero and Negative Exponents:
1 LOMGen: A Learning Object Metadata Generator Applied to Computer Science Terminology A. Singh, H. Boley, V.C. Bhavsar National Research Council and University.
Introduction to computer: storing instructions and information.
System Analysis Overview Document functional requirements by creating models Two concepts help identify functional requirements in the traditional approach.
University of Toronto Department of Computer Science © 2001, Steve Easterbrook CSC444 Lec22 1 Lecture 22: Software Measurement Basics of software measurement.
AQUAINT Kickoff Meeting – December 2001 Integrating Robust Semantics, Event Detection, Information Fusion, and Summarization for Multimedia Question Answering.
RDF (Resource Description Framework) Why?. XML XML is a metalanguage that allows users to define markup XML separates content and structure from formatting.
Katanosh Morovat.   This concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control of the operation.
7.3 MULTIPLICATION AND EXPONENTS:
JavaScript, Fourth Edition
INF 384 C, Spring 2009 Ontologies Knowledge representation to support computer reasoning.
7.4 MULTIPLICATION AND EXPONENTS:
The string data type String. String (in general) A string is a sequence of characters enclosed between the double quotes "..." Example: Each character.
Chapter 8 Cookies And Security JavaScript, Third Edition.
Presented by: Rhea McCaslin Dhaval Salvi
“Teach A Level Maths” Vol. 2: A2 Core Modules
Module 5 Planning for SQL Server® 2008 R2 Indexing.
Using answer set programming to answer complex queries Chitta Baral (joint work with Michael Gelfond, Texas Tech U and Richard Scherl, Monmouth U) Arizona.
1 Introduction to Software Engineering Lecture 1.
1 Open Ontology Repository: Architecture and Interfaces Ken Baclawski Northeastern University 1.
Introduction to programming in the Java programming language.
7.5 DIVISION AND EXPONENTS: Base: A number that is multiplied repeatedly. Exponent: A number that shows repeated multiplication. Property: A character.
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 14 Slide 1 Object-oriented Design.
Answering Complex Questions and Performing Deep Reasoning in Advance QA Systems – Reasoning with logic and probability Chitta Baral Arizona State university.
Devina DesaiF r a m e P r o b l e m What is a Frame Problem Environment for an agent is not static Identifying which things remain static in changing word.
ES component and structure Dr. Ahmed Elfaig The production system or rule-based system has three main component and subcomponents shown in Figure 1. 1.Knowledge.
LOGO 1 Corroborate and Learn Facts from the Web Advisor : Dr. Koh Jia-Ling Speaker : Tu Yi-Lang Date : Shubin Zhao, Jonathan Betz (KDD '07 )
To Boldly GO… Amelia Ireland GO Curator EBI, Hinxton, UK.
Inference : drawing a conclusion about something in the text using the text evidence, your own background knowledge and common sense.
Trustworthy Semantic Webs Dr. Bhavani Thuraisingham The University of Texas at Dallas Lecture #4 Vision for Semantic Web.
Mathematics subject knowledge enhancement course
Talking to Robots Using MS Speech SDK 5.1 in C# Sebastian van Delden USC Upstate
Agenda Introduction to Business Rules Simple in Concept/ Internal vs External Workflow Workflow Extender.
CSC271 Database Systems Lecture # 7. Summary: Previous Lecture  Relational keys  Integrity constraints  Views.
SATMathVideos.Net A set S consists of all multiples of 4. Which of the following sets are contained within set S? A) S2 only B) S4 only C) S2 and S4 D)
Multiplying Integers with Tiles Student Expectation: 7 th Grade: 7.1.2C Use models, such as concrete objects, pictorial models, and number lines, to add,
The Database and Info. Systems Lab. University of Illinois at Urbana-Champaign Understanding Web Query Interfaces: Best-Efforts Parsing with Hidden Syntax.
Relaxing Queries Presented by Ashwin Joshi Kapil Patil Sapan Shah.
Presented by Kyumars Sheykh Esmaili Description Logics for Data Bases (DLHB,Chapter 16) Semantic Web Seminar.
3/18/2002AIM AB Review of WSRP/WSIA Adaptation Description Language, Past and Present Directions. Ravi Konuru, IBM.
Introduction to UML and Rational Rose UML - Unified Modeling Language Rational Rose 98 - a GUI tool to systematically develop software through the following.
Images were sourced from the following web sites: Slide 2:commons.wikimedia.org/wiki/File:BorromeanRing...commons.wikimedia.org/wiki/File:BorromeanRing...
111 State Management Beginning ASP.NET in C# and VB Chapter 4 Pages
Architecture Components
Knowledge Representation and Inference
ILLUSTRATING INTEGERS Multiplication and Division
Operational Rules Model – step-by-step instructions and template
Normalization.
Scientific Workflows Lecture 15
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 with support structures Domain Knowledge Modules –Travel Module -- various –Support structure AnsProlog GUI [demo] Hiro AnsProlog Modules [demo] Luis KR Modules (AnsProlog + Prolog + Constraint LP) -- Dallas Knowledge Modeling [slides] Chitta Consistency restoring (CR-Prolog) -- last site visit Probabilistic reasoning (P-log) -- Tampa Further development of action languages Reasoning Modules –Detecting lies [slides] Chitta –Trying your best to achieve something [slides] Jicheng –Prediction, planning, explanation -- Baltimore –Counterfactuals -- ongoing Explanation generation modules –What is an explanation with respect to an answer set [slides] Jicheng

Bridge-building efforts – towards an integrated system Logical Form to extracted facts -- Dallas English to Link grammar output to extracted facts [slides] Luis Collaborative Curation [demo] Chitta AQUAINT web site

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.