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

Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis

Using the method of correspondence analysis, Tamminga obtains sound and complete natural deduction systems for all the unary and binary truth-functional extensions of Kleene’s strong three-valued logic K3 . In this paper, we extend Tamminga’s result by presenting an original finite, sound and complete proof-searching technique for all the truth-functional binary extensions of K3

Research questions and approaches for computational thinking curricula design

Teaching computational thinking (CT) is argued to be necessary but also admitted to be a very challenging task. The reasons for this, are: i) no general agreement on what computational thinking is; ii) no clear idea nor evidential support on how to teach CT in an effective way. Hence, there is a need to develop a common approach and a shared understanding of the scope of computational thinking and of effective means of teaching CT. Thus, the consequent ambition is to utilize the preliminary and further research outcomes on CT for the education of the prospective teachers of secondary, further and higher/adult education curricula

Paracomplete logic Kl: natural deduction, its automation, complexity and applications

In the development of many modern software solutions where the underlying systems are complex, dynamic and heterogeneous, the significance of specification-based verification is well accepted. However, often parts of the specification may not be known. Yet reasoning based on such incomplete specifications is very desirable. Here, paracomplete logics seem to be an appropriate formal setup: opposite to Tarski’s theory of truth with its principle of bivalence, in these logics a statement and its negation may be both untrue. An immediate result is that the law of excluded middle becomes invalid. In this paper we show a way to apply an automatic proof searching procedure for the paracomplete logic Kl to reason about incomplete information systems. We provide an original account of complexity of natural deduction systems, leading us closer to the efficiency of the presented proof search algorithm. Moreover, we have turned the assumptions management into an advantage showing the applicability of the proposed technique to assume-guarantee reasoning

The Universe as an Argument: Argumentative function—a Peircean orientation

One of the basic metatheoretical premises of pragma-dialectics is that “Argumentation has the general function of managing the resolution of disagreement.” (p.277) From a Peircean perspective this is at best a partial truth. While it may be correct that in concrete, finite contexts, argumentation may function to manage the resolution of disagreement, in the long run argumentation will tend towards the Truth (in a Peircean pragmatic sense). Using Peirce as my compass, I will take argumentation to refer to the resolution function of thought contingently situated and finitely understood (aimed at the settlement of belief). I will take argument to mean any structure or process which can serve as a real, compelling constraint upon thought in general. I will show that while the particular function of argumentation may be managing the resolution of disagreement, when situated within a Peircean-styled realism (where the universe has the form of an argument), argumentation will tend in the long run toward the Truth (as the end of argumentation in general). I will end by showing that while argumentation may have a resolution function, its real measure and normative standard is growth (epistemic, moral, political and otherwise) rather than resolution per se

Do Chatbots Dream of Androids? Prospects for the Technological Development of Artificial Intelligence and Robotics

The article discusses the main trends in the development of artificial intelligence systems and robotics (AI&R). The main question that is considered in this context is whether artificial systems are going to become more and more anthropomorphic, both intellectually and physically. In the current article, the author analyzes the current state and prospects of technological development of artificial intelligence and robotics, and also determines the main aspects of the impact of these technologies on society and economy, indicating the geopolitical strategic nature of this influence. The author considers various approaches to the definition of artificial intelligence and robotics, focusing on the subject-oriented and functional ones. It also compares AI&R abilities and human abilities in areas such as categorization, pattern recognition, planning and decision making, etc. Based on this comparison, we investigate in which areas AI&R’s performance is inferior to a human, and in which cases it is superior to one. The modern achievements in the field of robotics and artificial intelligence create the necessary basis for further discussion of the applicability of goal setting in engineering, in the form of a Turing test. It is shown that development of AI&R is associated with certain contradictions that impede the application of Turing’s methodology in its usual format. The basic contradictions in the development of AI&R technologies imply that there is to be a transition to a post-Turing methodology for assessing engineering implementations of artificial intelligence and robotics. In such implementations, on the one hand, the ‘Turing wall’ is removed, and on the other hand, artificial intelligence gets its physical implementation

Legal knowledge-based systems: new directions in system design

This thesis examines and critiques the concept of 'legal knowledge-based’ systems. Work on legal knowledge-based systems is dominated by work in 'artificial intelligence and law’. It seeks to automate the application of law and to automate the solution of legal problems. Automation however, has proved elusive. In contrast to such automation, this thesis proposes the creation of legal knowledge-based systems based on the concept of augmentation of legal work. Focusing on systems that augment legal work opens new possibilities for system creation and use. To inform how systems might augment legal work, this thesis examines philosophy, psychology and legal theory for information they provide on how processes of legal reasoning operate. It is argued that, in contrast to conceptions of law adopted in artificial intelligence and law, 'sensemaking' provides a useful perspective with which to create systems. It is argued that visualisation, and particularly diagrams, are an important and under considered element of reasoning and that producing systems that support diagramming of processes of legal reasoning would provide useful support for legal work. This thesis reviews techniques for diagramming aspects of sensemaking. In particular this thesis examines standard methods for diagramming arguments and methods for diagramming reasoning. These techniques are applied in the diagramming of legal judgments. A review is conducted of systems that have been constructed to support the construction of diagrams of argument and reasoning. Drawing upon these examinations, this thesis highlights the necessity of appropriate representations for supporting reasoning. The literature examining diagramming for reasoning support provides little discussion of appropriate representations. This thesis examines theories of representation for insight they can provide into the design of appropriate representations. It is concluded that while the theories of representation that are examined do not determine what amounts to a good representation, guidelines for the design and choice of representations can be distilled. These guidelines cannot map the class of legal knowledge-based systems that augment legal sensemaking, they can however, be used to explore this class and to inform construction of systems

The 1982 ASEE-NASA Faculty Fellowship program (Aeronautics and Research)

The NASA/ASEE Summer Faculty Fellowship Program (Aeronautics and Research) conducted at the NASA Goddard Space Flight Center during the summer of 1982 is described. Abstracts of the Final Reports submitted by the Fellows detailing the results of their research are also presented