{"title":"Simulated annealing based classification","authors":"S. Finnerty, S. Sen","doi":"10.1109/TAI.1994.346392","DOIUrl":"https://doi.org/10.1109/TAI.1994.346392","url":null,"abstract":"Attribute based classification has been one of the most active areas of machine learning research over the past decade. We view the problem of hypotheses formation for classification as a search problem. Whereas previous research acquiring classification knowledge have used a deterministic bias for forming generalizations, we use a more random bias for taking inductive leaps. We re-formulate the supervised classification problem as a function optimization problem, the goal of which is to search for a hypotheses that minimizes the number of incorrect classifications of training instances. We use a simulated annealing based classifier (SAC) to optimize the hypotheses used for classification. The particular variation of simulated annealing algorithm that we have used is known as Very Fast Simulated Re-annealing (VFSR). We use a batch-incremental mode of learning to compare SAC with a genetic algorithm based classifier, GABIL, and a traditional incremental machine learning algorithm, ID5R. By using a set of artificial target concepts, we show that SAC performs better on more complex target concepts.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127074745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Joining contextual information to the intervention in natural language interfaces","authors":"José Ramón Zubizarreta Aizpuru, Craig Jones","doi":"10.1109/TAI.1994.346417","DOIUrl":"https://doi.org/10.1109/TAI.1994.346417","url":null,"abstract":"We present a dialogue model which has as its main goal to place in context the utterance generated by the speaker. The dialogue model considers that an intervention generates one or more illocutionary acts which are handled as functions. These functions subcategorize to or are subcategorized by other functions in the dialogue. The model uses an exchange schema with the purpose of expressing the different functional subcategorizations. These schemas have properties close to the semantic forms of the verbs in a lexical-functional context.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129124832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A distributed scheduling framework","authors":"C. Gomes, A. Tate, L. Thomas","doi":"10.1109/TAI.1994.346514","DOIUrl":"https://doi.org/10.1109/TAI.1994.346514","url":null,"abstract":"A distributed problem solving approach to job shop scheduling is described. The approach views the system as an organisation. Agents are assigned different roles and functions depending on their position within the structure of the organisation. In this organisation, agents of the same level state their interests independently of each other and therefore conflict is likely to occur. A major thesis of the research reported here is that not only is it important to deal with conflict but also that conflict as a consequence of the scheduling process should be exploited as a way of integrating different scheduling perspectives, as a way of allowing agents to express their own interests independently of each other and, thus, as a way of guaranteeing pluralism by providing agents with both empirical knowledge (heuristics, dispatch rules) and theoretical knowledge (optimal algorithms).<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117273168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Integrating statistical methods for characterizing causal influences on planner behavior over time","authors":"A. Howe, R. Amant, P. Cohen","doi":"10.1109/TAI.1994.346513","DOIUrl":"https://doi.org/10.1109/TAI.1994.346513","url":null,"abstract":"Statistical causal modeling techniques allow us to develop models of program behavior, but these techniques tend to be limited in what they can model: either continuing, repetitive influences or causal influences without cycles, but not both as appear in many environments. The paper describes how two statistical modeling techniques can be combined to suggest and test specific hypotheses about how the environment and the AI planner's design causally influence the planner's behavior. One technique, dependency detection, is designed to identify relationships (dependencies) between particular failures, the methods that repair them and the occurrence of failures downstream. Another method, path analysis, builds causal models of correlational data. Dependency detection operates over a series of events, and path analysis models within a temporal snapshot. We explain the integration of the techniques and demonstrate it on execution data from the Phoenix planner.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124574284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Classification in DLMS utilizing a KL-ONE representation language","authors":"Nestor Rychtyckyj","doi":"10.1109/TAI.1994.346471","DOIUrl":"https://doi.org/10.1109/TAI.1994.346471","url":null,"abstract":"Ford Motor Company's Direct Labor Management System (DLMS) is the knowledge-based subsystem of complex multiphase manufacturing process planning system. DLMS is a deployed production system that is used daily by Ford Body and Assembly Division personnel in the performance of their duties. The knowledge used to drive the assembly planning system is stored in a knowledge base that is based on the KL-ONE knowledge representation system. This paper discusses the use of KL-ONE in an application-oriented environment and gives a \"report from the field\" of KL-ONE in production use. Advantages and disadvantages of using KL-ONE to represent a dynamic, large-scale conceptual framework for process planning is discussed.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133902767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application of fuzzy modeling to power plant generator control","authors":"V. Zambenedetti, S. Murakami","doi":"10.1109/TAI.1994.346495","DOIUrl":"https://doi.org/10.1109/TAI.1994.346495","url":null,"abstract":"The paper presents a fuzzy modeling of a power plant generator that is defined by a well-known set of differential equations used for transient control. Its main motivations are (1) to demonstrate the validity of the identification method based on fuzzy inference rules and (2) because a power plant has strong non-linearity and many conventional, non-fuzzy control tends to linearize it, the non-linear characteristics of fuzzy control can be useful to better describe and control this system. Results of simulations are shown.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130000730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Restructuring and optimizing knowledge representations","authors":"J. Vanthienen, G. Wets","doi":"10.1109/TAI.1994.346405","DOIUrl":"https://doi.org/10.1109/TAI.1994.346405","url":null,"abstract":"This paper focuses on three different formalisms which play a major role in the development of knowledge based systems, decision trees, decision tables and rules, and how the formalisms appear in the main areas of knowledge acquisition, knowledge representation and knowledge implementation. It demonstrates that the decision tables, trees or rules in the distinct stages serve different purposes in the development of knowledge based systems and therefore will not necessarily remain unchanged. Restructuring and even optimizing representation formalisms is therefore necessary. Transitions and optimizations of the different formalisms are described in the context of their automation in the Prologa workbench.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130094778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Studies on the effect of non-coding segments on the genetic algorithm","authors":"A. S. Wu, R. K. Lindsay, Michael D. Smith","doi":"10.1109/TAI.1994.346411","DOIUrl":"https://doi.org/10.1109/TAI.1994.346411","url":null,"abstract":"We study a specific aspect of the genetic algorithm (GA): the effect of non-coding segments on GA performance. Non-coding segments are segments of bits in an individual that provide no contribution, positive or negative, to the fitness of that individual. Previous research on non-coding segments suggests that including these structures in the GA population may improve GA performance. As a first step in our research, we tested our program on some of the same problems as the previous studies. This paper compares our results with the previous results and discusses the significance of the similarities and differences.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131019454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Experiences in using Prolog to develop a practical constraint solver","authors":"P. Lim","doi":"10.1109/TAI.1994.346427","DOIUrl":"https://doi.org/10.1109/TAI.1994.346427","url":null,"abstract":"Sophisticated Prolog implementations like ECL/sup i/PS/sup e/, with automatic memory management and facilities for data-driven computation, offer many advantages for software development. The question is whether such automated systems can be used to deliver applications with a practical performance. We discuss our experiences with implementing an incremental version of the Simplex algorithm in ECL/sup i/PS/sup e/ (as part of a constraint logic programming system). Our application consists of approximately 2000 lines of ECL/sup i/PS/sup e/ Prolog code. In this paper, we present the highlights of our implementational experience and show how the application takes advantage of the meta-level control facilities and the garbage-collector. After taking performance profiles, we show how we modified the algorithm to increase performance. In previous systems, such as CHIP, CLP(/spl Rscr/) and Prolog-III, the solver was written in C, following the conventional wisdom that this is necessary to achieve good performance. We show that intricate coding is not necessary, since automated tools such as ECL/sup i/PS/sup e/ can already be used to produce realistic applications (and ECL/sup i/PS/sup e/ is being improved on continuously). Our results are quantified using a series of benchmarks against existing C-coded implementations. The Simplex solver is being used within Esprit project CHIC to develop financial applications.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126687515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An attempt to apply the dividing and composing method to various frames of Chinese flower and bird paintings","authors":"Da-Yu Liu, Y. Aoki","doi":"10.1109/TAI.1994.346474","DOIUrl":"https://doi.org/10.1109/TAI.1994.346474","url":null,"abstract":"In our previous paper (1990), we discussed methods of expressing the composition knowledge of Chinese flower and bird paintings and proposed the dividing and composing method which could support computer painting based on the composition rules. In this paper, we attempt to apply this dividing and composing method to the various frames of paper (paintings using paper of different shapes) of Chinese flower and bird paintings. First, we analyzed the composition rules and described the expression method of composition knowledge in different frames of paper. Then, we defined the characteristic volume of painting elements, the frame centroid, the number of divisions and the division displacement to extract a dividing model. This procedure made possible the composition formation of various frames of paper.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127674277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}