LbR and Robust Reasoning (Solidification Loop); LbR and Introspection (Solidification Loop); LbR and Knowledge Acquisition Over Text with Diagrammatic.

Slides:



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

Modelling with expert systems. Expert systems Modelling with expert systems Coaching modelling with expert systems Advantages and limitations of modelling.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Presentation on Artificial Intelligence
RAIR Lab Visit, Ken Gertz (draft v3; final) Rensselaer AI & Reasoning (RAIR) Lab Personnel: Faculty: Selmer Bringsjord, Konstantine Arkoudas, Marc.
Working with Discourse Representation Theory Patrick Blackburn & Johan Bos Lecture 3 DRT and Inference.
Introducing Chogic: A Primitive Part of the MARMML Machine Reasoning System Selmer Bringsjord Konstantine Arkoudas, Josh Taylor, Yingrui Yang, Paul Bello.
CPSC 422, Lecture 21Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 21 Mar, 4, 2015 Slide credit: some slides adapted from Stuart.
LIFE CYCLE MODELS FORMAL TRANSFORMATION
Learning by Reading Micah Clark & Selmer Bringsjord Rensselaer AI & Reasoning (RAIR) Laboratory Department of Cognitive Science Department of Computer.
SUCCESSFUL SERVICE DESIGN Turning innovation into practice READ MORE... USER GUIDE Read the “User Guide” to find out more about this site START Ready to.
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
Generic Programming and Formal Methods David R. Musser Rensselaer Polytechnic Institute.
Philosophy 120 Symbolic Logic I H. Hamner Hill CSTL-CLA.SEMO.EDU/HHILL/PL120.
1 OSCAR: An Architecture for Generally Intelligent Agents John L. Pollock Philosophy and Cognitive Science University of Arizona
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
RESEARCH METHODS Introduction to Research Lecture 1:
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
The Semantic Web Week 1 Module Content + Assessment Lee McCluskey, room 2/07 Department of Computing And Mathematical Sciences Module.
Semantics For the Semantic Web: The Implicit, the Formal and The Powerful Amit Sheth, Cartic Ramakrishnan, Christopher Thomas CS751 Spring 2005 Presenter:
1 Department of Computer Science and Engineering, University of South Carolina Issues for Discussion and Work Jan 2007  Choose meeting time.
Describing Syntax and Semantics
What makes communication by language possible? Striking fact (a) If someone utters a sentence and you know which proposition her utterance expresses, then.
Lab 8 – C# Programming Adding two numbers CSCI 6303 – Principles of I.T. Dr. Abraham Fall 2012.
Intro to Discrete Structures
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
1 Shawlands Academy Higher Computing Software Development Unit.
Chapter 2 소프트웨어공학 Software Engineering 임현승 강원대학교
Artificial Intelligence 4. Knowledge Representation Course V231 Department of Computing Imperial College, London © Simon Colton.
CSNB234 ARTIFICIAL INTELLIGENCE
LDK R Logics for Data and Knowledge Representation Modeling First version by Alessandro Agostini and Fausto Giunchiglia Second version by Fausto Giunchiglia.
1 The Software Development Process  Systems analysis  Systems design  Implementation  Testing  Documentation  Evaluation  Maintenance.
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
Selmer Bringsjord & Konstantine Arkoudas Andrew Shilliday, Joshua Taylor Sangeet Khemlani, Eric Pratt, Bettina Schimanski, Gabe Mulley Rensselaer AI &
Is it Possible to Build Dramatically Compelling Interactive Digital Entertainment? v2 Selmer Bringsjord Director, Minds & Machines Laboratory Prof of Logic.
Pattern-directed inference systems
1 Knowledge Representation. 2 Definitions Knowledge Base Knowledge Base A set of representations of facts about the world. A set of representations of.
RAIR Lab John Licato Selmer Bringsjord Department of Cognitive Science Department of Computer Science Lally School of Management Rensselaer.
Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
PDE3 – Frameworks for interoperability of Product Data in SME based environment Lecturer: Ricardo Gonçalves.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 13 of 41 Monday, 20 September.
1 CS 385 Fall 2006 Chapter 1 AI: Early History and Applications.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
The Software Development Process
1 Knowledge Acquisition and Learning by Experience – The Role of Case-Specific Knowledge Knowledge modeling and acquisition Learning by experience Framework.
Basic Concepts of Logic An Overview of Introduction to Logic Yingrui Yang
Submitted To: Rutvi sarang Submitted By: Kushal Bhagat.
SAGE ARIVA ARIVA PI Conference, November 2005 UNCLASSIFIED//FOR OFFICIAL USE ONLY.
CPSC 322, Lecture 19Slide 1 (finish Planning) Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt – 5.2) Oct,
CPSC 422, Lecture 21Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 21 Oct, 30, 2015 Slide credit: some slides adapted from Stuart.
Course Overview  What is AI?  What are the Major Challenges?  What are the Main Techniques?  Where are we failing, and why?  Step back and look at.
Research Methodology Class.   Your report must contains,  Abstract  Chapter 1 - Introduction  Chapter 2 - Literature Review  Chapter 3 - System.
Introduction to Artificial Intelligence CS 438 Spring 2008.
2 nd Grade Language Arts World Class Outcome Create meaning strategically in: Reading Writing Speaking Listening Evaluate how authors are strategic in.
Ben Goertzel, PhD Novamente LLC Biomind LLC Artificial General Intelligence Research Institute Virginia Tech, Applied Research Lab for National and Homeland.
1 The Software Development Process ► Systems analysis ► Systems design ► Implementation ► Testing ► Documentation ► Evaluation ► Maintenance.
Hypercomputation and the Human Mind Selmer Bringsjord Professor of Logic, Philosophy, Cognitive Science, and Computer Science Rensselaer AI & Reasoning.
Copyright © 2011 Wolters Kluwer Health | Lippincott Williams & Wilkins Chapter 1 Research: An Overview.
On Abductive Equivalence Katsumi Inoue National Institute of Informatics Chiaki Sakama Wakayama University MBR
Computing & Information Sciences Kansas State University Wednesday, 04 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 17 of 42 Wednesday, 04 October.
Artificial Intelligence Knowledge Representation.
Computing & Information Sciences Kansas State University Friday, 13 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 21 of 42 Friday, 13 October.
The Hebrew University of Jerusalem School of Engineering and Computer Science Academic Year: 2011/2012 Instructor: Jeff Rosenschein.
CPSC 121: Models of Computation REVIEW. Course Learning Outcomes You should be able to: – model important problems so that they are easier to discuss,
Introduction to Artificial Intelligence Heshaam Faili University of Tehran.
Artificial Intelligence 4. Knowledge Representation
Done Done Course Overview What is AI? What are the Major Challenges?
Reasoning deduction, induction, abduction Problem solving
Teaching Computing to GCSE
Presentation transcript:

LbR and Robust Reasoning (Solidification Loop); LbR and Introspection (Solidification Loop); LbR and Knowledge Acquisition Over Text with Diagrammatic Content (Know. Acquisition Loop) Slides for Noah’s Prospective LbR Program run “Slide Show” for hyperlinks version of July 8 th, 2005 Selmer Bringsjord Rensselaer AI & Reasoning Lab Department of Cognitive Science Department of Cognitive Science (Chair) Department of Computer Science Rensselaer Polytechnic Institute Rensselaer Polytechnic Institute (RPI) Troy NY USA

LbR and Robust Reasoning Arguably the best machine reasoning system in the world today: Athena, invented by Konstantine ArkoudasAthena, –seamlessly integrated with standard first-order ATPs (e.g., Vampire, SPASS, Otter, and whatever is next in this ever-progressing game) –fully programmable (& allows recursive datatypes, polymorphism, etc.) –human control adjustable from zero to full –includes cutting-edge explanation generation in straight English as a problem solving technique –“natural” format used, not simple chaining or resolution: modeled on what is human-readable (see the pdf for an overview of natural-style reasoning) natural format allows representation and reasoning over uncertain information –allows ideal mix of efficiency and expressivity via sub-sorted multi-sorted logic (e.g., modal logics can be efficiently encoded in MSL sub ) –enables model generation abductionmodel generation abduction –integrated with model builders –already includes more than the features currently being sought for the ISO & ARDA standard, Common Logic! –proved sound and has fully formal semantics, and falls within the class of well- founded Denotational Proof Languages

Robust Reasoning & Explanation Generation in English Using Athena, we can generate fluid English from proofs and arguments, including partial and defective proofs and arguments. A problem solving technique that we can therefore support in the Solidification Loop is to have the system generate English to communicate the state of its knowledge, and have humans judge on the basis of this English what adjustments and additions need to be made to the system’s knowledge. Here is a demo and explanation of our seminal approach/R&D in Natural Language Generation: –

LbR and Robust Reasoning Arguably the best machine reasoning system in the world today: Athena, invented by Konstantine Arkoudas Athena, –seamlessly integrated with standard first-order ATPs (e.g., Vampire, SPASS, Otter, and whatever is next in this ever-progressing game) –fully programmable (& allows recursive datatypes, polymorphism, etc.) –human control adjustable from zero to full –“natural” format used, not simple chaining or resolution: modeled on what is human-readable (see the pdf for an overview of natural-style reasoning) natural format allows representation and reasoning over uncertain information –allows ideal mix of efficiency and expressivity via sub-sorted multi- sorted logic (e.g., modal logics can be efficiently encoded in MSL sub ) –enables model generation abductionmodel generation abduction –integrated with model builders –already includes more than the features currently being sought for the ISO & ARDA standard, Common Logic! –proved sound and has fully formal semantics, and falls within the class of well-founded Denotational Proof Languages Introspection

1. Abductive Introspection Based on Natural Deduction/Argumentation When reasoning is based not on flat, uninformative forms of reasoning like resolution, but rather on natural deduction and argumentation, the technique of goal analysis can be used. Goal analysis allows gaps in reasoning to be readily identified, and the required “shape” of these gaps to be pinned down. Once these gaps have been identified, abductive hypotheses can be ventured as to how to fill them in in order to complete the reasoning in question. These hypotheses can then be supplied to the Knowledge Acquisition loop.

LbR and Introspection Arguably the best machine reasoning system in the world today: Athena, invented by Konstantine Arkoudas Athena, –seamlessly integrated with standard first-order ATPs (e.g., Vampire, SPASS, Otter, and whatever is next in this ever-progressing game) –fully programmable (& allows recursive datatypes, polymorphism, etc.) –human control adjustable from zero to full –“natural” format used, not simple chaining or resolution: modeled on what is human-readable (see the pdf for an overview of natural-style reasoning) natural format allows representation and reasoning over uncertain information –allows ideal mix of efficiency and expressivity via sub-sorted multi- sorted logic (e.g., modal logics can be efficiently encoded in MSL sub ) –enables model generation abductionmodel generation abduction –integrated with model builders –already includes more than the features currently being sought for the ISO & ARDA standard, Common Logic! –proved sound and has fully formal semantics, and falls within the class of well-founded Denotational Proof Languages

2. A New Form of Abduction: Model Generation Abduction Suppose that the system is trying to establish some proposition A on the basis of background knowledge  and a particular theory C, but only has some of the knowledge it takes to substantiate A. Then the following form of abduction can be run semi-automated using Athena as a problem solving technique, because refinement of C can be carried out by the Know. Acquisition loop; i.e., the information said to be possibly missing can be sought by the Know. Acq. loop. Please note that model finding is an automated process under Athena. It is a way of building a possible scenario.

LbR and Introspection Arguably the best machine reasoning system in the world today: Athena, invented by Konstantine Arkoudas Athena, –seamlessly integrated with standard first-order ATPs (e.g., Vampire, SPASS, Otter, and whatever is next in this ever-progressing game) –fully programmable (& allows recursive datatypes, polymorphism, etc.) –human control adjustable from zero to full –“natural” format used, not simple chaining or resolution: modeled on what is human-readable (see the pdf for an overview of natural-style reasoning) natural format allows representation and reasoning over uncertain information –allows ideal mix of efficiency and expressivity via sub-sorted multi- sorted logic (e.g., modal logics can be efficiently encoded in MSL sub ) –enables model generation abductionmodel generation abduction –integrated with model builders –already includes more than the features currently being sought for the ISO & ARDA standard, Common Logic! –proved sound and has fully formal semantics, and falls within the class of well-founded Denotational Proof Languages

3. MSL-Encoded Epistemic Logic as a Framework for Introspection The Challenge: –Provide a rigorous framework for managing when and how reasoning fails, and for determining missing knowledge from the failure and drive the acquisition of that missing knowledge. And, do all this rapidly. That is, a three-part need: –The envisaged framework must know what it knows, and know what it doesn’t know (relative to its goals). –The framework must be able to arrive at a state in which it does have the knowledge it needs. –This must be done in unprecedentedly (such metareasoning has been notoriously slow in the past) rapid fashion. The solution: Use extension of techniques already validated for AFRL by Bringsjord and Arkoudas, as explained in this paper.this paper In addition, use techniques for proof and argument diagnosis, already in use in Bringsjord’s ARDA-sponsored Slate system.Slate

Knowledge Acquisition & LbR Text Containing Diagrams & Pictures Arkoudas and Bringsjord have created a new Denotational Proof Language, tentatively called DNDL, for the express purpose of machine reading of text containining diagrams. Bringsjord’s RAIR Lab also has a team working on image processing, where the images are specifically ones found in math text to be machine read. This team has working systems now that read diagram-rich text directly. Because it’s not clear that the texts to be read in this LbR program will have diagrams that are to be machine read in earnest, we don’t include here hyperlinks to technical content.