Graph-Based Reasoning in Collaborative Knowledge Management for Industrial Maintenance Bernard Kamsu-Foguem, Daniel Noyes
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Next Generation Logic Programming Systems Gopal Gupta
Next Generation Logic Programming Systems Gopal Gupta In the last 30 years logic programming (LP), with Prolog as the most representative logic programming language, has emerged as a powerful paradigm for intelligent reasoning and deductive problem solving. In the last 15 years several powerful and highly successful extensions of logic programming have been proposed and researched. These include constraint logic programming (CLP), tabled logic programming, inductive logic programming, concurrent/parallel logic programming, Andorra Prolog and adaptations for non- monotonic reasoning such as answer set programming. These extensions have led to very powerful applications in reasoning, for example, CLP has been used in industry for intelligently and efficiently solving large scale scheduling and resource allocation problems, tabled logic programming has been used for intelligently solving large verification problems as well as non- monotonic reasoning problems, inductive logic programming for new drug discoveries, and answer set programming for practical planning problems, etc. However, all these powerful extensions of logic programming have been developed by extending standard logic programming (Prolog) systems, and each one has been developed in isolation from others. While each extension has resulted in very powerful applications in reasoning, considerably more powerful applications will become possible if all these extensions were combined into a single system. This power will come about due to search space being dramatically pruned, reducing the time taken to find a solution given a reasoning problem coded as a logic program. Given the current state-of-the-art, even two extensions are not available together in a single system. Realizing multiple or all extensions in a single framework has been rendered difficult by the enormous complexity of implementing reasoning systems in general and logic programming systems in particular. -
Logic-Based Technologies for Intelligent Systems: State of the Art and Perspectives
information Article Logic-Based Technologies for Intelligent Systems: State of the Art and Perspectives Roberta Calegari 1,* , Giovanni Ciatto 2 , Enrico Denti 3 and Andrea Omicini 2 1 Alma AI—Alma Mater Research Institute for Human-Centered Artificial Intelligence, Alma Mater Studiorum–Università di Bologna, 40121 Bologna, Italy 2 Dipartimento di Informatica–Scienza e Ingegneria (DISI), Alma Mater Studiorum–Università di Bologna, 47522 Cesena, Italy; [email protected] (G.C.); [email protected] (A.O.) 3 Dipartimento di Informatica–Scienza e Ingegneria (DISI), Alma Mater Studiorum–Università di Bologna, 40136 Bologna, Italy; [email protected] * Correspondence: [email protected] Received: 25 February 2020; Accepted: 18 March 2020; Published: 22 March 2020 Abstract: Together with the disruptive development of modern sub-symbolic approaches to artificial intelligence (AI), symbolic approaches to classical AI are re-gaining momentum, as more and more researchers exploit their potential to make AI more comprehensible, explainable, and therefore trustworthy. Since logic-based approaches lay at the core of symbolic AI, summarizing their state of the art is of paramount importance now more than ever, in order to identify trends, benefits, key features, gaps, and limitations of the techniques proposed so far, as well as to identify promising research perspectives. Along this line, this paper provides an overview of logic-based approaches and technologies by sketching their evolution and pointing out their main application areas. Future perspectives for exploitation of logic-based technologies are discussed as well, in order to identify those research fields that deserve more attention, considering the areas that already exploit logic-based approaches as well as those that are more likely to adopt logic-based approaches in the future. -
Compiling a Default Reasoning System Into Prolog
Compiling A Default Reasoning System into Prolog David Poole Department of Computer Science University of British Columbia Vancouver BC Canada VT W p o olecsub cca July Abstract Articial intelligence researchers have b een designing representa tion systems for default and ab ductive reasoning Logic Programming researchers have b een working on techniques to improve the eciency of Horn Clause deduction systems This pap er describ es how one such default and ab ductive reasoning system namely Theorist can b e translated into Horn clauses with negation as failure so that we can use the clarity of ab ductive reasoning systems and the eciency of Horn clause deduction systems Wethus showhowadvances in expressivepower that articial intelligence workers are working on can directly utilise advances in eciency that logic programming re searchers are working on Actual co de from a running system is given Intro duction Many p eople in Articial Intelligence have b een working on default reasoning and ab ductive diagnosis systems The systems implemented so far eg are only prototyp es or have b een develop ed in A Theorist to Prolog Compiler ways that cannot take full advantage in the advances of logic programming implementation technology Many p eople are working on making logic programming systems more ecient These systems however usually assume that the input is in the form of Horn clauses with negation as failure This pap er shows howto implement the default reasoning system Theorist by compiling its input into Horn clauses -
Exploring the Components of Dynamic Modeling Techniques
Old Dominion University ODU Digital Commons Computational Modeling & Simulation Computational Modeling & Simulation Engineering Theses & Dissertations Engineering Spring 2012 Exploring the Components of Dynamic Modeling Techniques Charles Daniel Turnitsa Old Dominion University Follow this and additional works at: https://digitalcommons.odu.edu/msve_etds Part of the Computer Engineering Commons, and the Computer Sciences Commons Recommended Citation Turnitsa, Charles D.. "Exploring the Components of Dynamic Modeling Techniques" (2012). Doctor of Philosophy (PhD), Dissertation, Computational Modeling & Simulation Engineering, Old Dominion University, DOI: 10.25777/99hf-vx67 https://digitalcommons.odu.edu/msve_etds/38 This Dissertation is brought to you for free and open access by the Computational Modeling & Simulation Engineering at ODU Digital Commons. It has been accepted for inclusion in Computational Modeling & Simulation Engineering Theses & Dissertations by an authorized administrator of ODU Digital Commons. For more information, please contact [email protected]. EXPLORING THE COMPONENTS OF DYNAMIC MODELING TECHNIQUES by Charles Daniel Turnitsa B.S. December 1991, Christopher Newport University M.S. May 2006, Old Dominion University A Dissertation Submitted to the Faculty of Old Dominion University in Partial Fulfillment of the Requirement for the Degree of DOCTOR OF PHILOSOPHY MODELING AND SIMULATION OLD DOMINION UNIVERSITY May 2012 Approved b, Andreas Tolk (Director) Frederic D. MctCefizie (Member) Patrick T. Hester (Member) Robert H. Kewley, Jr. (Member) / UMI Number: 3511005 All rights reserved INFORMATION TO ALL USERS The quality of this reproduction is dependent on the quality of the copy submitted. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if material had to be removed, a note will indicate the deletion. -
Downloaded at the Address: Predicates in the Ontology
Ontology-Supported and Ontology-Driven Conceptual Navigation on the World Wide Web Michel Crampes and Sylvie Ranwez Laboratoire de Génie Informatique et d’Ingénierie de Production (LGI2P) EERIE-EMA, Parc Scientifique Georges Besse 30 000 NIMES (FRANCE) Tel: (33) 4 66 38 7000 E-mail: {Michel.Crampes, Sylvie Ranwez}@site-eerie.ema.fr ABSTRACT It is accepted that there is no ideal solution to a complex This paper presents the principles of ontology-supported problem and a coherent paradigm may present limits and ontology-driven conceptual navigation. Conceptual when considering the complexity and the variety of the navigation realizes the independence between resources users' needs. Let’s recall some of the traditional criticisms and links to facilitate interoperability and reusability. An about hypertext. The readers get lost in hyperspace. The engine builds dynamic links, assembles resources under links are predefined by the authors and the author's an argumentative scheme and allows optimization with a intention does not necessary match the readers' intentions. possible constraint, such as the user’s available time. There may be other interesting links to other resources Among several strategies, two are discussed in detail with that are not given. The narrative construction which is the examples of applications. On the one hand, conceptual result of link following may present argumentative specifications for linking and assembling are embedded in pitfalls. the resource meta-description with the support of the ontology of the domain to facilitate meta-communication. As regards the IR paradigm, there are other criticisms. Resources are like agents looking for conceptual The search engines leave the readers with a list of acquaintances with intention. -
Argumentation Graphs with Constraint-Based Reasoning for Collaborative Expertise
Open Archive Toulouse Archive Ouverte OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible This is an author’s version published in: http://oatao.univ-toulouse.fr/21334 To cite this version: Doumbouya, Mamadou Bilo and Kamsu-Foguem, Bernard and Kenfack, Hugues and Foguem, Clovis Argumentation graphs with constraint-based reasoning for collaborative expertise. (2018) Future Generation Computer Systems, 81. 16-29. ISSN 0167-739X Any correspondence concerning this service should be sent to the repository administrator: [email protected] Argumentation graphs with constraint-based reasoning for collaborative expertise Mamadou Bilo Doumbouya a,b , Bernard Kamsu-Foguem a,*, Hugues Kenfack b, Clovis Foguem c,d a Université de Toulouse, Laboratoire de Génie de Production (LGP), EA 1905, ENIT-INPT, 47 Avenue d'Azereix, BP 1629, 65016, Tarbes Cedex, France b Université de Toulouse, Faculté de droit, 2 rue du Doyen Gabriel Marty, 31042 Toulouse cedex 9, France c Université de Bourgogne, Centre des Sciences du Goût et de l'Alimentation (CSGA), UMR 6265 CNRS, UMR 1324 INRA, 9 E Boulevard Jeanne d'Arc, 21000 Dijon, France d Auban Moët Hospital, 137 rue de l’hôpital, 51200 Epernay, France h i g h l i g h t s • Reasoning underlying the remote collaborative processes in complex decision making. • Abstract argumentation framework with the directed graphs to represent propositions • Conceptual graphs for ontological knowledge modelling and formal visual reasoning. • Competencies and information sources for the weighting of shared advices/opinions. • Constraints checking for conflicts detection according to medical–legal obligations. -
Mathematical Reasoning with Diagrams Mateja Jamnik
Mathematical Reasoning with Diagrams Mateja Jamnik ISBN: 1-57586-324-3 Copyright notice: Excerpted from Mathematical Reasoning with Diagrams by Mateja Jamnik, published by CSLI Publications. ©2001 by CSLI Publications. All rights reserved. This text may be used and shared in accordance with the fair-use provisions of U.S. copyright law, and it may be archived and redistributed in electronic form, provided that this entire notice, including copyright information, is carried and provided that CSLI Publications is notified and no fee is charged for access. Archiving, redistribution, or republication of this text on other terms, in any medium, requires the consent of CSLI Publications. Contents Foreword vii Preface xi 1 Introduction 1 2 The History of Diagrammatic Systems 11 3 Diagrammatic Theorems and the Problem Domain 27 4 The Constructive ω-Rule and Schematic Proofs 49 5 Designing a Diagrammatic Reasoning System 71 6 Diagrammatic Operations 89 7 The Construction of Schematic Proofs 103 8 The Verification of Schematic Proofs 123 9 Diamond in Action 149 10 Complete Automation 163 Appendix A: More Examples of Diagrammatic Theorems 175 Appendix B: The ω-Rule 181 Glossary 185 References 190 Index 199 v Foreword The advent of the modern computer in the nineteen-fifties immediately suggested a new research challenge: to seek ways of programming these versatile machines which would make them behave as much like intel- ligent human beings as possible. After fifty years or so, this quest has produced some intriguing results, but until now progress has been dis- appointingly slow. This book is a welcome and encouraging sign that things may at last be about to change. -
Visualization for Constructing and Sharing Geo-Scientific Concepts
Colloquium Visualization for constructing and sharing geo-scientific concepts Alan M. MacEachren*, Mark Gahegan, and William Pike GeoVISTA Center, Department of Geography, Pennsylvania State University, 302 Walker, University Park, PA 16802 Representations of scientific knowledge must reflect the dynamic their instantiation in data. These visual representations can nature of knowledge construction and the evolving networks of provide insight into the similarities and differences among relations between scientific concepts. In this article, we describe scientific concepts held by a community of researchers. More- initial work toward dynamic, visual methods and tools that sup- over, visualization can serve as a vehicle through which groups port the construction, communication, revision, and application of of researchers share and refine concepts and even negotiate scientific knowledge. Specifically, we focus on tools to capture and common conceptualizations. Our approach integrates geovisu- explore the concepts that underlie collaborative science activities, alization for data exploration and hypothesis generation, col- with examples drawn from the domain of human–environment laborative tools that facilitate structured discourse among re- interaction. These tools help individual researchers describe the searchers, and electronic notebooks that store records of process of knowledge construction while enabling teams of col- individual and group investigation. By detecting and displaying laborators to synthesize common concepts. Our visualization ap- similarity and structure in the data, methods, perspectives, and proach links geographic visualization techniques with concept- analysis procedures used by scientists, we are able to synthesize mapping tools and allows the knowledge structures that result to visual depictions of the core concepts involved in a domain at be shared through a Web portal that helps scientists work collec- several levels of abstraction. -
Ontology and Information Systems
Ontology and Information Systems 1 Barry Smith Philosophical Ontology Ontology as a branch of philosophy is the science of what is, of the kinds and structures of objects, properties, events, processes and relations in every area of reality. ‘Ontology’ is often used by philosophers as a synonym for ‘metaphysics’ (literally: ‘what comes after the Physics’), a term which was used by early students of Aristotle to refer to what Aristotle himself called ‘first philosophy’.2 The term ‘ontology’ (or ontologia) was itself coined in 1613, independently, by two philosophers, Rudolf Göckel (Goclenius), in his Lexicon philosophicum and Jacob Lorhard (Lorhardus), in his Theatrum philosophicum. The first occurrence in English recorded by the OED appears in Bailey’s dictionary of 1721, which defines ontology as ‘an Account of being in the Abstract’. Methods and Goals of Philosophical Ontology The methods of philosophical ontology are the methods of philosophy in general. They include the development of theories of wider or narrower scope and the testing and refinement of such theories by measuring them up, either against difficult 1 This paper is based upon work supported by the National Science Foundation under Grant No. BCS-9975557 (“Ontology and Geographic Categories”) and by the Alexander von Humboldt Foundation under the auspices of its Wolfgang Paul Program. Thanks go to Thomas Bittner, Olivier Bodenreider, Anita Burgun, Charles Dement, Andrew Frank, Angelika Franzke, Wolfgang Grassl, Pierre Grenon, Nicola Guarino, Patrick Hayes, Kathleen Hornsby, Ingvar Johansson, Fritz Lehmann, Chris Menzel, Kevin Mulligan, Chris Partridge, David W. Smith, William Rapaport, Daniel von Wachter, Chris Welty and Graham White for helpful comments. -
The Logic Reasoning System a Brief Introduction Franz Wotawa
The Logic Reasoning System A Brief Introduction Franz Wotawa Technische Universität Graz Institute for Software Technology Inffeldgasse 16b/2, 8010 Graz, Austria [email protected] http://www.ist.tugraz.at/ The Logic Reasoning System – A brief introduction Franz Wotawa1 Graz University of Technology Institute for Software Technology Inffeldgasse 16b/2, A-8010 Graz, Austria [email protected] Abstract. In this article we describe how to use the Logic Reason- ing System that is based on an Assumption-Based Truth Maintenance system. In particular we show by example how models following the consistency-based reasoning and the abductive reasoning methodology can be formulated. We use one example from the boolean circuit domain and give the two different models for the circuit, which can be used for diagnosis. Moreover, we show how the system can be used to compute diagnoses using consistency-based diagnosis and abductive diagnosis re- spectively. Keywords: Logic-based reasoning systems, ATMS, Diagnosis 1 Introduction The Logic Reasoning System (LRS) can be obtained from the author of this article. The system is implemented in Java 1.5 and ships out as an executable JAR file. To install the system the JAR file and the example models should be copied to a directory on your computer. You can open LRS by simple executing the JAR file if the Java runtime engine 1.5 or higher is installed. The system comes with no warranty. Before discussing modeling we briefly recall the related literature behind LRS. The implementation is based on DeKleer’s Assumption-based Truth Main- tenance System (ATMS) [1, 2]. -
A Classification Approach for Automated Reasoning Systems--A Case Study in Graph Theory Rong Lin Old Dominion University
Old Dominion University ODU Digital Commons Computer Science Theses & Dissertations Computer Science Spring 1989 A Classification Approach for Automated Reasoning Systems--A Case Study in Graph Theory Rong Lin Old Dominion University Follow this and additional works at: https://digitalcommons.odu.edu/computerscience_etds Part of the Artificial Intelligence and Robotics Commons Recommended Citation Lin, Rong. "A Classification Approach for Automated Reasoning Systems--A Case Study in Graph Theory" (1989). Doctor of Philosophy (PhD), dissertation, Computer Science, Old Dominion University, DOI: 10.25777/5qk4-1w09 https://digitalcommons.odu.edu/computerscience_etds/115 This Dissertation is brought to you for free and open access by the Computer Science at ODU Digital Commons. It has been accepted for inclusion in Computer Science Theses & Dissertations by an authorized administrator of ODU Digital Commons. For more information, please contact [email protected]. A CLASSIFICATION APPROACH FOR AUTOMATED REASONING SYSTEMS - A CASE STUDY IN GRAPH THEORY By Rong Lin A THESIS SUBMITTED TO THE FACULTY OF OLD DOMINION UNIVERSITY N PARTIAL FULFILLMENT OF TIIE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY COMPUTER SCIENCE Norfolk, Virginia April, 1989 Approved by: Shunichi Toida (Director) Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. ABSTRACT Reasoning systems which create classifications of structured objects face the problem of how object descriptions can be used to reflect their components as well as relations among these com ponents. Current reasoning sysLcms on grapli theory do not adequately provide models to discover complex relations among mathematical concepts (eg: relations involving subgraphs) mainly due to the inability to solve this problem. -
The Fragmentation of Reasoning
PUBLISHED IN: Pablo Quintanilla, Carla Mantilla, Paola Cépeda (eds.), Cognición social y lenguaje. La intersubjetividad en la evolución de la especie y en el desarrollo del niño, Lima: Pontificia Universidad Católica del Perú, 2014. ISBN: 978-612-4146-80-0 THE FRAGMENTATION OF REASONING Peter Carruthers University of Maryland 1. INTRODUCTION Scientists who study human reasoning across a range of cognitive domains have increasingly converged on the idea that there are two distinct systems (or types of system) involved. These domains include learning (Berry & Dienes, 1993; Reber, 1993), conditional and probabilistic reasoning (Evans & Over, 1996; Sloman, 1996 and 2002; Stanovich, 1999), decision making (Kahneman & Frederick, 2002; Kahneman, 2003), and social cognition of various sorts (Petty & Cacioppo, 1986; Chaike, and others, 1989; Wilson, and others, 2000). Although terminology has differed, many now use the labels «System 1» and «System 2» to mark the intended distinction. System 1 is supposed to be fast and unconscious in its operations, issuing in intuitively compelling answers to learning or reasoning problems in ways that subjects themselves have no access to. System 2, in contrast, is supposed to be slow and conscious in its operations, and is engaged whenever we are induced to tackle reasoning tasks in a reflective manner. Many theorists now accept that System 1 is really a set of systems, arranged in parallel, while believing that System 2 is a single serially-operating ability. Moreover, System 1 is generally thought to be unchangeable in its basic operations, to be universal amongst humans, and to be shared (at least in significant part) with other species of animal.