A specialized match algorithm called Uni-Rete is reported. Uni-Rete is a specialization of the widely used Rete match algorithm to unique attributes. Performance results for Uni-Rete indicate over tenfold speedup with respect to Rete. The implications of Uni-Rete for non-unique-attribute systems are discussed.<>
{"title":"An efficient algorithm for production systems with linear-time match","authors":"Milind Tambe, D. Kalp, P. Rosenbloom","doi":"10.1109/TAI.1992.246375","DOIUrl":"https://doi.org/10.1109/TAI.1992.246375","url":null,"abstract":"A specialized match algorithm called Uni-Rete is reported. Uni-Rete is a specialization of the widely used Rete match algorithm to unique attributes. Performance results for Uni-Rete indicate over tenfold speedup with respect to Rete. The implications of Uni-Rete for non-unique-attribute systems are discussed.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126928832","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}
A mathematical explanation as to why fuzzy control is smoother and more stable than control by experts whose experience was used to design the fuzzy control is presented. The analysis indicates that fuzzy control is always continuous and exhibits better performance, even in complicated control situations.<>
{"title":"Fuzzy control is often better than manual control of the very experts whose knowledge it uses: an explanation","authors":"V. Kreinovich, R. Lea, O. Fuentes, A. Lokshin","doi":"10.1109/TAI.1992.246357","DOIUrl":"https://doi.org/10.1109/TAI.1992.246357","url":null,"abstract":"A mathematical explanation as to why fuzzy control is smoother and more stable than control by experts whose experience was used to design the fuzzy control is presented. The analysis indicates that fuzzy control is always continuous and exhibits better performance, even in complicated control situations.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132947362","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}
A CASE (computer-aided software design) tool called IASCE has been developed to help the project manager estimate a proposed project cost. This tool collects accurate data from current software so that researchers can explore new software models and metrics. IASCE also supports multiple software cost estimation models and their corresponding metrics, tractable for project management control, feedback, and learning activities. In addition, IASCE provides for the establishment of project-specific cost models and corporate metrics for the models, permits tracing of these models and metrics throughout the software life cycle via feedback and post mortem evaluation, and offers a mechanism for long-range improvements of software cost estimation. It can be tailored to a specific software development environment.<>
{"title":"IASCE: an intelligent assistant to software cost estimation","authors":"Shouli Wang, D. Kountanis","doi":"10.1109/TAI.1992.246365","DOIUrl":"https://doi.org/10.1109/TAI.1992.246365","url":null,"abstract":"A CASE (computer-aided software design) tool called IASCE has been developed to help the project manager estimate a proposed project cost. This tool collects accurate data from current software so that researchers can explore new software models and metrics. IASCE also supports multiple software cost estimation models and their corresponding metrics, tractable for project management control, feedback, and learning activities. In addition, IASCE provides for the establishment of project-specific cost models and corporate metrics for the models, permits tracing of these models and metrics throughout the software life cycle via feedback and post mortem evaluation, and offers a mechanism for long-range improvements of software cost estimation. It can be tailored to a specific software development environment.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129381312","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}
The problem of comparison between unordered trees, i.e. trees for which the order among siblings is unimportant, is considered. The criterion for comparison is the distance as measured by a weighted sum of the costs of deletion, insertion, and relabel operations on tree nodes. Such comparisons may contribute to pattern recognition efforts in any field (e.g. genetics) where data can naturally be characterized by unordered trees. It is observed that the problem is NP-complete. An enumerative algorithm and several heuristics leading to approximate solutions are given. The algorithms are based on probabilistic hill climbing and bipartite matching techniques. The accuracy and time efficiency of the heuristics are evaluated by applying them to a set of trees transformed from industrial parts based on a previously proposed morphological model.<>
{"title":"Pattern matching in unordered trees","authors":"D. Shasha, J. Wang, Kaizhong Zhang, F. Shih","doi":"10.1109/TAI.1992.246429","DOIUrl":"https://doi.org/10.1109/TAI.1992.246429","url":null,"abstract":"The problem of comparison between unordered trees, i.e. trees for which the order among siblings is unimportant, is considered. The criterion for comparison is the distance as measured by a weighted sum of the costs of deletion, insertion, and relabel operations on tree nodes. Such comparisons may contribute to pattern recognition efforts in any field (e.g. genetics) where data can naturally be characterized by unordered trees. It is observed that the problem is NP-complete. An enumerative algorithm and several heuristics leading to approximate solutions are given. The algorithms are based on probabilistic hill climbing and bipartite matching techniques. The accuracy and time efficiency of the heuristics are evaluated by applying them to a set of trees transformed from industrial parts based on a previously proposed morphological model.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124250571","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}
A knowledge acquisition framework in which both domain knowledge and specification elicited and refined can interact with a knowledge engineer is proposed. TAME, a hypertext-based knowledge acquisition assistant supporting the framework in an integrated environment, is described. TAME supports a task-based specification methodology (TBSM) in knowledge acquisition and specification elicitation in the following ways. First, TAME's templates provide the building blocks and autolinks in the acquisition process. Second, TAME's browsing and retrieval aids allow users to navigate in the knowledge document using search, navigation links, etc. Finally, TAME generates feedback to inform users about incomplete refinements, duplications, and inconsistent composition of task state expressions (TSEs).<>
{"title":"TAME: an integrated environment for task-based knowledge and specification acquisition","authors":"Jonathan Lee, J. Yen, Josette Pastor","doi":"10.1109/TAI.1992.246426","DOIUrl":"https://doi.org/10.1109/TAI.1992.246426","url":null,"abstract":"A knowledge acquisition framework in which both domain knowledge and specification elicited and refined can interact with a knowledge engineer is proposed. TAME, a hypertext-based knowledge acquisition assistant supporting the framework in an integrated environment, is described. TAME supports a task-based specification methodology (TBSM) in knowledge acquisition and specification elicitation in the following ways. First, TAME's templates provide the building blocks and autolinks in the acquisition process. Second, TAME's browsing and retrieval aids allow users to navigate in the knowledge document using search, navigation links, etc. Finally, TAME generates feedback to inform users about incomplete refinements, duplications, and inconsistent composition of task state expressions (TSEs).<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115955340","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}
A generic knowledge acquisition shell (GAS) which allows users to easily construct and then execute a domain-specific knowledge acquisition tool is designed. GAS contains six modules-a structure editor, a tool generator, a tool interpreter, a knowledge processor, a data management system, and a graphics-based user interface-and a primitives kernel including sufficient primitives in problem-solving strategy, knowledge representation, and knowledge acquisition techniques. This approach relieves knowledge engineers from selecting and applying different knowledge acquisition tools for different domains. GAS is an open architecture so that further enhancement can be done easily.<>
{"title":"Design of a generic knowledge acquisition shell","authors":"Chih-Cheng Chien, Cheng-Seen Ho","doi":"10.1109/TAI.1992.246427","DOIUrl":"https://doi.org/10.1109/TAI.1992.246427","url":null,"abstract":"A generic knowledge acquisition shell (GAS) which allows users to easily construct and then execute a domain-specific knowledge acquisition tool is designed. GAS contains six modules-a structure editor, a tool generator, a tool interpreter, a knowledge processor, a data management system, and a graphics-based user interface-and a primitives kernel including sufficient primitives in problem-solving strategy, knowledge representation, and knowledge acquisition techniques. This approach relieves knowledge engineers from selecting and applying different knowledge acquisition tools for different domains. GAS is an open architecture so that further enhancement can be done easily.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116326087","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}
As an example of the intelligent actions of robots, the situation in which a mobile robot pushes a square box is considered. The operation of pushing is unstable, in that once a small disturbance forces the system to abandon the stable position, the pushing operation itself makes the deviation wider. The state space is divided into 25 subregions, in each of which a control rule is specified manually. To avoid crisp division of the control space, fuzzy control logic is used. Various possibilities are summed up by membership functions. Three membership functions, one of which is made active according to the distance from the goal being near, medium, or far, are prepared. A mobile robot was built and experiments were performed.<>
{"title":"Fuzzy control of a mobile robot for the push-a-box operation","authors":"Y. Okawa, J. Aoki","doi":"10.1109/TAI.1992.246358","DOIUrl":"https://doi.org/10.1109/TAI.1992.246358","url":null,"abstract":"As an example of the intelligent actions of robots, the situation in which a mobile robot pushes a square box is considered. The operation of pushing is unstable, in that once a small disturbance forces the system to abandon the stable position, the pushing operation itself makes the deviation wider. The state space is divided into 25 subregions, in each of which a control rule is specified manually. To avoid crisp division of the control space, fuzzy control logic is used. Various possibilities are summed up by membership functions. Three membership functions, one of which is made active according to the distance from the goal being near, medium, or far, are prepared. A mobile robot was built and experiments were performed.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122812973","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}
An approach being explored to improve the usefulness of machine learning techniques for generating classification rules for complex, real-world data is described. The approach involves the use of genetic algorithms as a front end to a traditional rule induction system in order to identify and select the best subset of features to be used by the rule induction system. This approach has been implemented and tested on difficult texture classification problems. The results are encouraging and indicate that there are significant advantages to the approach in this domain.<>
{"title":"Genetic algorithms as a tool for feature selection in machine learning","authors":"H. Vafaie, K. D. Jong","doi":"10.1109/TAI.1992.246402","DOIUrl":"https://doi.org/10.1109/TAI.1992.246402","url":null,"abstract":"An approach being explored to improve the usefulness of machine learning techniques for generating classification rules for complex, real-world data is described. The approach involves the use of genetic algorithms as a front end to a traditional rule induction system in order to identify and select the best subset of features to be used by the rule induction system. This approach has been implemented and tested on difficult texture classification problems. The results are encouraging and indicate that there are significant advantages to the approach in this domain.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126139769","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}
An algorithm suitable for the full transitive closure problem, which is used to solve uninstantiated recursive queries in deductive databases, is presented. In this algorithm there are two phases. In the first phase a general graph is condensed into an acyclic graph and at the same time a special sparse matrix is formed from the acyclic graph. The second phase is the main one, where all of the page I/O operations are minimized. Simulation is used to study the performance of this algorithm and compare it with that of previous algorithms.<>
{"title":"New transitive closure algorithm for recursive query processing in deductive databases","authors":"I. H. Toroslu, G. .. Qadah","doi":"10.1109/TAI.1992.246414","DOIUrl":"https://doi.org/10.1109/TAI.1992.246414","url":null,"abstract":"An algorithm suitable for the full transitive closure problem, which is used to solve uninstantiated recursive queries in deductive databases, is presented. In this algorithm there are two phases. In the first phase a general graph is condensed into an acyclic graph and at the same time a special sparse matrix is formed from the acyclic graph. The second phase is the main one, where all of the page I/O operations are minimized. Simulation is used to study the performance of this algorithm and compare it with that of previous algorithms.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130800709","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}
A policy for scheduling concurrent transactions in which the preconditions and effects associated with the transactions can be specified is described. Also proposed is a recovery procedure for when transaction failures are detected. The advantages of the scheduling algorithm can be summarized as follows: for conventional transaction models, it is less constrained than the two-phased protocol, particularly for short transactions; and it can perform concurrency control based on semantic dependencies.<>
{"title":"Dependency-based concurrency control in logic-oriented object bases","authors":"L. Yang, P. Sheu","doi":"10.1109/TAI.1992.246413","DOIUrl":"https://doi.org/10.1109/TAI.1992.246413","url":null,"abstract":"A policy for scheduling concurrent transactions in which the preconditions and effects associated with the transactions can be specified is described. Also proposed is a recovery procedure for when transaction failures are detected. The advantages of the scheduling algorithm can be summarized as follows: for conventional transaction models, it is less constrained than the two-phased protocol, particularly for short transactions; and it can perform concurrency control based on semantic dependencies.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123047746","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：