Recent advances in the theory and practice of logical analysis of data

Logical Analysis of Data (LAD) is a data analysis methodology introduced by Peter L. Hammer in 1986. LAD distinguishes itself from other classification and machine learning methods by the fact that it analyzes a significant subset of combinations of variables to describe the positive or negative nature of an observation and uses combinatorial techniques to extract models defined in terms of patterns. In recent years, the methodology has tremendously advanced through numerous theoretical developments and practical applications. In the present paper, we review the methodology and its recent advances, describe novel applications in engineering, finance, health care, and algorithmic techniques for some stochastic optimization problems, and provide a comparative description of LAD with well-known classification methods

Introduction

There has been little overt discussion of the experimental philosophy of logic or mathematics. So it may be tempting to assume that application of the methods of experimental philosophy to these areas is impractical or unavailing. This assumption is undercut by three trends in recent research: a renewed interest in historical antecedents of experimental philosophy in philosophical logic; a “practice turn” in the philosophies of mathematics and logic; and philosophical interest in a substantial body of work in adjacent disciplines, such as the psychology of reasoning and mathematics education. This introduction offers a snapshot of each trend and addresses how they intersect with some of the standard criticisms of experimental philosophy. It also briefly summarizes the specific contribution of the other chapters of this book

Developments in linear and integer programming

In this review we describe recent developments in linear and integer (linear) programming. For over 50 years Operational Research practitioners have made use of linear optimisation models to aid decision making and over this period the size of problems that can be solved has increased dramatically, the time required to solve problems has decreased substantially and the flexibility of modelling and solving systems has increased steadily. Large models are no longer confined to large computers, and the flexibility of optimisation systems embedded in other decision support tools has made on-line decision making using linear programming a reality (and using integer programming a possibility). The review focuses on recent developments in algorithms, software and applications and investigates some connections between linear optimisation and other technologies

Applying Formal Methods to Networking: Theory, Techniques and Applications

Despite its great importance, modern network infrastructure is remarkable for the lack of rigor in its engineering. The Internet which began as a research experiment was never designed to handle the users and applications it hosts today. The lack of formalization of the Internet architecture meant limited abstractions and modularity, especially for the control and management planes, thus requiring for every new need a new protocol built from scratch. This led to an unwieldy ossified Internet architecture resistant to any attempts at formal verification, and an Internet culture where expediency and pragmatism are favored over formal correctness. Fortunately, recent work in the space of clean slate Internet design---especially, the software defined networking (SDN) paradigm---offers the Internet community another chance to develop the right kind of architecture and abstractions. This has also led to a great resurgence in interest of applying formal methods to specification, verification, and synthesis of networking protocols and applications. In this paper, we present a self-contained tutorial of the formidable amount of work that has been done in formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial

Recent advances in karst research: from theory to fieldwork and applications

Karst landscapes and karst aquifers, which are composed of a variety of soluble rocks such as salt, gypsum, anhydrite, limestone, dolomite and quartzite, are fascinating areas of study. As karst rocks are abundant on the Earth's surface, the fast evolution of karst landscapes and the rapid flow of water through karst aquifers present challenges from a number of different perspectives. This collection of 25 papers deals with different aspects of these challenges, including karst geology, geomorphology and speleogenesis, karst hydrogeology, karst modelling, and karst hazards and management. Together these papers provide a state-of-the-art review of the current challenges and solutions in describing karst from a scientific perspective

Theorising and practitioners in HRD: the role of abductive reasoning

Purpose – The purpose of this paper is to argue that abductive reasoning is a typical but usually unrecognised process used by HRD scholars and practitioners alike. Design/methodology/approach – This is a conceptual paper that explores recent criticism of traditional views of theory-building, based on the privileging of scientific theorising, which has led to a relevance gap between scholars and practitioners. The work of Charles Sanders Peirce and the varieties of an abductive reasoning process are considered. Findings – Abductive reasoning, which precedes induction and deduction, provide a potential connection with HRD practitioners who face difficult problems. Two types of abductive reasoning are explored – existential and analogic. Both offer possibilities for theorising with HRD practitioners. A range of methods for allowing abduction to become more evident with practitioners are presented. The authors consider how abduction can be used in engaged and participative research strategies. Research limitations/implications – While this is a conceptual paper, it does suggest implications for engagement and participation in theorising with HRD practitioners. Practical implications – Abductive reasoning adds to the repertoire of HRD scholars and practitioners. Originality/value – The paper elucidates the value of abductive reasoning and points to how it can become an integral element of theory building in HRD

Dimensions of Neural-symbolic Integration - A Structured Survey

Research on integrated neural-symbolic systems has made significant progress in the recent past. In particular the understanding of ways to deal with symbolic knowledge within connectionist systems (also called artificial neural networks) has reached a critical mass which enables the community to strive for applicable implementations and use cases. Recent work has covered a great variety of logics used in artificial intelligence and provides a multitude of techniques for dealing with them within the context of artificial neural networks. We present a comprehensive survey of the field of neural-symbolic integration, including a new classification of system according to their architectures and abilities.Comment: 28 page

Robust Computer Algebra, Theorem Proving, and Oracle AI

In the context of superintelligent AI systems, the term "oracle" has two meanings. One refers to modular systems queried for domain-specific tasks. Another usage, referring to a class of systems which may be useful for addressing the value alignment and AI control problems, is a superintelligent AI system that only answers questions. The aim of this manuscript is to survey contemporary research problems related to oracles which align with long-term research goals of AI safety. We examine existing question answering systems and argue that their high degree of architectural heterogeneity makes them poor candidates for rigorous analysis as oracles. On the other hand, we identify computer algebra systems (CASs) as being primitive examples of domain-specific oracles for mathematics and argue that efforts to integrate computer algebra systems with theorem provers, systems which have largely been developed independent of one another, provide a concrete set of problems related to the notion of provable safety that has emerged in the AI safety community. We review approaches to interfacing CASs with theorem provers, describe well-defined architectural deficiencies that have been identified with CASs, and suggest possible lines of research and practical software projects for scientists interested in AI safety.Comment: 15 pages, 3 figure