DOCSLIB.ORG

Artificial Intelligence: an Analysis of Potential Applications to Training, Performance Measurenient, and Job Performance Aiding

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Artificial Intelligence: an Analysis of Potential Applications to Training, Performance Measurenient, and Job Performance Aiding DOCUMENT RESUME ED 255 665 CE 041 126 AUTHOR Richardson, J. Jeffrey TITLE Artificial Intelligence: An Analysis of Potential Applications to Training, Performance Measurenient, and Job Performance Aiding. Interim Report for Period September 1982-July 1983. INSTITUTION Denver Univ., Colo. Denver Research Inst. SPONS AGENCY Air Force Human Resources Lab., Brooks AFB, Texas. REPORT 110 AFHRL-TP-83-28 PUB DATE Sep 83 CONTRACT F33615-82-C-0013 NOTE 79p. PUB TYPE Reports Research/Technical (143) EDRS PRICE MF01/PC04 Plus Postage. DESCRIPTORS *Artificial Intelligence; *Computer Oriented Programs; Computer Software; Evaluation Criteria; *Evaluation Methods; *Job Performance; Job Training; *Military Training; Postsecondary Education; Program Development; Research and Development; Research Projects; Specifications IDENTIFIERS *Air Force ABSTRACT This paper is part of an Air Force planning effortto develop a research, development, and applications program for theuse of artificial intelligence (AI) technology in three targetareas: training, performance measurement, and job performance aiding. The paper is organized in five sections that (1) introduce the reader to AI and those subfields of AI that are most relevant to thisprogram, (2) report on relevant ongoing research and development sponsored by the Department of Defense, (3) establish the challenges facing the Air Force in three target areas and explain how each presents opportunities for AI applications, (4) draw out important practical concerns that must be faced by an AI research and development program, and finally, (5) propose a set of recommendations for building an Air Force AI applications program in training, performance measurement, and job performance aiding. An eight-page , bibliography and a list of current relevant Department of Defense research projects are included in the report. (Author /::C) *********************************************************************** Reproluctions supplied by EDRS are the best thatcan be made from the original. document. ************************************N********************************** AFHRIMP8328 BEST COPY AVAILABL MR FORCE t=3 ARTIFICIAL INTELLIGENCE: w AN ANALYSIS OF POTENTIAL APPLICATIONS TO TRAINING, PERFORMANCE MEASUREMENT, AND JOB PERFORMANCE AIDING By J. Jeffrey Richardson Denver Research Institute M University of Denver Denver, Colorado 80208 TRAINING SYSTEMS DIVISION Lowry Air Force flaw, Colorado 80230 vc S September 1983 Interim Report for Period September 1982 July 1983 0 U R Approved for public release; distribution unlimited. a S LABORATO A iqoiookiiviitiohob(414flAu,N4fe-ef,wiomv4.-fw-*/...i4-1,,go,o;:otti: ELECTE "NA AIR FORCE SYSTEMS COMMAND PO BROOKS AIR FORCE BASe,TEXAS 78235 OCT 1 4 1983 II S DEPAIIIMFNI OF I DUCA HUN NA flONAI FoticAlION ()(, At()^4,1; ', ()WAI ,INIfN I 141( B 83 10 13 002 riti "1,1.,011,.111, 1),,goilon NOTICE When Government drawings.. specifications.or other data are used for any purpose other than in connoction with a definitely Government-relatedprocurement, the United States Government incurs no responsibilityor any obligation whatsoever. The fact that the Government may have formulatedor in any way supplied the said drawings, specifications, ii or other data, is 1101 to be regarded by implication, or otherwise inany manner construed, as licenuiog the h4Ader, or any other person or corporation;or as conveying any rights or permisaLon to manuticotre, use,or sell any patented invention that may in any way be related thereto. The Public Affairs Office has reviewed thispaper, and it is releasable to the National Technical Information Service, where it will be availableto the General public, including fete* nationals. This paper has been reviewed and is approved forpublication. BRIAN E. DALLMAN Contract M,nitor JOSEPH Y. YASUTAKE, Technical Director Training Systems Division ALLEN 1. PARTIN, Lt Colonel, USAF Chief, Training Systems Division J BEST COPY AVAILABLE Unclassified CURRY CU1S3IFICATI0N OF THIS PAGR Mew remora READ INSTRUCTIONS REPORT DOCUMENTATION PAGE BEFORE COMPLETING FORM 1. REPORT NUMBER 2. GOVT ACCESSION NO. & RECIPX.NTS CATALOG NUMBER AFH RL-TP83-28 A 1)-4 / 3 4 4.W= (awl Soitifit) 5. TYPE OF REPORT & PERIOD COVERED ARTIFICIAL INTELUGENCE: AN ANALYSIS OF Interim POTENTIAL APPLICATIONS TO TRAINING, PERFORMANCE September 1982 -July 1983 MEASUREMENT, AND JOB PERFORMANCE AIDING 6. PERFORMING ORG. REPORT NUMBER 7. AUTIKHt (s) 3. CONTRACT OR GRANT NUMBER (s) J. Jeffrey Richardson F33615-82-C-0013 9 PERFORMING ORGANIZATION NAME AND ADDRESS 10. PROGRAM ELEMENT, PROJECT, TASK Deaver Resesreh Institute AREA & WORK UNIT NUMBERS University of Denver 62205F Denver, r:alorado 80208 11210915 II.CONTP.OLLING OFFICE NAME AND ADDRESS 12. REPORT DATE HQ Air Force Human Reliance. Laboratory (A7SC) September 1983 Brooks Mr Force Rue, Texas 78235 13. NUMBER OF PAGES 80 14. MONITORING AGENCY NAME & ADDRESS (y* dermal front Controlling Office) 15. S'..CURTTY CLASS (V AU report) Training Systems Division .clasaified Air Force Human Resources Laboratory Lowry Air Force Rase, Colorado 80230 15.s. DECLASSIFICATION/DOWNGRADING SCHEDULE 16. DISTRIBUTION STATEMENT (of Otis Report) Approved for public release; distribution unlimited. 17. DISTRIBUTION STATEMENT (of Air abstract entered ut MA 20, if different front Report) 18. SUPPLEMENTA :1 Y NOTE) 19. KEY WOFIPS (Cows,wwo on town side ! if necrinvy and kingly by block mimetic.) artificial intelligence military research computer-sided diagnosis performance tests computer-assisted instruction task analysis job analysis training job performance aii.s 20. ABSTRACT (Colunum on rtwrot rid. f i nooesitiry an i nitrify& byblockagnsbe-I ti This paper is part of a planning effort to developa research, development, and applications Nog= for the utilization of artificial intelligence (Al) technology in three targetareas: training, performance measurement, and job performance aiding. The paper10 introduces the reader to 141 and those subfielda of AI thatare most relevant to this program, ili) reports on rrlevant ongoing ret.esrch and development sponsored by the Department of Defenso,Jp) establishes the challenges facing the Ak Force in the three targetareas and explains how each presents opportunities for Al applications,, draws out important practical concerns which must be faced by an Al research and development____ Da Farm14'13 LOTTION or 1 NOV 65 N °MOLE-ff. Unclitssifiefl SECURITY CLASSIFICATION of TILLS PACE (fawn Nat EAkrid) BEST COPY AVAILABLE threlalsiged SWUM CLASSIFICATION Of TIM PAGE MhosDag inkred) hem 20 (Costumed) plegram, and finally, #proposes a set of reconunendationa for buildingan Air Force Al application, program in training. performance measurement, and job performance aiding. lmrlaesifird SECURITY CLAMIFICATION OF THIS PAGE (WhenDodo Eruerrd) BEST COPY AVP'./\SLE AFIIRL Technical Paper 8.28 September 1983 ARTIFICIAL INTELLIGENCE' AN ANALYSIS OF POTENTIAL APPLICATIONS TO TRAINING, PERFORMANCE MEASUREMENT, AND JOB PERFORMANCE AIDING By J. Jeffrey Richardson Soctial Systems Research and Evaluation Dim-taints Denver Researeh Inatitate University of Denver Denver, Colorado 80208 Reviewed by Brian E. Dab's= Research Psyeiologist Submitted for publication by David L. Pohlman, Major, USAF Chief, Skills Development Branch This interim report documentsa scgmen. of a larger technical in ogram. It is published in the interest of scientific and technicalinfortnation exchange. BEST COPY AVAILABLE ACKNOWLEDGEMENTS Dr. Peter G. Poison, Dep.irtment of Psychology, University of Colorado, andDr.MarkL.Miller,Computec*Thought Corporation,contributedas consultants to the development of thispaper. We are grateful for their help and cooperation. Program officers with the vario:is DoD agencies doing workrelevant to this report were extremely helpful in azsistingusin acquiring current information regarding ongoing research activities in DoD. Weare grateful to our technical monitor; Mr. Brian Dailman, Air Force Purlr rtes3urces 1,ot:oratory, for his encouragement to go beyonda survey treatment c..f, the issues and develop a tentative plan of action for Al applications. Aocco51o7 For r: is ffiA3J Tn DTIC O ELEci-E7f08 OCT 1 4 1983 [By . !IV DistriNtion/ Avsilt,bility Codes B Avail any' /or Dist Pr i BEST COPY AVAILABI TABLE OF CONTENTS ACKNOWLEDGEMENTS CHAPTER I. INTRODUCTION Background of This Report Capsule History of Al Artificial Intelligence 2 2 CHAPTER II. CURRENTRELEVANT DOD RESEARCH AND DEVELOPMENT 7 DoD Centel s of Activity 7 CHAPTER III. CHALLENGES AND APPROACHES 17 Introduction Task Analysis 17 Training: In-Residence 18 and On-the-Job 24 Performance Measurement 33 Job Performance Aiding 36 Integrating Training,Measurement, 3PAs, and Job Design 39 CHAPTER N. PRACTICAL CONSIDERATIONS 41 Hardware Software Tools 41 Personnel 42 43 Guidelines for Practical Efforts 44 CHAPTER V. CONCLUSIONS AND RECOMMENDATIONS 48 Conclusions Recommendations 48 49 BIBLIOGRAPHY 52 APPENDIX A: CURRENTRELEVANT DoD RESEARCH PROJEC l'S--DETAILED LISTING 61 iii LPREVIOUS PACE IS OLANK rsi CHAPTER I. INTRODUCTION kl ,... Artificial intelligence (Al) isone of the emerging technologies of the 1980s. Al is the use ofcomputers to perform tasks typically consideredto require intelligerice. This.form of computingconcerns the manipulation of symbols wilich encode the knowledge and the . competence to perform intelligert acts, ratherthan the familiar form of computingthat concerns numerical calculation andrecord keeping. I, Almost all computing done todayinvolves numerical calculation;for example,
Load more

Recommended publications
  • Artificial Consciousness and the Consciousness-Attention Dissociation
    Consciousness and Cognition 45 (2016) 210–225 Contents lists available at ScienceDirect Consciousness and Cognition journal homepage: www.elsevier.com/locate/concog Review article Artificial consciousness and the consciousness-attention dissociation ⇑ Harry Haroutioun Haladjian a, , Carlos Montemayor b a Laboratoire Psychologie de la Perception, CNRS (UMR 8242), Université Paris Descartes, Centre Biomédical des Saints-Pères, 45 rue des Saints-Pères, 75006 Paris, France b San Francisco State University, Philosophy Department, 1600 Holloway Avenue, San Francisco, CA 94132 USA article info abstract Article history: Artificial Intelligence is at a turning point, with a substantial increase in projects aiming to Received 6 July 2016 implement sophisticated forms of human intelligence in machines. This research attempts Accepted 12 August 2016 to model specific forms of intelligence through brute-force search heuristics and also reproduce features of human perception and cognition, including emotions. Such goals have implications for artificial consciousness, with some arguing that it will be achievable Keywords: once we overcome short-term engineering challenges. We believe, however, that phenom- Artificial intelligence enal consciousness cannot be implemented in machines. This becomes clear when consid- Artificial consciousness ering emotions and examining the dissociation between consciousness and attention in Consciousness Visual attention humans. While we may be able to program ethical behavior based on rules and machine Phenomenology learning, we will never be able to reproduce emotions or empathy by programming such Emotions control systems—these will be merely simulations. Arguments in favor of this claim include Empathy considerations about evolution, the neuropsychological aspects of emotions, and the disso- ciation between attention and consciousness found in humans.
    [Show full text]
  • Computability and Complexity
    Computability and Complexity Lecture Notes Herbert Jaeger, Jacobs University Bremen Version history Jan 30, 2018: created as copy of CC lecture notes of Spring 2017 Feb 16, 2018: cleaned up font conversion hickups up to Section 5 Feb 23, 2018: cleaned up font conversion hickups up to Section 6 Mar 15, 2018: cleaned up font conversion hickups up to Section 7 Apr 5, 2018: cleaned up font conversion hickups up to the end of these lecture notes 1 1 Introduction 1.1 Motivation This lecture will introduce you to the theory of computation and the theory of computational complexity. The theory of computation offers full answers to the questions, • what problems can in principle be solved by computer programs? • what functions can in principle be computed by computer programs? • what formal languages can in principle be decided by computer programs? Full answers to these questions have been found in the last 70 years or so, and we will learn about them. (And it turns out that these questions are all the same question). The theory of computation is well-established, transparent, and basically simple (you might disagree at first). The theory of complexity offers many insights to questions like • for a given problem / function / language that has to be solved / computed / decided by a computer program, how long does the fastest program actually run? • how much memory space has to be used at least? • can you speed up computations by using different computer architectures or different programming approaches? The theory of complexity is historically younger than the theory of computation – the first surge of results came in the 60ties of last century.
    [Show full text]
  • Inventing Computational Rhetoric
    INVENTING COMPUTATIONAL RHETORIC By Michael W. Wojcik A THESIS Submitted to Michigan State University in partial fulfillment of the requirements for the degree of Digital Rhetoric and Professional Writing — Master of Arts 2013 ABSTRACT INVENTING COMPUTATIONAL RHETORIC by Michael W. Wojcik Many disciplines in the humanities are developing “computational” branches which make use of information technology to process large amounts of data algorithmically. The field of computational rhetoric is in its infancy, but we are already seeing interesting results from applying the ideas and goals of rhetoric to text processing and related areas. After considering what computational rhetoric might be, three approaches to inventing computational rhetorics are presented: a structural schema, a review of extant work, and a theoretical exploration. Copyright by MICHAEL W. WOJCIK 2013 For Malea iv ACKNOWLEDGEMENTS Above all else I must thank my beloved wife, Malea Powell, without whose prompting this thesis would have remained forever incomplete. I am also grateful for the presence in my life of my terrific stepdaughter, Audrey Swartz, and wonderful granddaughter Lucille. My thesis committee, Dean Rehberger, Bill Hart-Davidson, and John Monberg, pro- vided me with generous guidance and inspiration. Other faculty members at Michigan State who helped me explore relevant ideas include Rochelle Harris, Mike McLeod, Joyce Chai, Danielle Devoss, and Bump Halbritter. My previous academic program at Miami University did not result in a degree, but faculty there also contributed greatly to my the- oretical understanding, particularly Susan Morgan, Mary-Jean Corbett, Brit Harwood, J. Edgar Tidwell, Lori Merish, Vicki Smith, Alice Adams, Fran Dolan, and Keith Tuma.
    [Show full text]
  • Computability Theory
    CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2019 Computability Theory This section is partly inspired by the material in \A Course in Mathematical Logic" by Bell and Machover, Chap 6, sections 1-10. Other references: \Introduction to the theory of computation" by Michael Sipser, and \Com- putability, Complexity, and Languages" by M. Davis and E. Weyuker. Our first goal is to give a formal definition for what it means for a function on N to be com- putable by an algorithm. Historically the first convincing such definition was given by Alan Turing in 1936, in his paper which introduced what we now call Turing machines. Slightly before Turing, Alonzo Church gave a definition based on his lambda calculus. About the same time G¨odel,Herbrand, and Kleene developed definitions based on recursion schemes. Fortunately all of these definitions are equivalent, and each of many other definitions pro- posed later are also equivalent to Turing's definition. This has lead to the general belief that these definitions have got it right, and this assertion is roughly what we now call \Church's Thesis". A natural definition of computable function f on N allows for the possibility that f(x) may not be defined for all x 2 N, because algorithms do not always halt. Thus we will use the symbol 1 to mean “undefined". Definition: A partial function is a function n f :(N [ f1g) ! N [ f1g; n ≥ 0 such that f(c1; :::; cn) = 1 if some ci = 1. In the context of computability theory, whenever we refer to a function on N, we mean a partial function in the above sense.
    [Show full text]
  • Introduction to the Theory of Computation Computability, Complexity, and the Lambda Calculus Some Notes for CIS262
    Introduction to the Theory of Computation Computability, Complexity, And the Lambda Calculus Some Notes for CIS262 Jean Gallier and Jocelyn Quaintance Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104, USA e-mail: [email protected] c Jean Gallier Please, do not reproduce without permission of the author April 28, 2020 2 Contents Contents 3 1 RAM Programs, Turing Machines 7 1.1 Partial Functions and RAM Programs . 10 1.2 Definition of a Turing Machine . 15 1.3 Computations of Turing Machines . 17 1.4 Equivalence of RAM programs And Turing Machines . 20 1.5 Listable Languages and Computable Languages . 21 1.6 A Simple Function Not Known to be Computable . 22 1.7 The Primitive Recursive Functions . 25 1.8 Primitive Recursive Predicates . 33 1.9 The Partial Computable Functions . 35 2 Universal RAM Programs and the Halting Problem 41 2.1 Pairing Functions . 41 2.2 Equivalence of Alphabets . 48 2.3 Coding of RAM Programs; The Halting Problem . 50 2.4 Universal RAM Programs . 54 2.5 Indexing of RAM Programs . 59 2.6 Kleene's T -Predicate . 60 2.7 A Non-Computable Function; Busy Beavers . 62 3 Elementary Recursive Function Theory 67 3.1 Acceptable Indexings . 67 3.2 Undecidable Problems . 70 3.3 Reducibility and Rice's Theorem . 73 3.4 Listable (Recursively Enumerable) Sets . 76 3.5 Reducibility and Complete Sets . 82 4 The Lambda-Calculus 87 4.1 Syntax of the Lambda-Calculus . 89 4.2 β-Reduction and β-Conversion; the Church{Rosser Theorem . 94 4.3 Some Useful Combinators .
    [Show full text]
  • Programming with Recursion
    Purdue University Purdue e-Pubs Department of Computer Science Technical Reports Department of Computer Science 1980 Programming With Recursion Dirk Siefkes Report Number: 80-331 Siefkes, Dirk, "Programming With Recursion" (1980). Department of Computer Science Technical Reports. Paper 260. https://docs.lib.purdue.edu/cstech/260 This document has been made available through Purdue e-Pubs, a service of the Purdue University Libraries. Please contact [email protected] for additional information. '. \ PI~Q(:[V\!'<lMTNr. 11'1'1'11 nr:CUI~SrON l1irk Siefke$* Tcchnische UniveTsit~t Berlin Inst. Soft\~are Theor. Informatik 1 Berlin 10, West Germany February, 1980 Purdue University Tech. Report CSD-TR 331 Abstract: Data structures defined as term algebras and programs built from recursive definitions complement each other. Computing in such surroundings guides us into Nriting simple programs Nith a clear semantics and performing a rigorous cost analysis on appropriate data structures. In this paper, we present a programming language so perceived, investigate some basic principles of cost analysis through it, and reflect on the meaning of programs and computing. -;;----- - -~~ Visiting at. the Computer Science Department of Purdue University with the help of a grant of the Stiftung Volksl.... agem.... erk. I am grateful for the support of both, ViV-Stiftung and Purdue. '1 1 CONTENTS O. Introduction I. 'llle formnlislIl REe Syntax and semantics of REC-programs; the formalisms REC(B) and RECS; recursive functions. REC l~ith VLI-r-t'iblcs. -2. Extensions and variations Abstract languages and compilers. REC over words as data structure; the formalisms REC\\'(q). REe for functions with variable I/O-dimension; the forma l:i sms VREC (B) .
    [Show full text]
  • Computer Algorithms As Persuasive Agents: the Rhetoricity of Algorithmic Surveillance Within the Built Ecological Network
    COMPUTER ALGORITHMS AS PERSUASIVE AGENTS: THE RHETORICITY OF ALGORITHMIC SURVEILLANCE WITHIN THE BUILT ECOLOGICAL NETWORK Estee N. Beck A Dissertation Submitted to the Graduate College of Bowling Green State University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY May 2015 Committee: Kristine Blair, Advisor Patrick Pauken, Graduate Faculty Representative Sue Carter Wood Lee Nickoson © 2015 Estee N. Beck All Rights Reserved iii ABSTRACT Kristine Blair, Advisor Each time our students and colleagues participate online, they face invisible tracking technologies that harvest metadata for web customization, targeted advertising, and even state surveillance activities. This practice may be of concern for computers and writing and digital humanities specialists, who examine the ideological forces in computer-mediated writing spaces to address power inequality, as well as the role ideology plays in shaping human consciousness. However, the materiality of technology—the non-human objects that surrounds us—is of concern to those within rhetoric and composition as well. This project shifts attention to the materiality of non-human objects, specifically computer algorithms and computer code. I argue that these technologies are powerful non-human objects that have rhetorical agency and persuasive abilities, and as a result shape the everyday practices and behaviors of writers/composers on the web as well as other non-human objects. Through rhetorical inquiry, I examine literature from rhetoric and composition, surveillance studies, media and software studies, sociology, anthropology, and philosophy. I offer a “built ecological network” theory that is the manufactured and natural rhetorical rhizomatic network full of spatial, material, social, linguistic, and dynamic energy layers that enter into reflexive and reciprocal relations to support my claim that computer algorithms have agency and persuasive abilities.
    [Show full text]
  • 6.2 Presenting Formal and Informal Mathematics
    PDF hosted at the Radboud Repository of the Radboud University Nijmegen The following full text is a publisher's version. For additional information about this publication click this link. http://hdl.handle.net/2066/119001 Please be advised that this information was generated on 2021-09-27 and may be subject to change. Documentation and Formal Mathematics Web Technology meets Theorem Proving Proefschrift ter verkrijging van de graad van doctor aan de Radboud Universiteit Nijmegen, op gezag van de rector magnificus prof. mr. S.C.J.J. Kortmann, volgens besluit van het college van decanen in het openbaar te verdedigen op dinsdag 17 december 2013 om 12.30 uur precies door Carst Tankink geboren op 21 januari 1986 te Warnsveld Promotor: Prof. dr. J.H. Geuvers Copromotor: Dr. J.H. McKinna Manuscriptcommissie: Prof. dr. H.P. Barendregt Prof. dr. M. Kohlhase (Jacobs University, Bremen) Dr. M. Wenzel (Université Paris Sud) ISBN:978-94-6191-963-2 This research has been carried out under the auspices of the research school IPA (Institute for Programming research and Algorithmics). The author was supported by the Netherlands Organisation for Scientific Research (NWO) under the project “MathWiki: a Web-based Collaborative Authoring Environment for Formal Proofs”. cbaThis work is licensed under a Creative Commons Attribution-ShareAlike 3.0 Unported License. The source code of this thesis is available at https://bitbucket.org/Carst/thesis. Contents Contents iii Preface vii 1 Introduction 1 1.1 Wikis and other Web Technology . .2 1.2 Tools of the Trade: Interactive Theorem Provers . .4 1.3 Collaboration or Communication .
    [Show full text]
  • Michael Trott
    Mathematical Search Some thoughts from a Wolfram|Alpha perspective Michael Trott Wolfram|Alpha Slide 1 of 16 A simple/typical websearch in 2020? Slide 2 of 16 Who performs mathematical searches? Not only mathematicians, more and more engineers, biologists, …. Slide 3 of 16 The path/cycle of mathematical search: An engineer, biologist, economist, physicist, … needs to know mathematical results about a certain problem Step 1: find relevant literature citations (Google Scholar, Microsoft Academic Search, MathSciNet, Zentralblatt) fl Step 2: obtain copy of the book or paper (printed or electronic) fl Step 3: read, understand, apply/implement the actual result (identify typos, misprints, read references fl Step 1) The ideal mathematical search shortens each of these 3 steps. Assuming doing the work; no use of newsgroups, http://stackexchange.com, …. Ideal case: Mathematical search gives immediate theSlide answer,4 of 16 not just a pointer to a paper that might contain the answer; either by computation of by lookup Current status of computability: • fully computable (commutative algebra, quantifier elimination, univariate integration, …) • partially computable (nonlinear differential equations, proofs of theorem from above, …) • barely or not computable (Lebesgue measures, C* algebras, …), but can be semantically annotated How are the 100 million pages of mathematics distributed? J. Borwein: Recalibrate Watson to solve math problems Cost : $500 million Timeframe : Five years Last years: Watson, Wolfram|Alpha Slide 5 of 16 Slide 6 of 16 Slide 7 of 16 Ask your smartphone (right now only SIRI) for the gravitational potential of a cube Slide 8 of 16 And in the not too distant future play with orbits around a cube on your cellphone: find closed orbits of a particle in the gravitational potential of a cube initial position x0 1.3 y 0 0 z0 0 initial velocity v x,0 0 v y ,0 -0.29 v z,0 0 charge plot range solution time 39.8 Slide 9 of 16 Returned results are complete semantic representations of the mathematical fact And, within Mathematica, they are also fully computable.
    [Show full text]
  • Knowledge Representation in Bicategories of Relations
    Knowledge Representation in Bicategories of Relations Evan Patterson Department of Statistics, Stanford University Abstract We introduce the relational ontology log, or relational olog, a knowledge repre- sentation system based on the category of sets and relations. It is inspired by Spivak and Kent’s olog, a recent categorical framework for knowledge representation. Relational ologs interpolate between ologs and description logic, the dominant for- malism for knowledge representation today. In this paper, we investigate relational ologs both for their own sake and to gain insight into the relationship between the algebraic and logical approaches to knowledge representation. On a practical level, we show by example that relational ologs have a friendly and intuitive—yet fully precise—graphical syntax, derived from the string diagrams of monoidal categories. We explain several other useful features of relational ologs not possessed by most description logics, such as a type system and a rich, flexible notion of instance data. In a more theoretical vein, we draw on categorical logic to show how relational ologs can be translated to and from logical theories in a fragment of first-order logic. Although we make extensive use of categorical language, this paper is designed to be self-contained and has considerable expository content. The only prerequisites are knowledge of first-order logic and the rudiments of category theory. 1. Introduction The representation of human knowledge in computable form is among the oldest and most fundamental problems of artificial intelligence. Several recent trends are stimulating continued research in the field of knowledge representation (KR). The birth of the Semantic Web [BHL01] in the early 2000s has led to new technical standards and motivated new machine learning techniques to automatically extract knowledge from unstructured text [Nic+16].
    [Show full text]
  • Shaping Wikipedia Into a Computable Knowledge Base
    SHAPING WIKIPEDIA INTO A COMPUTABLE KNOWLEDGE BASE Michael K. Bergman1, Coralville, Iowa USA March 31, 2015 AI3:::Adaptive Information blog Wikipedia is arguably the most important information source yet invented for natural language processing (NLP) and artificial intelligence, in addition to its role as humanity’s largest encyclopedia. Wikipedia is the principal information source for such prominent services as IBM’s Watson [1], Freebase [2], the Google Knowledge Graph [3], Apple’s Siri [4], YAGO [5], and DBpedia [6], the core reference structure for linked open data [7]. Wikipedia information has assumed a prominent role in NLP applications in word sense disambiguation, named entity recognition, co-reference resolution, and multi-lingual alignments; in information retrieval in query expansion, multi-lingual retrieval, question answering, entity ranking, text categorization, and topic indexing; and in semantic applications in topic extraction, relation extraction, entity extraction, entity typing, semantic relatedness, and ontology building [8]. The massive size of Wikipedia — with more than 26 million articles across 250 different language versions [9,10] — makes it a rich resource for reference entities and concepts. Structural features of Wikipedia that help to inform the understanding of relationships and connections include articles (and their embedded entities and concepts), article abstracts, article titles, infoboxes, redirects, internal and external links, editing histories, categories (in part), discussion pages, disambiguation pages, images and associated metadata, templates, tables, and pages of lists, not to mention Wikipedia as a whole being used as a corpus or graph [11]. It is no wonder that Wikipedia is referenced in about 665,000 academic articles and books [12].
    [Show full text]
  • Ontology for Information Systems (O4IS) Design Methodology Conceptualizing, Designing and Representing Domain Ontologies
    Ontology for Information Systems (O4IS) Design Methodology Conceptualizing, Designing and Representing Domain Ontologies Vandana Kabilan October 2007. A Dissertation submitted to The Royal Institute of Technology in partial fullfillment of the requirements for the degree of Doctor of Technology . The Royal Institute of Technology School of Information and Communication Technology Department of Computer and Systems Sciences IV DSV Report Series No. 07–013 ISBN 978–91–7178–752–1 ISSN 1101–8526 ISRN SU–KTH/DSV/R– –07/13– –SE V All knowledge that the world has ever received comes from the mind; the infinite library of the universe is in our own mind. – Swami Vivekananda. (1863 – 1902) Indian spiritual philosopher. The whole of science is nothing more than a refinement of everyday thinking. – Albert Einstein (1879 – 1955) German-Swiss-U.S. scientist. Science is a mechanism, a way of trying to improve your knowledge of na- ture. It’s a system for testing your thoughts against the universe, and seeing whether they match. – Isaac Asimov. (1920 – 1992) Russian-U.S. science-fiction author. VII Dedicated to the three KAs of my life: Kabilan, Rithika and Kavin. IX Abstract. Globalization has opened new frontiers for business enterprises and human com- munication. There is an information explosion that necessitates huge amounts of informa- tion to be speedily processed and acted upon. Information Systems aim to facilitate human decision-making by retrieving context-sensitive information, making implicit knowledge ex- plicit and to reuse the knowledge that has already been discovered. A possible answer to meet these goals is the use of Ontology.
    [Show full text]