Abstract intelligence: Embodying and enabling cognitive systems by mathematical engineering

Basic studies in denotational mathematics and mathematical engineering have led to the theory of abstract intelligence (aI), which is a set of mathematical models of natural and computational intelligence in cognitive informatics (CI) and cognitive computing (CC). Abstract intelligence triggers the recent breakthroughs in cognitive systems such as cognitive computers, cognitive robots, cognitive neural networks, and cognitive learning. This paper reports a set of position statements presented in the plenary panel (Part II) of IEEE ICCI*CC’16 on Cognitive Informatics and Cognitive Computing at Stanford University. The summary is contributed by invited panelists who are part of the world’s renowned scholars in the transdisciplinary field of CI and CC

Explaining Cognitive Computing Through the Information Systems Lens

Cognitive computing (COC) aims to embed human cognition into computerized models. However, there is no scientific classification that delineates the nature of Cognitive Computing. Unlike the medical and computer science fields, Information Systems (IS) has conducted very little research on COC. Although the potential to make important research contributions in this area is great, we argue that the lack of a cohesive interpretation of what constitutes COC has led to inferior COC research in IS. Therefore, we need first to clearly identify COC as a phenomenon to be able to identify and guide prospective research areas in IS. In this research, a phenomenological approach is adopted using thematic analysis to the published literature in COC research. Then, we discuss how IS may contribute to the development of design science artifacts under the COC umbrella. In addition, the paper raises important questions for future research by highlighting how IS researchers could make meaningful contributions to this emerging topic

The dawning of computational psychoanalysis. A proposal for some first elementary formalization attempts

In this paper, we wish first to highlight, within the general cultural context, some possible elementary computational psychoanalysis formalizations concerning Matte Blanco’s bi-logic components through certain very elementary mathematical tools and notions drawn from theoretical physics and algebra. Afterwards, on the basis of recent work of Giampaolo Sasso (1999; 2005; 2011), relying on the crucial crossroad between neurosciences and psychoanalysis, it will be possible to identify some hints for further formalization attempts turned toward a computational psychoanalysis outlook. Lastly, possible interesting relationships with cognitive informatics are also outlined

Cognitive Informatics

Cognitive Informatics (CI) is a contemporary field of basic studies on the brain, computational intelligence theories and underpinning denotational mathematics. Its applications include cognitive systems, cognitive computing, cognitive machine learning and cognitive robotics. IEEE ICCI*CC'17 on Cognitive Informatics and Cognitive Computing was focused on the theme of neurocomputation, cognitive machine learning and brain-inspired systems. This paper reports the plenary panel (Part I) at IEEE ICCI*CC'17 held at Oxford University. The summary is contributed by invited keynote speakers and distinguished panelists who are part of the world's renowned scholars in the transdisciplinary field of CI and cognitive computing

Logic Programs and Connectionist Networks

Graphs of the single-step operator for first-order logic programs—displayed in the real plane—exhibit self-similar structures known from topological dynamics, i.e., they appear to be fractals, or more precisely, attractors of iterated function systems. We show that this observation can be made mathematically precise. In particular, we give conditions which ensure that those graphs coincide with attractors of suitably chosen iterated function systems, and conditions which allow the approximation of such graphs by iterated function systems or by fractal interpolation. Since iterated function systems can easily be encoded using recurrent radial basis function networks, we eventually obtain connectionist systems which approximate logic programs in the presence of function symbols

次世代コンピュータシステムのための人間中心コンピューティング

博士(工学)法政大学 (Hosei University