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.

Forming coalitions is a generic means for cooperation: people, robots, web services, resources, firms; they can all improve their performance by joining forces. The use of coalitions has been successful in domains such as task allocations, sensor networks, and electronic marketplaces. Forming efficient coalitions requires the identification of matching synergies between different entities (finding complementary partners, or similar partners, or partners who add diversity). In addition, the different parties must negotiate a fair repartition of the worth created by the coalition. The first part of this paper is a tutorial on cooperative game theory (also called coalitional games). We then survey the different scenarios and the key issues addressed by the multiagent systems community.

This article presents the Kasimir system dedicated to decision knowledge management in oncology and which is built on top of Semantic Web technologies, taking benefit from standard knowledge representation formalisms and open reasoning tools. The representation of medical decision protocols, in particular for breast cancer treatment, is based on concepts and instances implemented within the description logic OWL DL (Web ontology language description logic). The knowledge units related to a protocol can then be applied for solving specific medical problems, using instance or concept classification. However, the straight application of a protocol is not always satisfactory, for example, because of contraindications, necessitating an adaptation of the protocol. This is why the principles and methods of case-based reasoning (CBR) in the framework of DLs have been used. In addition, the domain of oncology is complex and involves several specialties, for example, surgery and chemotherapy. This complexity can be better undertaken with a viewpoint-based representation of protocols and viewpoint-based reasoning, for either application or adaptation of the protocols. Accordingly, a distributed DL has been used for representing a viewpoint-based protocol. The application and the adaptation of the viewpoint-based protocol to medical cases is carried out using global instance classification and decentralized CBR.

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.

This paper addresses the problem of implementing a Simultaneous Localization and Mapping (SLAM) algorithm combined with a non-reactive controller (such as trajectory following or path following). A general study showing the advantages of using predictors to avoid mapping inconsistences in autonomous SLAM architectures is presented. In addition, this paper presents a priority-based uncertainty map construction method of the environment by a mobile robot when executing a SLAM algorithm. The SLAM algorithm is implemented with an extended Kalman filter (EKF) and extracts corners (convex and concave) and lines (associated with walls) from the surrounding environment. A navigation approach directs the robot motion to the regions of the environment with the higher uncertainty and the higher priority. The uncertainty of a region is specified by a probability characterization computed at the corresponding representative points. These points are obtained by a Monte Carlo experiment and their probability is estimated by the sum of Gaussians method, avoiding the time-consuming map-gridding procedure. The priority is determined by the frame in which the uncertainty region was detected (either local or global to the vehicle's pose). The mobile robot has a non-reactive trajectory following controller implemented on it to drive the vehicle to the uncertainty points. SLAM real-time experiments in real environment, navigation examples, uncertainty maps constructions along with algorithm strategies and architectures are also included in this work.

This paper presents a general approach to automatically compile e-learning models to planning, allowing us to easily generate plans, in the form of learning designs, by using existing domain-independent planners. The idea is to compile, first, a course defined in a standard e-learning language into a planning domain, and, second, a file containing students learning information into a planning problem. We provide a common compilation and extend it to three particular approaches that cover a full spectrum of planning paradigms, which increases the possibilities of using current planners: (i) hierarchical, (ii) including PDDL (Planning Domain Definition Language) actions with conditional effects and (iii) including PDDL durative actions. The learning designs are automatically generated from the plans and can be uploaded, and subsequently executed, by learning management platforms. We also provide an extensive analysis of the e-learning metadata specification required for planning, and the pros and cons on the knowledge engineering procedures used in each of the three compilations. Finally, we include some qualitative and quantitative experimentation of the compilations in several domain-independent planners to measure its scalability and applicability.

The fast increase in the size and number of databases demands data mining approaches that are scalable to large amounts of data. This has led to the exploration of parallel computing technologies in order to perform data mining tasks concurrently using several processors. Parallelization seems to be a natural and cost-effective way to scale up data mining technologies. One of the most important of these data mining technologies is the classification of newly recorded data. This paper surveys advances in parallelization in the field of classification rule induction.

User simulation is an important research area in the field of spoken dialogue systems (SDSs) because collecting and annotating real human–machine interactions is often expensive and time-consuming. However, such data are generally required for designing, training and assessing dialogue systems. User simulations are especially needed when using machine learning methods for optimizing dialogue management strategies such as Reinforcement Learning, where the amount of data necessary for training is larger than existing corpora. The quality of the user simulation is therefore of crucial importance because it dramatically influences the results in terms of SDS performance analysis and the learnt strategy. Assessment of the quality of simulated dialogues and user simulation methods is an open issue and, although assessment metrics are required, there is no commonly adopted metric. In this paper, we give a survey of User Simulations Metrics in the literature, propose some extensions and discuss these metrics in terms of a list of desired features.

This paper presents a graph-based knowledge representation and reasoning language. This language benefits from an important syntactic operation, which is called a graph homomorphism. This operation is sound and complete with respect to logical deduction. Hence, it is possible to do logical reasoning without using the language of logic but only graphical, thus visual, notions. This paper presents the main knowledge constructs of this language, elementary graph-based reasoning mechanisms, as well as the graph homomorphism, which encompasses all these elementary transformations in one global step. We put our work in context by presenting a concrete semantic annotation application example.

This paper presents PORSCE II, an integrated system that performs automatic Semantic Web service composition exploiting artificial intelligence (AI) techniques, specifically planning. Essential steps in achieving Web service composition include the translation of the Web service composition problem into a solver-ready planning domain and problem, followed by the acquisition of solutions, and the translation of the solutions back to Web service terms. The solutions to the problem, that is, the descriptions of the desired composite service, are obtained by means of external domain-independent planning systems, they are visualized and finally evaluated. Throughout the entire process, the system exploits semantic information extracted from the semantic descriptions of the available Web services and the corresponding ontologies, in order to perform composition under semantic awareness and relaxation.

This paper presents a distributed architecture for automating data mining (DM) processes using standard languages. DM is a difficult task that relies on an exploratory and analytic process of processing large quantities of data in order to discover meaningful patterns. The increasing heterogeneity and complexity of available data requires some expert knowledge on how to combine the multiple and alternative DM tasks to process the data. Here, we describe DM tasks in terms of Automated Planning, which allows us to automate the DM knowledge flow construction. The work is based on the use of standards that have been defined in both DM and automated-planning communities. Thus, we use PMML (Predictive Model Markup Language) to describe DM tasks. From the PMML, a problem description in PDDL (Planning Domain Definition Language) can be generated, so any current planning system can be used to generate a plan. This plan is, again, translated to a DM workflow description, Knowledge Flow for Machine Learning format (Knowledge Flow file for the WEKA (Waikato Environment for Knowledge Analysis) tool), so the plan or DM workflow can be executed in WEKA.

Graph mining is an important research area within the domain of data mining. The field of study concentrates on the identification of frequent subgraphs within graph data sets. The research goals are directed at: (i) effective mechanisms for generating candidate subgraphs (without generating duplicates) and (ii) how best to process the generated candidate subgraphs so as to identify the desired frequent subgraphs in a way that is computationally efficient and procedurally effective. This paper presents a survey of current research in the field of frequent subgraph mining and proposes solutions to address the main research issues.

To work in a higher abstraction level is of critical importance for the development of multiagent systems (MAS) since it is almost impossible to observe code-level details of such systems due to their internal complexity, distributedness and openness. As one of the promising software development approaches, model-driven development (MDD) aims to change the focus of software development from code to models. This paradigm shift, introduced by the MDD, may also provide the desired abstraction level during the development of MASs. For this reason, MDD of autonomous agents and MASs has been recognized and become one of the research topics in agent-oriented software engineering (AOSE) area. Contributions are mainly based on the model-driven architecture (MDA), which is the most famous and in-use realization of MDD. Within this direction, AOSE researchers define MAS metamodels in various abstraction levels and apply model transformations between the instances of these metamodels in order to provide rapid and efficient implementation of the MASs in various platforms. Reorganization of the existing MAS development methodologies to support model-driven agent development is another emerging research track. In this paper, we give a state of the art survey on above mentioned model-driven MAS development research activities and evaluate the introduced approaches according to five quality criteria we define on model-driven MAS engineering: (1) definition of a platform independent MAS metamodel, (2) model-to-model transformability, (3) model-to-code transformability, (4) support for multiple MAS platforms and finally (5) tool support for software modeling and code generation. Our evaluation has shown that the researchers contributed to the area by providing MDD processes in which design of the MASs are realized at a very high abstraction level and the software for these MASs are developed as a result of the application of a series of model transformations. However, most of the approaches are incapable of supporting multiple MAS environments due to the restricted specifications of their metamodels and model transformations. Also efficiency and practicability of the proposed methodologies are under debate since the amount and quality of the executable MAS components, gained automatically, appear to be not sufficient.

Biologists depend on visual representations, and their use of diagrams has drawn the attention of philosophers, historians, and sociologists interested in understanding how these images are involved in biological reasoning. These studies, however, proceed from identification of diagrams on the basis of their spare visual appearance, and do not draw on a foundational theory of the nature of diagrams as representations. This approach has limited the extent to which we understand how these diagrams are involved in biological reasoning. In this paper, I characterize three different kinds of figures among those previously identified as diagrams. The features that make these figures distinctive as representational types, furthermore, illuminate the ways in which they are involved in biological reasoning.

Hierarchical Task Network (HTN) planning paradigm has been widely used during the last decade to model and solve planning and scheduling (P&S) problems, and it has proved to be very useful in the planning and coordination of human tasks. At the same time, Business Process Management (BPM) tools are being increasingly used in the modeling of organizations’ business practices and processes, but their life cycle has shown to have some shortages (as the possibility to obtain context-dependent plan instances). In this paper we present a methodology and software framework to translate Business Process Models into HTN P&S domains, in order to cover some of these deficiencies.

This paper integrates the responses to a set of questions from a distinguished set of panelists involved in a discussion at the Agreement Technologies workshop in Cyprus in December 2009. The panel was concerned with the relationship between the research areas of semantics, norms, and organizations, and the ways in which each may contribute to the development of the others in support of next generation agreement technologies.

Industrial design processes can be described as human design problem solving, incorporating the acquisition, evaluation, production and transfer of specific knowledge. In this paper, we will describe the connection and interaction between visualization and reasoning during different stages of the design process. Thereby we focus on three early stages of this process: clarifying the task, concepting and designing an overall solution.

This paper provides a rather general description of design processes and more detailed remarks on design knowledge and design actions. It specifically focuses on design concepts as visual key elements in industrial design processes. We will address the importance of externalization and visualization as means for thinking and knowledge generation and transfer in industrial design in general.

The design process is described as an interplay of the parallel and iterative developments of three domains: knowledge, concept and design. In contrast to linear schemes, this paper proposes a design process scheme focusing on iterative circles and parallel processing possibilities. Industrial design knowledge will be described and compared to relevant knowledge in other disciplines, in particular, engineering design knowledge. We will describe the strong link between the designer's individual biographies, design knowledge and the outcome of design processes.

Design concepts will be discussed as extremely compact representations of core characteristics of the artifacts to be designed, serving as a guide to the design process.

Design actions as described in this paper are characterized by the simultaneous occurrence of thought and externalization processes. Different kinds of visualization are discussed in regard of their role in reasoning during industrial design processes.

This paper concludes by sketching two perspectives. One addresses the need for interdisciplinary research on new visualization tools with regard to human reasoning in design processes. The second one gives an impression of how visualization tools and methods of industrial design can supplement other disciplines.