Search

The rehabilitation robot can assist hemiplegic patients to complete the training program effectively, but it only focuses on helping the patient’s training process and requires the rehabilitation therapists to manually adjust the training parameters according to the patient’s condition. Therefore, there is an urgent need for intelligent training prescription research of rehabilitation robots to promote the clinical applications. This study proposed a decision support system for the training of upper limb rehabilitation robot based on hybrid reasoning with rule-based reasoning (RBR) and case-based reasoning (CBR). The expert knowledge base of this system is established base on 10 professional rehabilitation therapists from three different rehabilitation departments in Shanghai who are enriched with experiences in using desktop-based upper limb rehabilitation robot. The rule-based reasoning is chosen to construct the cycle plan inference model, which develops a 21-day training plan for the patients. The case base consists of historical case data from 54 stroke patients who underwent rehabilitation training with a desktop-based upper limb rehabilitation robot. The case-based reasoning, combined with a Random Forest optimized algorithm, was constructed to adjust the training parameters for the patients in real-time. The system recommended a rehabilitation training program with an average accuracy of 91.5%, an average AUC value of 0.924, an average recall rate of 88.7%, and an average F1 score of 90.1%. The application of this system in rehabilitation robot would be useful for therapists.

Farmed fish disease diagnosis is an important problem in the fish farming industry, affecting quality of production and financial losses. In this paper, we present a web-based intelligent system that tackles the problem of fish disease diagnosis. To this end, it uses multiple knowledge representation and reasoning methods: rule-based, case-based, weight-based, and voting. Knowledge, which concerns the diagnosis of sea bass diseases, was acquired from experts in the field and represented in the form of decision trees. The diagnostic process is performed in two stages: a general one and a specialized one. In the general stage, a level-based diagnosis is performed, where environmental parameters, external signs, and internal signs are successively examined, and the three most probable diseases are identified. In the specialized stage, which is optional, a specialized expert system is used for each of the resulting diseases, where additional parameters concerning laboratory tests (microbiological, microscopic, molecular, and chemical) are considered. The general stage is the most useful, given that it can be performed on-site in real-time, whereas the specialized one requires time-consuming lab tests. The system also provides explanations for its decisions. Evaluation of the general-stage diagnostic process showed a top-3 accuracy of 78.79% on expert test cases and 94% on an artificial dataset. [ABSTRACT FROM AUTHOR]

Over the last decades, the development of Answer Set Programming (ASP) has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficult to provide semantic underpinnings capturing the resulting constructs and inferences. This is even more severe when it comes to hybrid ASP languages and systems that are often needed to handle real-world applications. We address this challenge and introduce the concept of abstract and structured theories that allow us to formally elaborate upon their integration with ASP. We then use this concept to make the semantic characterization of clingo's theory-reasoning framework precise. This provides us with a formal framework in which we can elaborate upon the formal properties of existing hybridizations of clingo, such as clingcon, clingo[dl], and clingo[lp]. [ABSTRACT FROM AUTHOR]

A warehouse delivery problem consists of a set of robots that undertake delivery jobs within a warehouse. Items are moved around the warehouse in response to events. A solution to a warehouse delivery problem is a collision-free schedule of robot movements and actions that ensures that all delivery jobs are completed and each robot is returned to its docking station. While the warehouse delivery problem is related to existing research, such as the study of multi-agent path finding (MAPF), the specific industrial requirements necessitated a novel approach that diverges from these other approaches. For example, our problem description was more suited to formalizing the warehouse in terms of a weighted directed graph rather than the more common grid-based formalization. We formalize and encode the warehouse delivery problem in Answer Set Programming (ASP) extended with difference constraints. We systematically develop and study different encoding variants, with a view to computing good quality solutions in near real-time. In particular, application specific criteria are contrasted against the traditional notion of makespan minimization as a measure of solution quality. The encoding is tested against both crafted and industry data and experiments run using the Hybrid ASP solver clingo[dl]. [ABSTRACT FROM AUTHOR]

Farmed fish disease diagnosis is an important problem in the fish farming industry, affecting quality of production and financial losses. In this paper, we present a web-based intelligent system that tackles the problem of fish disease diagnosis. To this end, it uses multiple knowledge representation and reasoning methods: rule-based, case-based, weight-based, and voting. Knowledge, which concerns the diagnosis of sea bass diseases, was acquired from experts in the field and represented in the form of decision trees. The diagnostic process is performed in two stages: a general one and a specialized one. In the general stage, a level-based diagnosis is performed, where environmental parameters, external signs, and internal signs are successively examined, and the three most probable diseases are identified. In the specialized stage, which is optional, a specialized expert system is used for each of the resulting diseases, where additional parameters concerning laboratory tests (microbiological, microscopic, molecular, and chemical) are considered. The general stage is the most useful, given that it can be performed on-site in real-time, whereas the specialized one requires time-consuming lab tests. The system also provides explanations for its decisions. Evaluation of the general-stage diagnostic process showed a top-3 accuracy of 78.79% on expert test cases and 94% on an artificial dataset.

Several methods have been proposed in the last two decades to recognize human activities based on sensor data acquired in smart-homes. While most existing methods assume the presence of a single inhabitant, a few techniques tackle the challenging issue of multi-resident activity recognition. To the best of our knowledge, all existing methods for multi-inhabitant activity recognition require the acquisition of a labeled training set of activities and sensor events. Unfortunately, activity labeling is costly and may disrupt the users' privacy. In this article, we introduce a novel technique to recognize multi-inhabitant activities without the need of labeled datasets. Our technique relies on an unlabeled sensor data stream acquired from a single resident, and on ontological reasoning to extract probabilistic associations among sensor events and activities. Extensive experiments with a large dataset of multi-inhabitant activities show that our technique achieves an average accuracy very close to the one of state-of-the-art supervised methods, without requiring the acquisition of labeled data.

Recently, there has been a big progress in developing artificial deep-learning neural networks and large-scale knowledge graphs. However, the results in these two research fields have serious drawbacks. The solutions offered by neural networks remain unstable and prone to adversarial attacks: while the percentage of correct answers increases, the incorrect answers often contain glaring errors. Large knowledge graphs contain a lot of facts but little knowledge; they are mostly used for information search and retrieval. The ability to reason conclusions on them is limited, and the majority of modern research turns to approximate methods like neural networks and graph embeddings to draw conclusions and use the accumulated knowledge. In this work, I propose a hybrid cognitive architecture inspired by the observable features of human thinking. Pruning obviously wrong solutions seems to be more natural for human symbolic reasoning than making far-fetched strict logical conclusions, while generating new ideas is often intuitive. So a hybrid cognitive architecture can employ generative neural networks as a sort of "intuition" (generating possible solutions) and symbolic inference as a control contour to verify and filter the generated solutions, weeding out dangerous and wrong ideas. This requires creating knowledge graphs containing negative information: the information of what cannot happen or should not be done and why. The problems of creating negative knowledge graphs are discussed. Hybrid cognitive systems using the proposed architecture will be a lot more trustworthy as they will have a system of human-verifiable rules that ensures avoiding the worst errors which can be used in many fields from decision making to natural-language parsing. [ABSTRACT FROM AUTHOR]

Knowledge graphs (KGs) contain rich resources that represent human knowledge in the world. There are mainly two kinds of reasoning techniques in knowledge graphs, symbolic reasoning and statistical reasoning. However, both of them have their merits and limitations. Therefore, it is desirable to combine them to provide hybrid reasoning in a knowledge graph. In this paper, we present the first work on the survey of methods for hybrid reasoning in knowledge graphs. We categorize existing methods based on applications of reasoning techniques, and introduce the key ideas of them. Finally, we re-examine the remaining research problems to be solved and provide an outlook to future directions for hybrid reasoning in knowledge graphs. [ABSTRACT FROM AUTHOR]

Diagnostic tests are used to determine anomalies in complex systems such as organisms or built structures. Once a set of tests is performed, the experts interpret their results and make decisions based on them. This process is named diagnostic reasoning. In diagnostic reasoning a decision is established by using both rules and general knowledge on the tests and the domain. The artificial intelligence community has focused on devising and automating different methods of diagnosis for medicine and engineering, but, to the best of our knowledge, the decision process in logical terms has not yet been investigated thoroughly. The automation of the diagnostic process would be helpful in a number of contexts, in particular when the number of test sets to make decision is too wide to be dealt with manually. To tackle such challenges, we shall study logical frameworks for diagnostic reasoning, automation methods and their computational properties and technologies implementing these methods. In this paper, we present the formalization of a hybrid reasoning framework TL that hosts tests and deduction rules on tests, and an algorithm that transforms a TL theory into defeasible logic, for which an implemented automated deduction technology (called Spindle) exists. We evaluate the methodology by means of a real-world example related to the Open Web Application Security Project requisites. The full diagnostic process is driven from the definition of the issue to the decision. [ABSTRACT FROM AUTHOR]

Brain tissue segmentation is one of the most important parts of clinical diagnostic tools. Fuzzy C-mean (FCM) is one of the most popular clustering based segmentation methods. However FCM does not robust against noise and artifacts such as partial volume effect (PVE) and inhomogeneity. In this paper, a new approach for robust brain tissue segmentation is described. The proposed method quantifies the volumes of white matter (WM), gray matter (GM) and cerebrospinal fluid(CSF) tissues using hybrid clustering process which based on: (1) FCM algorithm to get the initial center partition. (2) Genetic algorithms (GA) to achieve optimization and to determine the appropriate cluster centers and the fuzzy corresponding partition matrix. (3) Possibilistic C-Means (PCM) algorithm for volumetric measurements of WM, GM, and CSF brain tissues. (4) Rule of the possibility maximum to compute the labeled image in decision step. The experiments were realized using different real and synthetic brain images from patients with Alzheimer’s disease. We used Tanimoto coefficient, sensitivity and specificity validity indexes to validate the proposed hybrid approach and we compared the performance with several competing methods namely FCM and PCM algorithms. Good result was achieved which demonstrates the efficiency of proposed clustering approach and that it can outperforms competing methods especially in the presence of PVE and when the noise and spatial intensity inhomogeneity are high.

Abstract Recent developments in Information and Communication Technologies (ICT) and online healthcare services have created a huge volume of health data. With the advancements in machine learning approaches, the research on Disease Prediction Support System (DPSS) has attracted many researchers globally. In this article, we present a hybrid reasoning-based methodology on predicting diseases. The combinatorial advantage of Fuzzy sety theory, k-nearest neighbor and case-based reasoning helps to yield enhanced prediction results. Though DPSS facilitates promising healthcare services, data security and privacy are still crucial challenging issues to be addressed. The DPSS is extended as a Privacy-Aware Disease Prediction Support System (PDPSS) using Paillier Homomorphic Encryption to preserve patients' sensitive information from unauthorized user access. The proposed prediction model is evaluated with the statistical evaluation metrics, and the experimental results reveal the improved performance of PDPSS in enhanced prediction accuracy and better security. [ABSTRACT FROM AUTHOR]

Abstract Materials failure problems are becoming a serious concern because there would be a variety of consequences possibly affecting public safety. Therefore, materials failure analysis is needed to find out the reason of failure and avoid similar failures' reoccurring. However, materials failure cases mostly rely on manual analysis by experts with sufficient domain knowledge, leading to the situation of time-consuming, low efficiency and difficult evaluation. This paper proposes a rule-case based hybrid reasoning approach for materials failure analysis with the aid of ontology. Hundreds of materials failure cases from different industries were collected and analyzed by rule-based reasoning, case-based reasoning and our hybrid method. It is demonstrated that the rule-case based hybrid reasoning method can obviously provide better analysis results in comparison with rule-based reasoning and case-based reasoning alone. Highlights • AI-based method is introduced into materials failure case analysis. • A hybrid reasoning method combines the advantages of rule-based and case-based reasoning and gives the best result. • With enough failure cases and computable rules, the method can reduce manual failure analysis work of domain experts. [ABSTRACT FROM AUTHOR]

We consider cognitive factories with multiple teams of heterogenous robots, and address two key challenges of these domains, hybrid reasoning for each team and finding an optimal global plan (with minimum makespan) for multiple teams. For hybrid reasoning, we propose modeling each team's workspace taking into account capabilities of heterogeneous robots, embedding continuous external computations into discrete symbolic representation and reasoning, not only optimizing the makespans of local plans but also minimizing the total cost of robotic actions. To find an optimal global plan, we propose a semi-distributed approach that does not require exchange of information between teams but yet achieves on an optimal coordination of teams that can help each other. We prove that the optimal coordination problem is NP-complete, and describe a solution using automated reasoners. We experimentally evaluate our methods, and show their applications on a cognitive factory with dynamic simulations and a physical implementation. [ABSTRACT FROM AUTHOR]

Due to the urgent need for more flexible and intelligent response to rapid changing customer demand in highly competitive market environment, intelligent optimization of the cutting process parameters based on the cutting process cases were researched, and an expert system (ES) of the green cutting process technology was constructed. Its processor was performed by hybrid reasoning method of cases and rules while part model and process model of the workpiece to be manufactured were carried out. The mathematical model of machine tool energy consumption was given using response surface methodology (RSM) based on experimental data collected from the machining tool manufacturing enterprise. Based on the case library, the basic database, the model library and the rule library, the part model and the process model of the typical machine tool parts were established, thus those formed a knowledge base. The cutting process technology of the head spindle on certain machine tool was optimized as one instance, the process of similar calculation and the optimization procedure was given. The optimization process technology was verified, and it proved the feasibility and applicability of the ES. Those provided one optimization plan and program of green processing technology for the sustainable manufacturing enterprises. The ES of the green cutting process technology could help the technologist of enterprises more rapidly respond to the demands of customers in highly competitive market environment and relieve the impact to the environment. [ABSTRACT FROM AUTHOR]

Planners for real robotic systems should not only reason about abstract actions, but also about aspects related to physical execution such as kinematics and geometry. We present an approach to hybrid task and motion planning, in which state-based forward-chaining task planning is tightly coupled with motion planning and other forms of geometric reasoning. Our approach is centered around the problem of geometric backtracking that arises in hybrid task and motion planning: in order to satisfy the geometric preconditions of the current action, a planner may need to reconsider geometric choices, such as grasps and poses, that were made for previous actions. Geometric backtracking is a necessary condition for completeness, but it may lead to a dramatic computational explosion due to the large size of the space of geometric states. We explore two avenues to deal with this issue: the use of heuristics based on different geometric conditions to guide the search, and the use of geometric constraints to prune the search space. We empirically evaluate these different approaches, and demonstrate that they improve the performance of hybrid task and motion planning. We demonstrate our hybrid planning approach in two domains: a real, humanoid robotic platform, the DLR Justin robot, performing object manipulation tasks; and a simulated autonomous forklift operating in a warehouse. [ABSTRACT FROM AUTHOR]

Logic-based approaches to legal problem solving model the rule-governed nature of legal argumentation, justification, and other legal discourse but suffer from two key obstacles: the absence of efficient, scalable techniques for creating authoritative representations of legal texts as logical expressions; and the difficulty of evaluating legal terms and concepts in terms of the language of ordinary discourse. Data-centric techniques can be used to finesse the challenges of formalizing legal rules and matching legal predicates with the language of ordinary parlance by exploiting knowledge latent in legal corpora. However, these techniques typically are opaque and unable to support the rule-governed discourse needed for persuasive argumentation and justification. This paper distinguishes representative legal tasks to which each approach appears to be particularly well suited and proposes a hybrid model that exploits the complementarity of each. [ABSTRACT FROM AUTHOR]

Abstract: Although the OWL (Web Ontology Language) and SWRL (Semantic Web Rule Language) add considerable expressiveness to the Semantic Web they do have expressive limitations. For some reasoning problems it is necessary to infer the existence of new individuals satisfying stated condition. This kind of problems can not be fully resolved by OWL and SWRL. We present the XSWRL (Extended Semantic Web Rule Language), an extension to SWRL, to overcome these problems. XSWRL introduces existentially quantified variables to rules. XSWRL extends SWRL in a syntactically and semantically coherent manner. We show that while the expressiveness of the Semantic Web language is improved, the undecidability and infinite chains are brought on. We define the inseparable set of atoms to separate XSWRL rules, and discuss a prototype implementation of reasoning support for XSWRL. [ABSTRACT FROM AUTHOR]

In this paper, the components of a high-speed cutting system are analyzed firstly. The component variables of the high-speed cutting system are classified into four types: uncontrolled variables, process variables, control variables, and output variables. The relationships and interactions of these variables are discussed. Then, by analyzing and comparing intelligent reasoning methods frequently used, the hybrid reasoning is employed to build the high-speed cutting database system. Then, the data structures of high-speed cutting case base and databases are determined. Finally, the component parts and working process of the high-speed cutting database system on the basis of hybrid reasoning are presented. [ABSTRACT FROM AUTHOR]

In this paper, we present an approach that integrates symbolic rules, neural networks and cases. To achieve it, we integrate a kind of hybrid rules, called neurules, with cases. Neurules integrate symbolic rules with the Adaline neural unit. In the integration, neurules are used to index cases representing their exceptions. In this way, the accuracy of the neurules is improved. On the other hand, due to neurule-based efficient inference mechanism, conclusions can be reached more efficiently. In addition, neurule-based inferences can be performed even if some of the inputs are unknown, in contrast to symbolic rule-based inferences. Furthermore, an existing symbolic rule-base with indexed exception cases can be converted into a neurule-base with corresponding indexed exception cases. Finally, empirical data can be used as a knowledge source, which facilitates knowledge acquisition. We also present a new high-level categorization of the approaches integrating rule-based and case-based reasoning. [Copyright &y& Elsevier]