M. Perlin, J. Carbonell, Daniel P. Miranker, S. Stolfo, Milind Tambe
A panel session in which issues relating to the effects of advances in faster and more parallel hardware, production system match (PSM) algorithms, and application domains for match on PSM as a research area is presented. It is argued that there is no such thing as the optimal matching algorithm, even for the well-defined task of production-system match and that broadening the scope of the matching task beyond forward-chaining production system presents a new set of problems to the artificial intelligence community. Also, even with all the speedups, large production system runs take hours to complete, and a major portion of this time is attributable to PSM. Match technology remains a large and centralized component of system performance. To that extent, providing sufficient speedups in the match in these systems may still be useful. Performance issues of production system execution are discussed, and a common set of benchmarks and test cases is called for. It is argued that parallel algorithms for match, resolve, and fire are all interesting and difficult problems to solve, and should be the focus of research by the PSM community.<>
{"title":"Is production system matching interesting?","authors":"M. Perlin, J. Carbonell, Daniel P. Miranker, S. Stolfo, Milind Tambe","doi":"10.1109/TAI.1992.246380","DOIUrl":"https://doi.org/10.1109/TAI.1992.246380","url":null,"abstract":"A panel session in which issues relating to the effects of advances in faster and more parallel hardware, production system match (PSM) algorithms, and application domains for match on PSM as a research area is presented. It is argued that there is no such thing as the optimal matching algorithm, even for the well-defined task of production-system match and that broadening the scope of the matching task beyond forward-chaining production system presents a new set of problems to the artificial intelligence community. Also, even with all the speedups, large production system runs take hours to complete, and a major portion of this time is attributable to PSM. Match technology remains a large and centralized component of system performance. To that extent, providing sufficient speedups in the match in these systems may still be useful. Performance issues of production system execution are discussed, and a common set of benchmarks and test cases is called for. It is argued that parallel algorithms for match, resolve, and fire are all interesting and difficult problems to solve, and should be the focus of research by the PSM community.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"22 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":"124043384","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 modification to the algorithmic mapping algorithm for neural network models proposed by W. Lin et al. (1991) is presented. The modified algorithm can accommodate a larger class of network models recently proposed. The new neural network model uses vectorial interconnections between neurons and multiactivation product units. The generalized delta rule for the Rumelhart-Hinton-Williams neural networks can still be used with appropriate enhancement. The implementation of the model is targeted for fine-grain mesh-connected SIMD machines. The basic routing procedures are similar to those in the algorithmic mapping algorithm but with more flexibility in specifying the size of the data to be shifted between processors.<>
{"title":"Algorithmic mapping of neural networks with multi-activation product units onto SIMD machines","authors":"Yiwei Chen, F. Bastani","doi":"10.1109/TAI.1992.246368","DOIUrl":"https://doi.org/10.1109/TAI.1992.246368","url":null,"abstract":"A modification to the algorithmic mapping algorithm for neural network models proposed by W. Lin et al. (1991) is presented. The modified algorithm can accommodate a larger class of network models recently proposed. The new neural network model uses vectorial interconnections between neurons and multiactivation product units. The generalized delta rule for the Rumelhart-Hinton-Williams neural networks can still be used with appropriate enhancement. The implementation of the model is targeted for fine-grain mesh-connected SIMD machines. The basic routing procedures are similar to those in the algorithmic mapping algorithm but with more flexibility in specifying the size of the data to be shifted between processors.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"20 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":"114301266","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}
Takayasu Kasahra, Naoyuki Yamada, Yasuhiro Kobayashi, K. Yoshino, K. Yoshimura
An expert system tool, ASPROGEN (automatic search program generator), is described. It has a domain model editor, by which tool users can define their problems in an object-oriented way, and a built-in function for automatic generation of a domain-specific inference program. This function uses search-based program specifications and an abstract data type of search. The descriptiveness of this domain model is shown by applying ASPROGEN to a scheduling problem.<>
{"title":"Domain model for constructing a knowledge based system","authors":"Takayasu Kasahra, Naoyuki Yamada, Yasuhiro Kobayashi, K. Yoshino, K. Yoshimura","doi":"10.1109/TAI.1992.246454","DOIUrl":"https://doi.org/10.1109/TAI.1992.246454","url":null,"abstract":"An expert system tool, ASPROGEN (automatic search program generator), is described. It has a domain model editor, by which tool users can define their problems in an object-oriented way, and a built-in function for automatic generation of a domain-specific inference program. This function uses search-based program specifications and an abstract data type of search. The descriptiveness of this domain model is shown by applying ASPROGEN to a scheduling problem.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"44 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":"122412454","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}
Effective testing (validation, verification and evaluation) for expert systems is becoming important. A comparative evaluation of black-box, white-box, consistency, and completeness testing methods is performed based on the criteria of effectiveness, robustness, and cost. Testing methods are evaluated using life-cycle mutation testing on a VLSI manufacturing diagnostic expert system. The results indicate that dynamic-flow testing can be used to catch faults in all phases of software development.<>
{"title":"Comparative evaluation of expert system testing methods","authors":"Shekhar H. Kirani, I. Zualkernan, W. Tsai","doi":"10.1109/TAI.1992.246425","DOIUrl":"https://doi.org/10.1109/TAI.1992.246425","url":null,"abstract":"Effective testing (validation, verification and evaluation) for expert systems is becoming important. A comparative evaluation of black-box, white-box, consistency, and completeness testing methods is performed based on the criteria of effectiveness, robustness, and cost. Testing methods are evaluated using life-cycle mutation testing on a VLSI manufacturing diagnostic expert system. The results indicate that dynamic-flow testing can be used to catch faults in all phases of software development.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"15 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":"116653152","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}
In order to specify intelligent control for robotic systems, a generic blackboard based methodology is proposed. It is based on a functional analysis of the problem of control. The control is viewed as a distributed multishape blackboard decomposition. Specific functionalities of blackboard architectures are specialized for each of the aspects of control: a graphical blackboard for interaction, a classical one for reasoning, and a parallel real-time one for control. An original parallel blackboard architecture which integrates the whole system is presented. A model is supplied to express activity and genericity of this tool.<>
{"title":"A parallel blackboard generic tool for intelligent robotics","authors":"M. Occello, Marie-Claude Thomas","doi":"10.1109/TAI.1992.246448","DOIUrl":"https://doi.org/10.1109/TAI.1992.246448","url":null,"abstract":"In order to specify intelligent control for robotic systems, a generic blackboard based methodology is proposed. It is based on a functional analysis of the problem of control. The control is viewed as a distributed multishape blackboard decomposition. Specific functionalities of blackboard architectures are specialized for each of the aspects of control: a graphical blackboard for interaction, a classical one for reasoning, and a parallel real-time one for control. An original parallel blackboard architecture which integrates the whole system is presented. A model is supplied to express activity and genericity of this tool.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"115 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":"117132267","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 issue of temporal reasoning in an online real-time expert system in the field of process control is addressed. An alarm filtering problem is described, and the integration of a point-based time map manager (TMM) with an inference engine, to manage the temporal constraints, is proposed. The TMM manages only imprecise future time points and must comply with the constant modification of the current time and thus with the removal of time points that are moved to the past. Temporal restrictions in the left-hand sides of rules are also described, together with the need for management of pending queries that may receive an answer when the uncertainty pervading the future is reduced.<>
{"title":"Applying a time map manager in a real-time expert system for alarm filtering","authors":"Thomas Chehire, E. Onaindía","doi":"10.1109/TAI.1992.246378","DOIUrl":"https://doi.org/10.1109/TAI.1992.246378","url":null,"abstract":"The issue of temporal reasoning in an online real-time expert system in the field of process control is addressed. An alarm filtering problem is described, and the integration of a point-based time map manager (TMM) with an inference engine, to manage the temporal constraints, is proposed. The TMM manages only imprecise future time points and must comply with the constant modification of the current time and thus with the removal of time points that are moved to the past. Temporal restrictions in the left-hand sides of rules are also described, together with the need for management of pending queries that may receive an answer when the uncertainty pervading the future is reduced.<<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":"114083759","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}
To deal with complex problems, many kinds of reasoning and representation techniques are needed. The cooperation between different reasoning models constitutes one of the objectives of second-generation systems. The need to mix temporal and hypothetical reasoning for qualitative simulation is highlighted. A system built around an ATMS, a TCP, and a model that reasons on orders of magnitude is proposed. This system relies on an extension of HEART (see C. Joubel and O. Raiman, 1990). A new method for making histories concise has been developed.<>
{"title":"Temporal and hypothetical reasoning as a support for qualitative reasoning","authors":"C. Loesel, F. Charpillet, J. Haton","doi":"10.1109/TAI.1992.246441","DOIUrl":"https://doi.org/10.1109/TAI.1992.246441","url":null,"abstract":"To deal with complex problems, many kinds of reasoning and representation techniques are needed. The cooperation between different reasoning models constitutes one of the objectives of second-generation systems. The need to mix temporal and hypothetical reasoning for qualitative simulation is highlighted. A system built around an ATMS, a TCP, and a model that reasons on orders of magnitude is proposed. This system relies on an extension of HEART (see C. Joubel and O. Raiman, 1990). A new method for making histories concise has been developed.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"119 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":"125457559","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 expert system approach to digital hardware design verification is described. Artificial-intelligence-based approaches typically use general-purpose theorem-proving to show that the design meets the formal specification. In contrast, the expert system DEVE interprets the specification to invoke proper domain-specific verification methods in a knowledge-based environment.<>
{"title":"DEVE: an expert system for hardware design verification","authors":"A. M. Kabakçioglu, O.L. Mazuera","doi":"10.1109/TAI.1992.246456","DOIUrl":"https://doi.org/10.1109/TAI.1992.246456","url":null,"abstract":"An expert system approach to digital hardware design verification is described. Artificial-intelligence-based approaches typically use general-purpose theorem-proving to show that the design meets the formal specification. In contrast, the expert system DEVE interprets the specification to invoke proper domain-specific verification methods in a knowledge-based environment.<<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":"131145076","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 blackboard model is a versatile framework for implementing expert systems. In recent years the speed of blackboard access has been improved but the execution cycle, which manages knowledge source activation and execution, still needs substantial improvement. A method of condensing knowledge sources is presented, and it is shown how to efficiently activate and execute a class of blackboard application systems using the condensed representation. It is shown that the time complexity of the execution cycle of a condensed system is faster than that of the conventional approach by the ratio of the time required for blackboard retrievals to the time required for vector element retrievals. In practice, this ratio is approximately four order of magnitude.<>
{"title":"Efficiency in pure blackboard systems","authors":"R. Hewett, M. Hewett","doi":"10.1109/TAI.1992.246372","DOIUrl":"https://doi.org/10.1109/TAI.1992.246372","url":null,"abstract":"The blackboard model is a versatile framework for implementing expert systems. In recent years the speed of blackboard access has been improved but the execution cycle, which manages knowledge source activation and execution, still needs substantial improvement. A method of condensing knowledge sources is presented, and it is shown how to efficiently activate and execute a class of blackboard application systems using the condensed representation. It is shown that the time complexity of the execution cycle of a condensed system is faster than that of the conventional approach by the ratio of the time required for blackboard retrievals to the time required for vector element retrievals. In practice, this ratio is approximately four order of magnitude.<<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":"130990656","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 series of extensions of tense theory of atomic events to accommodate durative events is presented. The interaction of tenses with time adverbials is discussed and a constraint for tense-adverb agreement is proposed. Sentences containing clauses connected by a temporal connective, such as 'when', 'before', 'after', etc. may have different aspect interpretations, depending on the situation types and verb forms involved. In particular, 'before' and 'after' are not always inverses of each other. One can adopt a similar mechanism to take account of this kind of sentence. Their temporal constraints are described, and their temporal interpretations can be obtained accurately.<>
{"title":"Temporal constraints and their interpretations in natural language","authors":"Hsiu-Hui Lee, I. Lin, Chien-Ping Wu","doi":"10.1109/TAI.1992.246419","DOIUrl":"https://doi.org/10.1109/TAI.1992.246419","url":null,"abstract":"A series of extensions of tense theory of atomic events to accommodate durative events is presented. The interaction of tenses with time adverbials is discussed and a constraint for tense-adverb agreement is proposed. Sentences containing clauses connected by a temporal connective, such as 'when', 'before', 'after', etc. may have different aspect interpretations, depending on the situation types and verb forms involved. In particular, 'before' and 'after' are not always inverses of each other. One can adopt a similar mechanism to take account of this kind of sentence. Their temporal constraints are described, and their temporal interpretations can be obtained accurately.<<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":"131030694","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
扫码关注我们
求助内容：
应助结果提醒方式：