Regulatory information has a direct and significant effect on the safety, economics and quality of many industries' operations and end-products. However, standards documents are often voluminous and can be complex. Users of such standards need to invest considerable time and effort to become familiar with the structure and content of the documents. Therefore, it has long been recognized that computer handling of this information is a potentially useful application area. This paper provides an overview of the work that has been done to provide computer systems that will help both users and authors of regulations. The emphasis is on using advanced symbolic computing techniques that would help in accessing, interpreting and applying the information.

Potential-based reward shaping is a commonly used approach in reinforcement learning to direct exploration based on prior knowledge. Both in single and multi-agent settings this technique speeds up learning without losing any theoretical convergence guarantees. However, if speed ups through reward shaping are to be achieved in multi-agent environments, a different shaping signal should be used for each context in which agents have a different subgoal or when agents are involved in a different interaction situation.

This paper describes the use of context-aware potential functions in a multi-agent system in which the interactions between agents are sparse. This means that, unknown to the agents a priori, the interactions between the agents only occur sporadically in certain regions of the state space. During these interactions, agents need to coordinate in order to reach the global optimal solution.

We demonstrate how different reward shaping functions can be used on top of Future Coordinating Q-learning (FCQ-learning); an algorithm capable of automatically detecting when agents should take each other into consideration. Using FCQ-learning, coordination problems can even be anticipated before the actual problems occur, allowing the problems to be solved timely. We evaluate our approach on a range of gridworld problems, as well as a simulation of air traffic control.

Repeated games are an important mathematical formalism to model and study long-term economic interactions between multiple self-interested parties (individuals or groups of individuals). They open attractive perspectives in modeling long-term multiagent interactions. This overview paper discusses the most important results that actually exist for repeated games. These results arise from both economics and computer science. Contrary to a number of existing surveys of repeated games, most of which originated from the economic research community, we are first to pay a special attention to a number of important distinctive features proper to artificial agents. More precisely, artificial agents, as opposed to the human agents mainly aimed by the economic research, are usually bounded whether in terms of memory or performance. Therefore, their decisions have to be based on the strategies defined using finite representations. Furthermore, these strategies have to be efficiently computed or approximated using a limited computational resource usually available to artificial agents.

The software and hardware applications are clearly on the way of becoming an integral tool of business, communication and popular culture in many parts of the world. People are interacting with the environment via the Internet to perform physical activities remotely. These applications are hosted in the public or private servers under the control of the server admin. The users’ online usage data can be stored in public or private cloud platforms, used for processing and monitoring users’ online behaviour and emotional factors and shared with third parties to facilitate making their business decisions. When users allow their data to be collected via software applications and mobile devices, users need to have some level of trust and control over their data. But, software applications or mobile devices connected to the cloud server using client–server architecture does not ensure the reliability, security and integrity among their data. To get over these kinds of limitations, we propose a database management system using blockchain technology that can be used by any software applications. The blockchain database connected to the cloud server can be used to increase the trustfulness of the application. Blockchain has the capability to provide decentralization, immutability and owner-controlled digital assets among software applications. Since users can save their data in a shared transaction repository with tamper-resistant records, it enables related parties to access and control users’ data without the need for a central control system.

A logical spreadsheet is a spreadsheet in which the formula language is composed of logical expressions. Logical spreadsheets were invented shortly after traditional electronic spreadsheets were introduced, but since then logical spreadsheet research has been somewhat sparse. Recently, however, there has been a resurgence in the interest of logical spreadsheets in the research community. In this article, we summarize logical spreadsheet research up to this point.

In this article I present and discuss some criteria to provide a diagrammatic classification. Such a classification is of use for exploring in detail the domain of diagrammatic reasoning. Diagrams can be classified in terms of the use we make of them—static or dynamic—and of the correspondence between their space and the space of the data they are intended to represent. The investigation is not guided by the opposition visual vs. non-visual, but by the idea that there is a continuous interaction between diagrams and language. Diagrammatic reasoning is characterized by a duality, since it refers both to an object, the diagram, having its spatial characteristics, and to a subject, the user, who interprets them. A particular place in the classification is occupied by constructional diagrams, which exhibit for the user instructions for the application of some procedures.

Drawing upon the theories of complexity and complex adaptive systems and the Singerian inquiring system from C. West Churchman's seminal work The Design of Inquiring Systems, the study herein develops a systems design theory for continuous auditing systems. The discussion focuses on the two foundational theories, development of the theory of Complex Adaptive Inquiring Organizations (CAIO) and associated design principles for a continuous auditing system supporting a CAIO, and instantiation of the CAIO theory. The instantiation consists of an agent-based model depicting the marketplace for Frontier Airlines that generates an anticipated market share used as an integral component in a mock auditor going concern opinion for the airline. As a whole, the study addresses the lack of an underlying system design theory and comprehensive view needed to build upon and advance the continuous assurance movement and addresses the question of how continuous auditing systems should be designed to produce knowledge – knowledge that benefits auditors, clients, and society as a whole.

In this paper, we present two broad styles of KBS reasoner: those based primarily on some general, explicit model of the knowledge of the domain (whether that model be expressed by heuristic rules or by a deep model of structure and function), which we term domain model-based reasoners; and those based primarily on a set of examples of events in the domain, which we term example-based reasoners (EBR), of which case-based reasoners are a subset. The aim of this paper is to guide developers in considering the trade-offs between these different styles of reasoning. We believe that this cannot be done in general, but may be possible for specific domains. Thus, the paper provides an example analysis of the usefulness of these reasoning styles. We assess the suitability of these styles against a series of requirements which we have identified that KBSs must fulfil if they are to support help desk operations. We conclude that EBR systems are more likely to meet those requirements (the analysis draws on our earlier work in Bridge & Dearden, 1992).

Reasoning about actions and plans is a vital aspect of the rational behaviour of intelligent agents, and hence represents a major research domain in artificial intelligence. Much work has been undertaken to develop logic-based formalisms and problem solving procedures for plan representation and plan synthesis. This paper consists of a survey of various paradigms for reasoning about actions and plans in artificial intelligence. Attention is focused on the logic-based theoretical frameworks which have built a formal foundation for the domain-independent approaches to the general principles of reasoning about actions and plans.

Knowledge representation is a subarea of artificial intelligence concerned with using formal symbols to represent a set of facts within a knowledge domain. Two popular knowledge representation languages, namely Petri net and ontology, are promising knowledge sharing and reusing methods in knowledge engineering. The combination of Petri net and ontology can facilitate achieving complementary advantages. Currently, many efforts have been done on knowledge sharing between Petri nets and ontologies. To investigate these issues and more importantly serve as identifying the direction of knowledge sharing between Petri nets and ontologies, in this paper we give a comprehensive literature overview of knowledge sharing between Petri net models and ontology models to satisfy the obvious need. In detail, we discuss the knowledge sharing from two aspects: the different knowledge representation approaches of ontology to represent and reason Petri net and issues of constructing Petri net from ontology. In addition, other important issues on applications and directions for future research are discussed in detail.

This paper aims to describe the current state of knowledge systems technology and its commercialisation in the US. First, knowledge systems are defined and placed in a historical context. The introduction is concluded with a preview of major ideas. The paper will assess the technological state of the art and will survey the current state of commercialisation. Finally, some anticipated future trends will be discussed.

Recent proliferation of surveillance systems is mostly attributed to advances in both image-processing techniques and hardware enhancement of smart cameras, as well as the ubiquity of sensor-driven architectures. Owing to these capabilities, new aspects are coming to the forefront. This paper addresses the current state-of-the-art and provides researchers with an overview of existing surveillance solutions, analyzing their properties as a system and drawing attention to relevant challenges when developing, deploying and managing them. Also, some of the more prominent application domains are highlighted here. In an effort to understand the development of the advanced solutions, based on their most distinctive characteristics, we propose a taxonomy for surveillance systems to help classify them and reveal gaps in existing research. We conclude by identifying promising future research lines.

The World Wide Web has had a notable impact on a variety of epistemically relevant activities, many of which lie at the heart of the discipline of knowledge engineering. Systems like Wikipedia, for example, have altered our views regarding the acquisition of knowledge, while citizen science systems such as Galaxy Zoo have arguably transformed our approach to knowledge discovery. Other Web-based systems have highlighted the ways in which the human social environment can be used to support the development of intelligent systems, either by contributing to the provision of epistemic resources or by helping to shape the profile of machine learning. In the present paper, such systems are referred to as knowledge machines. In addition to providing an overview of the knowledge machine concept, the present paper reviews a number of issues that are associated with the scientific and philosophical study of knowledge machines. These include the potential impact of knowledge machines for the theory and practice of knowledge engineering, the role of social participation in the realization of knowledge-based processes, and the role of standardized, semantically enriched data formats in supporting the ad hoc assembly of special-purpose knowledge systems and knowledge processing pipelines.

Assuring the reliability of knowledge-based systems has become an important issue in the development of the knowledge engineering discipline. There has been a workshop devoted to these topics at most of the major AI conferences (IJCAI, AAAI and ECAI) for the last five years, and the 1994 European Conference on Artificial Intelligence (ECAI-94) in Amsterdam was no exception. The focus of the meeting was on validation techniques for KBS, where validation is defined as the process of determining if a KBS meets its users' requirements; implicitly, validation includes verification, which is the process of determining if a KBS has been constructed to comply with certain formally-specified properties, such as consistency and irredundancy. The Amsterdam workshop was an intimate meeting, and the fifteen attendees were predominantly from European institutions. In spite of—or perhaps because of—this intimacy, the workshop succeeded in highlighting many of the significant trends and issues within its area of concern. The purpose of this short article is to review the trends and issues in question, drawing upon the contributions made during the workshop.

A unifying framework for concept-learning, derived from Mitchell's Generalization as Search-paradigm, is presented. Central to the framework is the generic algorithm Gencol. Gencol forms a synthesis of existing concept-learning algorithms as it identifies the key issues in concept-learning: the representation of concepts and examples, the search strategy and heuristics, and the operators that transform one concept-description into another one when searching the concept description space. Gencol is relevant for practical purposes as it offers a solid basis for the design and implementation of concept-learning algorithms. The presented framework is quite general as seemingly disparate algorithms such as TDIDT, AQ, MIS and version spaces fit into Gencol.

This paper examines the claim that machine induction can alleviate the current knowledge engineering bottleneck in expert system construction. It presents a case study of the rule induction software tool known as Expert-Ease and proposes a set of criteria which might guide the selection of appropriate domains.

This paper surveys a variety of deductive database theories. Such theories differ from one another in the set of axioms and metarules that they allow and use. The following theories are discussed: relational, Horn, and stratified in the text; protected, disjunctive, typed, extended Horn, and normal in the appendix. Connections with programming in terms of the declarative, fixpoint, and procedural semantics are explained. Negation is treated in several different ways: closed world, completed database, and negation as failure. For each theory examples are given and implementation issues are considered.

The last ten years have seen a marked increase of interest in agent-oriented technology, in several areas of computer science, including both software engineering and artificial intelligence. Agents are being used, and touted, for applications as diverse as personalised information management, electronic commerce, interface design, computer games, and management of complex commercial and industrial processes. Several deployed systems already use agent technology, and many more commercial and industrial applications are in development.

The complexity of pervasive systems arises from the many different aspects that such systems possess. A typical pervasive system may be autonomous, distributed, concurrent and context based, and may involve humans and robotic devices working together. If we wish to formally verify the behaviour of such systems, the formal methods for pervasive systems will surely also be complex. In this paper, we move towards being able to formally verify pervasive systems and outline our approach wherein we distinguish four distinct dimensions within pervasive system behaviour and utilize different, but appropriate, formal techniques for verifying each one.