发布求助
文献互助 智能选刊 最新文献

[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91最新文献

筛选
英文 中文
An event-based real-time logic to specify the behavior and timing properties of real-time systems 基于事件的实时逻辑，用于指定实时系统的行为和定时属性
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167097
Horng-Yuan Chen, J. Tsai, Yao-Dong Bi
{"title":"An event-based real-time logic to specify the behavior and timing properties of real-time systems","authors":"Horng-Yuan Chen, J. Tsai, Yao-Dong Bi","doi":"10.1109/TAI.1991.167097","DOIUrl":"https://doi.org/10.1109/TAI.1991.167097","url":null,"abstract":"A modification is presented of temporal logic-event-based real-time logic (ERL), based on an event-based conceptual model. The ERL provides a high-level framework for specifying timing properties of real-time software systems. The ERL is used to specify both expected behavior (specification) and actual behavior (execution traces) of the target systems; it is also used to verify that the program achieves the specification. A method is also described to implement the ERL using the Prolog programming language for testing and debugging real-time software systems.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114508937","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}
引用次数: 4
A methodology for creating and adapting reactive systems 一种用于创建和调整反应性系统的方法
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167098
A. J. Hendriks, D. Lyons
{"title":"A methodology for creating and adapting reactive systems","authors":"A. J. Hendriks, D. Lyons","doi":"10.1109/TAI.1991.167098","DOIUrl":"https://doi.org/10.1109/TAI.1991.167098","url":null,"abstract":"A methodology is presented for building integrated planning-reacting systems. The work is based on a formal process-based approach to building the reactive component; this makes it possible to formalize the concept of a planner improving a reactor. The planner design emphasizes how the planner can use the reactor to focus its reasoning, as well as how the reactor is guided by the planner to improve its behavior. The reactive component (the reactor) is based on a process-based model of robot computation, the RS model. This gives a powerful representation for actions with precise formal semantics. The duty of the planning component (the planner) is to adapt the reactor to suit a set of objectives and the possibilities afforded by the environment. Planner and reactor both operate continually, separately and in a complementary fashion.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121617861","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}
引用次数: 2
Preventing infinite looping in Prolog 防止Prolog中的无限循环
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167044
J. Han
{"title":"Preventing infinite looping in Prolog","authors":"J. Han","doi":"10.1109/TAI.1991.167044","DOIUrl":"https://doi.org/10.1109/TAI.1991.167044","url":null,"abstract":"A method is proposed to modify Prolog compilers so that infinite looping can often be avoided in recursive Prolog programs. The study is carried out in the context of deductive databases. Termination of recursive query processing here is related to boundedness: uniform boundedness and extensional boundedness. Limitations of this method are briefly discussed.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127080128","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}
引用次数: 1
Improving Han and Lee's path consistency algorithm 改进Han和Lee的路径一致性算法
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167114
Yangjun Chen
{"title":"Improving Han and Lee's path consistency algorithm","authors":"Yangjun Chen","doi":"10.1109/TAI.1991.167114","DOIUrl":"https://doi.org/10.1109/TAI.1991.167114","url":null,"abstract":"C.C. Han and C.H. Lee (1988) presented a path consistency algorithm. A new algorithm is described for path consistency, and it is shown that the algorithm requires less time and space than Han and Lee's. The key idea of the algorithms is the arranging of the edges which are checked in the first part of Han and Lee's algorithm and the interlacing of the second part of the algorithm in the first part by using the symmetry of the triangle.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122898981","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}
引用次数: 13
A new approach for the design of reinforcement schemes for learning automata: stochastic estimator learning algorithms 一种设计学习自动机强化方案的新方法:随机估计学习算法
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167109
G. Papadimitriou
{"title":"A new approach for the design of reinforcement schemes for learning automata: stochastic estimator learning algorithms","authors":"G. Papadimitriou","doi":"10.1109/TAI.1991.167109","DOIUrl":"https://doi.org/10.1109/TAI.1991.167109","url":null,"abstract":"A new approach to the design of S-model ergodic learning automata is introduced. The new scheme uses a stochastic estimator and is able to operate in nonstationary environments with high accuracy and high adaptation rate. The estimator is always recently updated and, consequently, is able to be adapted to environmental changes. The performance of the stochastic estimator learning automation (SELA) is superior to that of the previous well-known S-model ergodic schemes. Furthermore, it is proved that SELA is absolutely expedient in every stationary S-model random environment.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128177694","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}
引用次数: 4
Shape analysis using morphological processing and genetic algorithms 形状分析使用形态处理和遗传算法
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167087
J. Bala, H. Wechsler
{"title":"Shape analysis using morphological processing and genetic algorithms","authors":"J. Bala, H. Wechsler","doi":"10.1109/TAI.1991.167087","DOIUrl":"https://doi.org/10.1109/TAI.1991.167087","url":null,"abstract":"A novel way of combining morphological processing and genetic algorithms (GAs) to generate high-performance shape discrimination operators is presented. GAs can evolve operators that discriminate among classes comprising different shapes. The operators are defined as variable structuring elements and can be sequenced as program forms. The population of such operators, evaluated according to an index of performance corresponding to shape discrimination ability, evolves into an optimal set of operators using genetic search. Experimental results are presented to illustrate the feasibility of the approach for shape discrimination.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125475231","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}
引用次数: 14
New crossover operators in genetic algorithms 遗传算法中的新交叉算子
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167090
Yi Shang, Guo-Jie Li
{"title":"New crossover operators in genetic algorithms","authors":"Yi Shang, Guo-Jie Li","doi":"10.1109/TAI.1991.167090","DOIUrl":"https://doi.org/10.1109/TAI.1991.167090","url":null,"abstract":"Two new crossover operators in genetic algorithms for solving some combinatorial problems with ordering are presented. One is enhanced order crossover (EOX). The other, GREE, is a heuristic crossover for a class of combinatorial optimization problems, such as traveling salesman problems (TSPs). Genetic algorithms using GREE as unique crossover run very fast and get good solutions. Combining GREE with EOX, genetic algorithms can find optimal or very near optimal solutions in a rather short time.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129210559","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}
引用次数: 18
Parallel sampling in Bayesian networks 贝叶斯网络中的并行抽样
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167077
V. Rego, A. Schulz
{"title":"Parallel sampling in Bayesian networks","authors":"V. Rego, A. Schulz","doi":"10.1109/TAI.1991.167077","DOIUrl":"https://doi.org/10.1109/TAI.1991.167077","url":null,"abstract":"An easily parallelized version of the Pearl sequential algorithm is presented, along with experimental results utilizing an Ncube/1, hypercube and a Sequent shared memory multiprocessor. Pearl's concurrent simulation algorithm is briefly reviewed, and three modifications to this algorithm are proposed. These modifications, known as stack, phase, and parallel simulations, show considerable speedup in experiments performed on the hypercube.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115150648","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}
引用次数: 0
Propositional logic for validating software object interrelationships 用于验证软件对象相互关系的命题逻辑
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167075
P. Bobbie, J. E. Urban
{"title":"Propositional logic for validating software object interrelationships","authors":"P. Bobbie, J. E. Urban","doi":"10.1109/TAI.1991.167075","DOIUrl":"https://doi.org/10.1109/TAI.1991.167075","url":null,"abstract":"The objective of this work is the application of propositional calculus to validate the consistency of the interrelationship between software objects. A software object is defined as an entity or element which has a name and a role, achieves an objective, and can be identified at the formative stages of eliciting requirements specifications. A relation is also an entity that binds two software objects and conveys an association between the object-pair. Such a binding produces logical propositions or arguments for reasoning about the interrelationships of the objects. The authors narrow the view of requirements specifications to a collection of several, perhaps hundreds, of propositions or arguments.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123836542","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}
引用次数: 0
Toward a general methodology for specifying expert systems 朝向指定专家系统的一般方法
[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI: 10.1109/TAI.1991.167103
Jonathan Lee, J. Yen
{"title":"Toward a general methodology for specifying expert systems","authors":"Jonathan Lee, J. Yen","doi":"10.1109/TAI.1991.167103","DOIUrl":"https://doi.org/10.1109/TAI.1991.167103","url":null,"abstract":"A general methodology for specifying both the model and the process knowledge of an expert system at different abstraction levels is proposed. Specifications are acquired and organized around the general notion of a task. The model specification of a task describes a partial model of the application domain and a partial model of the problem solving states relevant to the task. The process specification of a task describes states before, during, and after the task as well as task state expression to describe the behavior. A piece of abstract specification can be refined to a more detailed specification. Specifications at different abstraction levels can be verified for their consistency and completeness.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128560583","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信