An overview of the application of evolutionary computation to fuzzy knowledge discovery is presented. This is set in one of two contexts: overcoming the knowledge acquisition bottleneck in the development of intelligent reasoning systems, and in the data mining of databases where the aim is the discovery of new knowledge. The different strategies utilizing evolutionary algorithms for knowledge acquisition are abstracted from the work reviewed. The simplest strategy runs an evolutionary algorithm once, while the iterative rule learning approach runs several evolutionary algorithms in succession, with the output from each considered a partial solution. Ensembles are formed by combining several classifiers generated by evolutionary techniques, while co-evolution is often used for evolving rule bases and associated membership functions simultaneously. The associated strengths and limitations of these induction strategies are compared and discussed. Ways in which evolutionary techniques have been adapted to satisfy the common evaluation criteria of the induced knowledge—classification accuracy, comprehensibility and novelty value—are also considered. The review concludes by highlighting common limitations of the experimental methodology used and indicating ways of resolving them.

The rapid development of the field of agent-based systems offers a new and exciting paradigm for the development of sophisticated programs in dynamic and open environments, particularly in distributed domains such as web-based systems of various kinds, and electronic commerce. However, the speed of progress has been such that it has also brought with it a new set of problems. This paper reviews the current state of research into agent-based systems, considering reasons for the way the field has grown, and pointing at the way it might continue to progress. It pays particular attention to problems with defining the nature of agents, the technologies that have enabled the rapid progress to date, and ways in which work can be consolidated through the development of large-scale applications, and the integration with theoretical foundations.

In multi-objective multi-agent systems (MOMASs), agents explicitly consider the possible trade-offs between conflicting objective functions. We argue that compromises between competing objectives in MOMAS should be analyzed on the basis of the utility that these compromises have for the users of a system, where an agent’s utility function maps their payoff vectors to scalar utility values. This utility-based approach naturally leads to two different optimization criteria for agents in a MOMAS: expected scalarized returns (ESRs) and scalarized expected returns (SERs). In this article, we explore the differences between these two criteria using the framework of multi-objective normal-form games (MONFGs). We demonstrate that the choice of optimization criterion (ESR or SER) can radically alter the set of equilibria in a MONFG when nonlinear utility functions are used.

The recent effort to integrate techniques from the fields of artificial intelligence and operations research has been motivated in part by the fact that scientists in each group are often unacquainted with recent (and not so recent) progress in the other field. Our goal in this paper is to introduce the artificial intelligence community to pseudo-Boolean representation and cutting plane proofs, and to introduce the operations research community to restricted learning methods such as relevance-bounded learning. Complete methods for solving satisfiability problems are necessarily bounded from below by the length of the shortest proof of unsatisfiability; the fact that cutting plane proofs of unsatisfiability can be exponentially shorter than the shortest resolution proof can thus in theory lead to substantial improvements in the performance of complete satisfiability engines. Relevance-bounded learning is a method for bounding the size of a learned constraint set. It is currently the best artificial intelligence strategy for deciding which learned constraints to retain and which to discard. We believe these two elements or some analogous form of them are necessary ingredients to improving the performance of satisfiability algorithms generally. We also present a new cutting plane proof of the pigeonhole principle that is of size n2, and show how to implement some intelligent backtracking techniques using pseudo-Boolean representation.

As a community work, scientific contributions are usually built incrementally, involving some transformation, expansion or refutation of existing conceptual and propositional networks. As the body of knowledge increases, scientists concentrate more effort on ensuring that new hypotheses and observations are needed and consistent with previous findings. In this paper, we will characterize Knowledge Engineering as an important groundwork for structuring scientific knowledge. We argue that knowledge-based computational infrastructures can support researchers in organizing and making explicit the main aspects needed to make inferences or extract conclusions from an existing body of knowledge. This view is also comparatively built, contrasting it with alternatives for manipulating scientific knowledge, namely data-intensive approaches and the computational discovery of scientific knowledge. The current state of the art is presented with 22 knowledge representations and computational infrastructure implementations, with their main relevant properties analyzed and compared. Based on this review and on the theoretical foundations of Knowledge Engineering, a high level step-by-step approach for specifying and constructing scientific computational environments is described. The paper concludes by indicating paths for further development of the view initiated here, especially related to the technical specificities that originates from applying Knowledge Engineering to scientific knowledge.

With its presence in data integration, chemistry, biological, and geographic systems, eXtensible Markup Language (XML) has become an important standard not only in computer science. A common problem among the mentioned applications involves structural clustering of XML documents—an issue that has been thoroughly studied and led to the creation of a myriad of approaches. In this paper, we present a comprehensive review of structural XML clustering. First, we provide a basic introduction to the problem and highlight the main challenges in this research area. Subsequently, we divide the problem into three subtasks and discuss the most common document representations, structural similarity measures, and clustering algorithms. In addition, we present the most popular evaluation measures, which can be used to estimate clustering quality. Finally, we analyze and compare 23 state-of-the-art approaches and arrange them in an original taxonomy. By providing an up-to-date analysis of existing structural XML clustering algorithms, we hope to showcase methods suitable for current applications and draw lines of future research.

A Coordination Blockchain is a blockchain that coordinates activities of multiple private blockchains. This paper discusses the pros and cons of using Ethereum MainNet, the public Ethereum blockchain, as a Coordination Blockchain. The requirements Ethereum MainNet needs to fulfil to perform this role are analyzed within the context of Ethereum Private Sidechains, a private blockchain technology which allows many blockchains to be operated in parallel, and allows atomic crosschain transactions to execute across blockchains. We found that Ethereum MainNet is best suited to storing long-term static data that need to be widely available, such as the Ethereum Registration Authority information. However, due to Ethereum MainNet’s probabilistic finality, it is not well suited to information that needs to be available and acted upon immediately, such as the Sidechain Public Keys and Atomic Crosschain Transaction state information that need to be accessible prior to the first atomic crosschain transaction being issued on a sidechain. Although this paper examined the use of Ethereum MainNet as a Coordination Blockchain within reference to Ethereum Private Sidechains, the discussions and observations of the typical tasks a Coordination Blockchain may be expected to perform are applicable more widely to any multi-blockchain system.

This paper examines how formal specification techniques can support the verification and validation (V&V) of knowledge-based systems. Formal specification techniques provide levels of description which support both verification and validation, and V&V techniques feed back to assist the development of the specifications. Developing a formal specification for a system requires the prior construction of a conceptual model for the intended system. Many elements of this conceptual model can be effectively used to support V&V. Using these elements, the V&V process becomes deeper and more elaborate, and it produces results of a better quality compared with the V&V activities which can be performed on systems developed without conceptual models. However, we note that there are concerns in using formal specification techniques for V&V, not least being the effort involved in creating the specifications.

This review presents a brief survey of approaches to describing dialogues with computers which are relevant to improving communication between users and knowledge based systems. One approach to achieving improvements is to exploit the conventions of human communication. The review draws together some of the work on co-operative behavour which reflects these conventions. An analysis is presented which goes some way towards identifying the knowledge required and the issues to be tackled.

Statistical expert systems are attracting increasing attention as a possible way to alleviate the shortage of expert consultant statisticians. This paper summarises the requirements of such systems, showing how the demands of data analysis are different from those of other fields, and describes some recent work.

Both the Artificial Intelligence (AI) and the Operations Research (OR) communities are interested in developing techniques for solving hard combinatorial problems, in particular in the domain of planning and scheduling. AI approaches encompass a rich collection of knowledge representation formalisms for dealing with a wide variety of real-world problems. Some examples are constraint programming representations, logical formalisms, declarative and functional programming languages such as Prolog and Lisp, Bayesian models, rule-based formalism, etc. The downside of such rich representations is that in general they lead to intractable problems, and we therefore often cannot use such formalisms for handling realistic size problems. OR, on the other hand, has focused on more tractable representations, such as linear programming formulations. OR-based techniques have demonstrated the ability to identify optimal and locally optimal solutions for well-defined problem spaces. In general, however, OR solutions are restricted to rigid models with limited expressive power. AI techniques, on the other hand, provide richer and more flexible representations of real-world problems, supporting efficient constraint-based reasoning mechanisms as well as mixed initiative frameworks, which allow the human expertise to be in the loop. The challenge lies in providing representations that are expressive enough to describe real-world problems and at the same time guaranteeing good and fast solutions.

Machine learning seems to offer the solution to many problems in user modelling. However, one tends to run into similar problems each time one tries to apply out-of-the-box solutions to machine learning. This article closely relates the user modelling problem to the machine learning problem. It explicates some inherent dilemmas that are likely to be overlooked when applying machine learning algorithms in user modelling. Some examples illustrate how specific approaches deliver satisfying results and discuss underlying assumptions on the domain or how learned hypotheses relate to the requirements on the user model. Finally, some new or underestimated approaches offering promising perspectives in combined systems are discussed. The article concludes with a tentative ‘‘checklist” that one might like to consider when planning to apply machine learning to user modelling techniques.

Information imprecision and uncertainty exist in many real world applications, and such information would be retrieved, processed, shared, reused, and aligned in the maximum automatic way possible. As a popular family of formally well-founded and decidable knowledge representation languages, fuzzy Description Logics (fuzzy DLs), which extend DLs with fuzzy logic, are very well suited to cover for representing and reasoning with imprecision and uncertainty. Thus, a requirement naturally arises in many practical applications of knowledge-based systems, in particular the Semantic Web, because DLs are the logical foundation of the Semantic Web. Currently, there have been lots of fuzzy extensions of DLs with Zadeh's fuzzy logic theory papers published, to investigate fuzzy DLs and more importantly serve as identifying the direction of fuzzy DLs study. In this paper, we aim at providing a comprehensive literature overview of fuzzy DLs, and we focus our attention on fuzzy extensions of DLs based on fuzzy set theory. Other relevant formalisms that are based on approaches like probabilistic theory or non-monotonic logics are covered elsewhere. In detail, we first introduce the existing fuzzy DLs (including the syntax, semantics, knowledge base, and reasoning algorithm) from the origin, development (from weaker to stronger in expressive power), some special techniques, and so on. Then, the other important issues on fuzzy DLs, such as reasoning, querying, applications, and directions for future research, are also discussed in detail. Also, we make a comparison and analysis.

Methods for qualitative simulation allow predictions on the dynamics of a system to be made in the absence of quantitative information, by inferring the range of possible qualitative behaviors compatible with the structure of the system. This article reviews QSIM and other qualitative simulation methods. It discusses two problems that have seriously compromised the application of these methods to realistic problems in science and engineering: the occurrence of spurious behavior predictions and the combinatorial explosion of the number of behavior predictions. In response to these problems, related approaches for the qualitative analysis of dynamic systems have emerged: qualitative phase-space analysis and semi-quantitative simulation. The article argues for a synthesis of these approaches in order to obtain a computational framework for the qualitative analysis of dynamic systems. This should provide a solid basis for further upscaling and for the development of model-based reasoning applications of a wider scope.

Intelligent agents built on the basis of the BDI (belief–desire–intention) architecture are known as BDI agents. Currently, due to the increasing importance given to the affective capacities, they have evolved giving way to the BDI emotional agents. These agents are generally characterized by affective states such as emotions, mood or personality but sometimes also by affective capacities such as empathy or emotional regulation. In the paper, a review of the most relevant proposals to include emotional aspects in the design of BDI agents is presented. Both BDI formalizations and BDI architecture extensions are covered. From the review, common findings and good practices modeling affect, empathy and regulatory capacities in BDI agents, are extracted. In spite of the great advance in the area several, open questions remain and are also discussed in the paper.

Cloud robotics (CR) is currently a growing area in the robotic community. Indeed, the use of cloud computing to share data and resources of distributed robotic systems leads to the design and development of cloud robotic systems (CRS) which constitute useful technologies for a wide range of applications such as smart manufacturing, aid and rescue missions. However, in order to get coherent agent-to-cloud communications and efficient agent-to-agent collaboration within these CRS, there is a need to formalize the knowledge representation in CR. Hence, the use of ontologies provides a mean to define formal concepts and their relations in an interoperable way. This paper presents standard robotic ontologies and their extension in the CR domain as well as their possible implementations in the case of a real-world CR scenario.

In this article, we describe PrediCalc, a logical spreadsheet that allows for many-to-many constraints and propagation in all directions. We explain PrediCalc’s update mechanism and PrediCalc’s unique approach to handling inconsistencies between the spreadsheet values and the spreadsheet formulas. We have developed a paraconsistent entailment relation for the purpose of computing the consequences of PrediCalc’s value assignments under inconsistency.

We close with thoughts on the prospects of logical spreadsheets on the World Wide Web, and describe our initial Websheet prototypes.

This paper examines a perceived desire amongst software agent application and platform developers to have the ability to send domain-specific objects within inter-agent messages. If this feature is to be supported without departing from the notion that agents communicate in terms of knowledge, it is important that the meaning of such objects be well defined. Using an object-oriented metamodelling approach, the relationships between ontologies and agent communication and content languages in FIPA-style agent systems are examined. It is argued that for use with distributed multi-agent systems, ontologies should describe the nature of object identity and reference for each defined concept, and a UML profile supporting these modelling capabilities is presented. Finally it is shown how, given an ontology in UML, an ontology-specific object-oriented content language can be generated, allowing object structures (viewed in the abstract as UML object diagrams) to be used within message content to represent propositions, definite descriptions or (for classes without identity) value expressions.

AI researchers are becoming increasingly aware of the importance of reasoning about knowledge and belief. This paper reviews epistemic logic, a logic designed specifically for this type of reasoning. I introduce epistemic logic, and discuss some of the philosophical problems associated with it. I then compare two different styles of implementing theorem provers for epistemic logic. I also briefly discuss autoepistemic logic, a form of epistemic logic intended to model an agent's introspective reasoning, i.e. an agent's reasoning about its own beliefs. Finally, I discuss some of the proposals in the AI literature that are aimed at avoiding some of the philosophical problems that dog both epistemic and autoepistemic logic. This paper is not a full introduction to the field. Rather, it is intended to give the reader some flavour of the problems that research in this area faces, as well as some of the proposals for solving these problems.