Temporal Action Logic for Question Answering in an Adventure Game Temporal Action Logic for Question Answering in an Adventure Game Martin Magnusson and.

Slides:



Advertisements
Similar presentations
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Advertisements

CSC411Artificial Intelligence 1 Chapter 3 Structures and Strategies For Space State Search Contents Graph Theory Strategies for Space State Search Using.
Automatic Verification Book: Chapter 6. What is verification? Traditionally, verification means proof of correctness automatic: model checking deductive:
Constraint Propagation Algorithms for Temporal Reasoning Marc Vilain, Henry Kautz (AAAI 1986) Presentation by Lin XU March 4, 2002.
The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
Artificial Intelligence Chapter 21 The Situation Calculus Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
COMPUTER PROGRAMMING I Understand Problem Solving Tools to Design Programming Solutions.
Fall 2004COMP 3351 Simplifications of Context-Free Grammars.
CS 31003: Compilers  Difference between SLR and LR(1)  Construction of LR(1) parsing table  LALR parser Bandi Sumanth 11CS30006 Date : 9/10/2013.
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
Chapter 10 Artificial Intelligence © 2007 Pearson Addison-Wesley. All rights reserved.
CPSC 322 Introduction to Artificial Intelligence November 10, 2004.
Costas Buch - RPI1 Simplifications of Context-Free Grammars.
1 Normal Forms for Context-free Grammars. 2 Chomsky Normal Form All productions have form: variable and terminal.
Big Ideas in Cmput366. Search Blind Search Iterative deepening Heuristic Search A* Local and Stochastic Search Randomized algorithm Constraint satisfaction.
Fall 2003Costas Busch - RPI1 Decidable Problems of Regular Languages.
1 Normal Forms for Context-free Grammars. 2 Chomsky Normal Form All productions have form: variable and terminal.
BDI Agents Martin Beer, School of Computing & Management Sciences,
Prof. Busch - RPI1 Decidable Problems of Regular Languages.
Wilma Bainbridge Tencia Lee Kendra Leigh
CS-EE 481 Spring Founders Day, 2005 University of Portland School of Engineering Project Pocket Gopher Conversational Learning Agent Team Josh Jones.
Artificial Intelligence: Its Roots and Scope
Introduction to Programming Concepts & Logic
Knowledge Representation Use of logic. Artificial agents need Knowledge and reasoning power Can combine GK with current percepts Build up KB incrementally.
Discrete Structures for Computing
B-KUL-H02B1A Natural Language Processing Taught by: Marie-Francine Moens Vincent Vandeghinste Lectures and exercises 2nd semester 4 study points.
School of Computer Science, The University of Adelaide© The University of Adelaide, Australian Computer Science Week 2005 Selected papers from: ACSC.
Introduction to Programming Concepts & Logic COP1006 with Dr. Meg McManus McManusCOP10061.
Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
Postulates and Paragraph Proofs Section 2-5.  postulate or axiom – a statement that describes a fundamental relationship between the basic terms of geometry.
1 CS 385 Fall 2006 Chapter 1 AI: Early History and Applications.
1 The main topics in AI Artificial intelligence can be considered under a number of headings: –Search (includes Game Playing). –Representing Knowledge.
Agents that Reduce Work and Information Overload and Beyond Intelligent Interfaces Presented by Maulik Oza Department of Information and Computer Science.
KNOWLEDGE BASED SYSTEMS
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
Lecture 4 Correctness and Fairness Verification and Assurance.
3-3: Parallel Lines & Angles Unit 3: Geometry English Casbarro.
Artificial Intelligence Midterm 고려대학교 컴퓨터학과 자연어처리 연구실 임 해 창.
Chap. 7, Syntax-Directed Compilation J. H. Wang Nov. 24, 2015.
Computer Studies Today Chapter 1 1 »Attempts to develop computer systems that can simulate human thinking processes and actions.
Primary Decision Support Technologies Management Support Systems (MSS)
The Matrix Equation A x = b (9/16/05) Definition. If A is an m  n matrix with columns a 1, a 2,…, a n and x is a vector in R n, then the product of A.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Introduction to Artificial Intelligence Heshaam Faili University of Tehran.
Understand Problem Solving Tools to Design Programming Solutions
Cognitive Language Processing for Rosie
Chapter 11: Artificial Intelligence
PART IV: The Potential of Algorithmic Machines.
EA C461 – Artificial Intelligence Logical Agent
Committee of Experts World Intellectual Property Organization
EA C461 – Artificial Intelligence Logical Agent
Knowledge Representation
Brad Clement and Ed Durfee Artificial Intelligence Laboratory
Programming Language Syntax 6
Programming Language Syntax 7
Karel the Robot – Making Decisions
دانشگاه شهیدرجایی تهران
Postulates and Theorems
تعهدات مشتری در کنوانسیون بیع بین المللی
Decidable Problems of Regular Languages
Biointelligence Lab School of Computer Sci. & Eng.
Symbolic AI 2.0 Yi Zhou.
Click to add Text Computers & Instructions. Computers are given instructions in the form of computer programs that are created through the development.
CS 416 Artificial Intelligence
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
Straight line graphs: Horizontal and vertical lines
Straight line graphs: Horizontal and vertical lines
Normal Forms for Context-free Grammars
Problem Solving and Computer Programming
Presentation transcript:

Temporal Action Logic for Question Answering in an Adventure Game Temporal Action Logic for Question Answering in an Adventure Game Martin Magnusson and Patrick Doherty Artificial Intelligence and Integrated Computer Systems Linköping University, Sweden

Why Logic? AGI must be applicable to any (intellectual) problem 1.Theorem proving 2.Universality 3.Natural language If this sounds too easy to be true, you're right! Martin Magnusson, Linköping University 2

1. Theorem Proving Stumbling block The black box view turns out to be completely impractical Our proposal General natural deduction augmented with specialized rules Martin Magnusson, Linköping University 3

2. Universality Stumbling block Logic could potentially be used to build AGI, but partial solutions are useless Our proposal Computer games provide applications at all levels of difficulty Martin Magnusson, Linköping University 4

3. Natural Language Stumbling block No one has managed to build a grammar for English Our proposal Interactive parsing limits input without putting on a straight jacket Martin Magnusson, Linköping University 5

6

Logical Agents in Games Logical agents in computer games provide one avenue for useful incremental progress towards AGI Martin Magnusson, Linköping University 7

8 Thank you for your attention Read more at Read more at

Future Work Improving the grammar and parser Integrating perception, reasoning, planning, execution, and plan revision Dealing with conflicting information Accepting or rejecting delegated goals STNU execution algorithm Martin Magnusson, Linköping University 9