Case Based Reasoning for Chemical Engineering Design

With current industrial environment (competition, lower profit margin, reduced time to market, decreased product life cycle, environmental constraints, sustainable development, reactivity, innovation…), we must decrease the time for design of new products or processes. While the design activity is marked out by several steps, this article proposed a decision support tool for the preliminary design step. This tool is based on the Case Based Reasoning (CBR) method. This method has demonstrated its effectiveness in other domains (medical, architecture…) and more recently in chemical engineering. This method, coming from Artificial Intelligence, is based on the reusing of earlier experiences to solve new problems. The goal of this article is to show the utility of such method for unit operation (for example) pre-design but also to propose several evolutions for CBR through a domain as complex as the chemical engineering is (because of its interactions, non linearity, intensification problems…). During the pre-design step, some parameters like operating conditions are not precisely known but we have an interval of possible values, worse we only have a partial description of the problem.. To take into account this imprecision in the problem description, the CBR method is coupled with the fuzzy sets theory. After a mere presentation of the CBR method, a practical implementation is described with the choice and the pre-design of packing for separation columns

Storing and Indexing Plan Derivations through Explanation-based Analysis of Retrieval Failures

Case-Based Planning (CBP) provides a way of scaling up domain-independent planning to solve large problems in complex domains. It replaces the detailed and lengthy search for a solution with the retrieval and adaptation of previous planning experiences. In general, CBP has been demonstrated to improve performance over generative (from-scratch) planning. However, the performance improvements it provides are dependent on adequate judgements as to problem similarity. In particular, although CBP may substantially reduce planning effort overall, it is subject to a mis-retrieval problem. The success of CBP depends on these retrieval errors being relatively rare. This paper describes the design and implementation of a replay framework for the case-based planner DERSNLP+EBL. DERSNLP+EBL extends current CBP methodology by incorporating explanation-based learning techniques that allow it to explain and learn from the retrieval failures it encounters. These techniques are used to refine judgements about case similarity in response to feedback when a wrong decision has been made. The same failure analysis is used in building the case library, through the addition of repairing cases. Large problems are split and stored as single goal subproblems. Multi-goal problems are stored only when these smaller cases fail to be merged into a full solution. An empirical evaluation of this approach demonstrates the advantage of learning from experienced retrieval failure.Comment: See http://www.jair.org/ for any accompanying file

A Comparison of Different Machine Transliteration Models

Machine transliteration is a method for automatically converting words in one language into phonetically equivalent ones in another language. Machine transliteration plays an important role in natural language applications such as information retrieval and machine translation, especially for handling proper nouns and technical terms. Four machine transliteration models -- grapheme-based transliteration model, phoneme-based transliteration model, hybrid transliteration model, and correspondence-based transliteration model -- have been proposed by several researchers. To date, however, there has been little research on a framework in which multiple transliteration models can operate simultaneously. Furthermore, there has been no comparison of the four models within the same framework and using the same data. We addressed these problems by 1) modeling the four models within the same framework, 2) comparing them under the same conditions, and 3) developing a way to improve machine transliteration through this comparison. Our comparison showed that the hybrid and correspondence-based models were the most effective and that the four models can be used in a complementary manner to improve machine transliteration performance