Two functions of analogical reasoning in design. A cognitive-psychology approach

International audienceOn the basis of data collected in three empirical studies conducted on industrial designers, this paper identifies two different types of "spontaneous" use of analogy in design. Focus is on the first "stages" of analogical reasoning, i.e. construction of a target representation, and search and retrieval of a source. At the action-execution level, analogies are used in order to solve the current design problem; at the action-management level, in order to make the action-execution process cognitively more economical. Differences between the uses concern their dependence on the routine -character of the task, the distance between target and source, and their link with creativity and reuse (or case-based reasoning)

Adaptation of Cases for Case Based Forecasting with Neural Network Support

A novel approach to the combination of a case based reasoning system and an artificial neural network is presented in which the neural network is integrated within the case based reasoning cycle so that its generalizing ability may be harnessed to provide improved case adaptation performance. The ensuing hybrid system has been applied to the task of oceanographic forecasting in a real-time environment and has produced very promising results. After presenting classifications of hybrid artificial intelligence problem-solving methods, the particular combination of case based reasoning and neural networks, as a problem-solving strategy, is discussed in greater depth. The hybrid artificial intelligence forecasting model is then explained and the experimental results obtained from trials at sea are outlined

Design of fuzzy cash flows applying most typical values to a case-based reasoner outcome

Paper presented at the 3rd Congress of the Association for Fuzzy-Set Management and Economics, Buenos Aires, ArgentinaWhen dealing with economic decision making, (e.g., financial decision making, budgeting, business feasibility evaluation), one always needs to model cash flows that are uncertain by nature. Due to the lack of information, one has to rely on expert’s knowledge to perform such task. Experts use their expertise that combines knowledge and experiences within the context. We propose a system that builds a fuzzy cash flow from the outcome of a Case-Based Reasoning (CBR) system . This outcome is a set of numeric values where we calculate the Most Typical Values (MTV). The CBR system suggests a set of estimated values, appraising cash flow accounts. The system selects the values that better represent the given set using MTV approach, automatically creating Most Typical Fuzzy Sets describing values such as “around $500.00”. The content of the fuzzy cash flow consists of actual numbers (provided by certain liabilities and receivables), stated values (such as production targets and sales forecasts) and fuzzy constraints. The actual and stated values are combined with the fuzzy constraints with the purpose of building fuzzy cash flows to support financial decision making

A viewpoint-based case-based reasoning approach utilising an enterprise architecture ontology for experience management

The accessibility of project knowledge obtained from experiences is an important and crucial issue in enterprises. This information need about project knowledge can be different from one person to another depending on the different roles he or she has. Therefore, a new ontology-based case-based reasoning (OBCBR) approach that utilises an enterprise ontology is introduced in this article to improve the accessibility of this project knowledge. Utilising an enterprise ontology improves the case-based reasoning (CBR) system through the systematic inclusion of enterprisespecific knowledge. This enterprise-specific knowledge is captured using the overall structure given by the enterprise ontology named ArchiMEO, which is a partial ontological realisation of the enterprise architecture framework (EAF) ArchiMate. This ontological representation, containing historical cases and specific enterprise domain knowledge, is applied in a new OBCBR approach. To support the different information needs of different stakeholders, this OBCBR approach has been built in such a way that different views, viewpoints, concerns and stakeholders can be considered. This is realised using a case viewpoint model derived from the ISO/IEC/IEEE 42010 standard. The introduced approach was implemented as a demonstrator and evaluated using an application case that has been elicited from a business partner in the Swiss research project.This work was supported in part by the Commission for Technology and Innovation (CTI) of the Swiss Confederation under Grant 14575.1 PFES-ES and the ELO Digital Office CH AG.http://www.tandfonline.com/loi/teis202018-04-30hb2017Information Scienc

CONCEPTUAL COST MODELING OF INNOVATIVE INDUSTRIAL ESTATES USING SYSML AND CASE-BASED REASONING

Ph.DDOCTOR OF PHILOSOPH

A case-based reasoning system for radiotherapy treatment planning for brain cancer

In this thesis, a novel case-based reasoning (CBR) approach to radiotherapy treatment planning for brain cancer patients is presented. In radiotherapy, tumour cells are destroyed using ionizing radiation. For each patient, a treatment plan is generated that describes how the radiation should be applied in order to deliver a tumouricidal radiation dose while avoiding irradiation of healthy tissue and organs at risk in the vicinity of the tumour. The traditional, manual trial and error approach is a time-consuming process that depends on the experience and intuitive knowledge of medical physicists. CBR is an artificial intelligence methodology, which attempts to solve new problems based on the solutions of previously solved similar problems. In this research work, CBR is used to generate the parameters of a treatment plan by capturing the subjective and intuitive knowledge of expert medical physicists stored intrinsically in the treatment plans of similar patients treated in the past. This work focusses on the retrieval stage of the CBR system, in which given a new patient case, the most similar case in the archived case base is retrieved along with its treatment plan. A number of research issues that arise from using CBR for radiotherapy treatment planning for brain cancer are addressed. Different approaches to similarity calculation between cases are investigated and compared, in particular, the weighted nearest neighbour similarity measure and a novel non-linear, fuzzy similarity measure designed for our CBR system. A local case attribute weighting scheme has been developed that uses rules to assign attribute weights based on the values of the attributes in the new case and is compared to global attribute weighting, where the attribute weights remain constant for all target cases. A multi-phase case retrieval approach is introduced in which each phase considers one part of the solution. In addition, a framework developed for the imputation of missing values in the case base is described. The research was carried out in collaboration with medical physicists at the Nottingham University Hospitals NHS Trust, City Hospital Campus, UK. The performance of the developed methodologies was tested using brain cancer patient cases obtained from the City Hospital. The results obtained show that the success rate of the retrieval mechanism provides a good starting point for adaptation, the next phase in development for the CBR system. The developed automated CBR system will assist medical physicists in quickly generating treatment plans and can also serve as a teaching and training aid for junior, inexperienced medical physicists. In addition, the developed methods are generic in nature and can be adapted to be used in other CBR or intelligent decision support systems for other complex, real world, problem domains that highly depend on subjective and intuitive knowledge

A case-based reasoning system for radiotherapy treatment planning for brain cancer

In this thesis, a novel case-based reasoning (CBR) approach to radiotherapy treatment planning for brain cancer patients is presented. In radiotherapy, tumour cells are destroyed using ionizing radiation. For each patient, a treatment plan is generated that describes how the radiation should be applied in order to deliver a tumouricidal radiation dose while avoiding irradiation of healthy tissue and organs at risk in the vicinity of the tumour. The traditional, manual trial and error approach is a time-consuming process that depends on the experience and intuitive knowledge of medical physicists. CBR is an artificial intelligence methodology, which attempts to solve new problems based on the solutions of previously solved similar problems. In this research work, CBR is used to generate the parameters of a treatment plan by capturing the subjective and intuitive knowledge of expert medical physicists stored intrinsically in the treatment plans of similar patients treated in the past. This work focusses on the retrieval stage of the CBR system, in which given a new patient case, the most similar case in the archived case base is retrieved along with its treatment plan. A number of research issues that arise from using CBR for radiotherapy treatment planning for brain cancer are addressed. Different approaches to similarity calculation between cases are investigated and compared, in particular, the weighted nearest neighbour similarity measure and a novel non-linear, fuzzy similarity measure designed for our CBR system. A local case attribute weighting scheme has been developed that uses rules to assign attribute weights based on the values of the attributes in the new case and is compared to global attribute weighting, where the attribute weights remain constant for all target cases. A multi-phase case retrieval approach is introduced in which each phase considers one part of the solution. In addition, a framework developed for the imputation of missing values in the case base is described. The research was carried out in collaboration with medical physicists at the Nottingham University Hospitals NHS Trust, City Hospital Campus, UK. The performance of the developed methodologies was tested using brain cancer patient cases obtained from the City Hospital. The results obtained show that the success rate of the retrieval mechanism provides a good starting point for adaptation, the next phase in development for the CBR system. The developed automated CBR system will assist medical physicists in quickly generating treatment plans and can also serve as a teaching and training aid for junior, inexperienced medical physicists. In addition, the developed methods are generic in nature and can be adapted to be used in other CBR or intelligent decision support systems for other complex, real world, problem domains that highly depend on subjective and intuitive knowledge

A Modular Order-sorted Equational Generalization Algorithm

Generalization, also called anti-unification, is the dual of unification. Given terms t and t , a generalizer is a term t of which t and t are substitution instances. The dual of a most general unifier (mgu) is that of least general generalizer (lgg). In this work, we extend the known untyped generalization algorithm to, first, an order-sorted typed setting with sorts, subsorts, and subtype polymorphism; second, we extend it to work modulo equational theories, where function symbols can obey any combination of associativity, commutativity, and identity axioms (including the empty set of such axioms); and third, to the combination of both, which results in a modular, order-sorted equational generalization algorithm. Unlike the untyped case, there is in general no single lgg in our framework, due to order-sortedness or to the equational axioms. Instead, there is a finite, minimal and complete set of lggs, so that any other generalizer has at least one of them as an instance. Our generalization algorithms are expressed by means of inference systems for which we give proofs of correctness. This opens up new applications to partial evaluation, program synthesis, and theorem proving for typed equational reasoning systems and typed rulebased languages such as ASF+SDF, Elan, OBJ, Cafe-OBJ, and Maude. © 2014 Elsevier Inc. All rights reserved. 1.M. Alpuente, S. Escobar, and J. Espert have been partially supported by the EU (FEDER) and the Spanish MEC/MICINN under grant TIN 2010-21062-C02-02, and by Generalitat Valenciana PROMETEO2011/052. J. Meseguer has been supported by NSF Grants CNS 09-04749, and CCF 09-05584.Alpuente Frasnedo, M.; Escobar Román, S.; Espert Real, J.; Meseguer, J. (2014). A Modular Order-sorted Equational Generalization Algorithm. Information and Computation. 235:98-136. https://doi.org/10.1016/j.ic.2014.01.006S9813623

An intelligent framework for dynamic web services composition in the semantic web

As Web services are being increasingly adopted as the distributed computing technology of choice to securely publish application services beyond the firewall, the importance of composing them to create new, value-added service, is increasing. Thus far, the most successful practical approach to Web services composition, largely endorsed by the industry falls under the static composition category where the service selection and flow management are done a priori and manually. The second approach to web-services composition aspires to achieve more dynamic composition by semantically describing the process model of Web services and thus making it comprehensible to reasoning engines or software agents. The practical implementation of the dynamic composition approach is still in its infancy and many complex problems need to be resolved before it can be adopted outside the research communities. The investigation of automatic discovery and composition of Web services in this thesis resulted in the development of the eXtended Semantic Case Based Reasoner (XSCBR), which utilizes semantic web and AI methodology of Case Based Reasoning (CBR). Our framework uses OWL semantic descriptions extensively for implementing both the matchmaking profiles of the Web services and the components of the CBR engine. In this research, we have introduced the concept of runtime behaviour of services and consideration of that in Web services selection. The runtime behaviour of a service is a result of service execution and how the service will behave under different circumstances, which is difficult to presume prior to service execution. Moreover, we demonstrate that the accuracy of automatic matchmaking of Web services can be further improved by taking into account the adequacy of past matchmaking experiences for the requested task. Our XSCBR framework allows annotating such runtime experiences in terms of storing execution values of non-functional Web services parameters such as availability and response time into a case library. The XSCBR algorithm for matchmaking and discovery considers such stored Web services execution experiences to determine the adequacy of services for a particular task. We further extended our fundamental discovery and matchmaking algorithm to cater for web services composition. An intensive knowledge-based substitution approach was proposed to adapt the candidate service experiences to the requested solution before suggesting more complex and computationally taxing AI-based planning-based transformations. The inconsistency problem that occurs while adapting existing service composition solutions is addressed with a novel methodology based on Constraint Satisfaction Problem (CSP). From the outset, we adopted a pragmatic approach that focused on delivering an automated Web services discovery and composition solution with the minimum possible involvement of all composition participants: the service provider, the requestor and the service composer. The qualitative evaluation of the framework and the composition tools, together with the performance study of the XSCBR framework has verified that we were successful in achieving our goal