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

Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94最新文献

筛选
英文 中文
A scheme for knowledge representation, verification and reasoning in real time asynchronous production systems 一种实时异步生产系统中的知识表示、验证和推理方案
Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94 Pub Date : 1994-11-06 DOI: 10.1109/TAI.1994.346433
T. S. Perraju, G. Uma, B. E. Prasad
{"title":"A scheme for knowledge representation, verification and reasoning in real time asynchronous production systems","authors":"T. S. Perraju, G. Uma, B. E. Prasad","doi":"10.1109/TAI.1994.346433","DOIUrl":"https://doi.org/10.1109/TAI.1994.346433","url":null,"abstract":"Expert systems for real time process monitoring need to respond to asynchronous events and reason about temporal properties of the process. This requires the ability to perform data input, event handling and temporal asynchronous reasoning during the inference cycle. Conventional expert systems do not possess these abilities. We describe a knowledge representation formalism which captures dynamic properties like external events, timing constraints and data trends in addition to diagnostic knowledge. This representation lends itself to verification of the knowledge base. We further show the implementation of a multiple rule firing asynchronous inference engine using this model.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"5 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":"122126071","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}
引用次数: 9
A practical module system for logic programming and its semantics 一个实用的逻辑编程模块系统及其语义
Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94 Pub Date : 1994-11-06 DOI: 10.1109/TAI.1994.346420
Isambo Karali, C. Halatsis
{"title":"A practical module system for logic programming and its semantics","authors":"Isambo Karali, C. Halatsis","doi":"10.1109/TAI.1994.346420","DOIUrl":"https://doi.org/10.1109/TAI.1994.346420","url":null,"abstract":"Encapsulation constructs with import/export declarations is the structuring facility offered in most commercial Prolog systems. However, real-life applications have shown to require a finer information exchange between encapsulated pieces of code. A refinement of import/export declarations for logic modules is presented both as a stricter form of communication between the modules and as a larger variety of visibility states of the predicates, the standard approaches being special cases of it. The semantics of this module system has been examined and model-theoretic, fixpoint and operational ones have been given and have been proved to be equivalent. In addition, the module system has been naturally transformed to Horn clause logic.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"41 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":"124113769","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
Predicting the response time of real-time rule-based programs with variable-expression assignments 用变量表达式赋值预测实时基于规则的程序的响应时间
Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94 Pub Date : 1994-11-06 DOI: 10.1109/TAI.1994.346477
Jeng-Rung Chen, A. Cheng
{"title":"Predicting the response time of real-time rule-based programs with variable-expression assignments","authors":"Jeng-Rung Chen, A. Cheng","doi":"10.1109/TAI.1994.346477","DOIUrl":"https://doi.org/10.1109/TAI.1994.346477","url":null,"abstract":"Real-time expert systems are embedded decision systems which must respond to changes in the environments within stringent timing constraints. Given a program p, the response time analysis problem is to determine the maximal response time of p. In this paper, we tackle this problem with a response time upper bound algorithm for a class of EQL rule-based programs whose variables range over finite domains, This algorithm computes a response tame upper bound of the given program by determining the maximal number of rule firings which result from the firings of individual rules enabled at the invocation.<<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":"129739599","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}
引用次数: 3
A partial breadth-first execution model for Prolog Prolog的部分宽度优先执行模型
Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94 Pub Date : 1994-11-06 DOI: 10.1109/TAI.1994.346504
Jordi Tubella, Antonio González
{"title":"A partial breadth-first execution model for Prolog","authors":"Jordi Tubella, Antonio González","doi":"10.1109/TAI.1994.346504","DOIUrl":"https://doi.org/10.1109/TAI.1994.346504","url":null,"abstract":"MEM (Multipath Execution Model) is a novel model for the execution of Prolog programs which combines a depth-first and breadth-first exploration of the search tree. The breadth-first search allows more than one path of the SLD-tree to be explored at the same time. In this way, the computational cost of traversing the whole search tree associated to a program can be decreased because the MEM model reduces the overhead due to the execution of control instructions and also diminishes the number of unifications to be performed. This paper focuses on the description of the MEM model and its sequential implementation. Moreover, the MEM execution model can be implemented in order to exploit a new kind of parallelism, called path parallelism, which allows the parallel execution of unify operations related to simultaneously traversed paths.<<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":"129202589","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}
引用次数: 5
NSK, an object-oriented simulator kernel for arbitrary feedforward neural networks NSK，一个面向对象的仿真内核，用于任意前馈神经网络
Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94 Pub Date : 1994-11-06 DOI: 10.1109/TAI.1994.346508
Cédric Gégout, Bernard Girau, Fabrice Rossi
{"title":"NSK, an object-oriented simulator kernel for arbitrary feedforward neural networks","authors":"Cédric Gégout, Bernard Girau, Fabrice Rossi","doi":"10.1109/TAI.1994.346508","DOIUrl":"https://doi.org/10.1109/TAI.1994.346508","url":null,"abstract":"An object-oriented neural network simulator kernel is presented. It as based on a general mathematical model for arbitrary feedforward nets. We propose a C++ implementation of this model which satisfies the following requirements: expandability (allowing an easy implementation of a new neural model), portability and efficiency (the kernel does not increase significantly its computation times for classic models, compared to a direct object-oriented implementation). Learning algorithms such as gradient-based ones can be written for arbitrary nets and are therefore directly available for every particular model.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"43 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":"131730665","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
The schema theorem considered insufficient 图式定理被认为是不充分的
Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94 Pub Date : 1994-11-06 DOI: 10.1109/TAI.1994.346410
W. S. Chung, R. Perez
{"title":"The schema theorem considered insufficient","authors":"W. S. Chung, R. Perez","doi":"10.1109/TAI.1994.346410","DOIUrl":"https://doi.org/10.1109/TAI.1994.346410","url":null,"abstract":"The purpose of this paper is to attempt to verify how the schema theorem affects the behavior of a genetic algorithm (GA) and uncover the relationships between building blocks and increasing schemata. From the analysis of schema tracing, the schema theorem should be interpreted carefully with precise definitions of building block and increasing schema. In addition, we find that an important type of above-average schemata that are not building blocks, which we call phenotypic schemata, always exists among the schemata receiving increasing evaluations during the GA search.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"2 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":"115650786","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}
引用次数: 12
Customizing parallel formulations of backpropagation learning algorithm to neural network architectures: a summary of result 自定义神经网络架构的反向传播学习算法的并行公式:结果摘要
Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94 Pub Date : 1994-11-06 DOI: 10.1109/TAI.1994.346497
Minesh B. Anim, S. Shekhar
{"title":"Customizing parallel formulations of backpropagation learning algorithm to neural network architectures: a summary of result","authors":"Minesh B. Anim, S. Shekhar","doi":"10.1109/TAI.1994.346497","DOIUrl":"https://doi.org/10.1109/TAI.1994.346497","url":null,"abstract":"Several generic parallel formulations of the backpropagation learning algorithm have been proposed recently. Further speedups are possible by customizing parallel formulations to the architecture of the neural network. The paper addresses the issue of customizing parallel formulations of the backpropagation learning algorithm to a given neural network architecture on multiprocessors with hypercube-like communication topology. We introduce a new parallel formulation called rectangular checkerboarding which adapts to the network architecture and can provide performance gains for non-uniform neural networks, where the number of nodes vary across the layers. Algebraic analysis shows that each instance of rectangular checkerboarding (using a specific rectangular processor grid) is optimal for an important family of network architectures. Experiments on CM-5 show that customizing to network architecture can provide significant (/spl sim/50%) performance gains for many interesting non-uniform neural network architectures, which are currently used in important applications. We also introduce the staircase framework, which can use different processor grids for different layers of a neural network.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"188 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":"125306310","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}
引用次数: 7
MODEST: a model-based diagnostic expert system 一个基于模型的诊断专家系统
Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94 Pub Date : 1994-11-06 DOI: 10.1109/TAI.1994.346426
Y. W. Purna, Takahira Yamaguchi
{"title":"MODEST: a model-based diagnostic expert system","authors":"Y. W. Purna, Takahira Yamaguchi","doi":"10.1109/TAI.1994.346426","DOIUrl":"https://doi.org/10.1109/TAI.1994.346426","url":null,"abstract":"Describes work in progress on developing a diagnostic expert system called MODEST (MOdel-based Diagnostic Expert SysTem). MODEST has been being developed for the purpose of providing a robust framework for diagnostic expert systems. It is built based on the paradigm of model-based diagnosis, dividing the task of diagnosis into three subtasks (namely, hypothesis generation, hypothesis testing and hypothesis classification) and exploiting multifarious knowledge and strategies to perform each subtask. So far, the hypothesis generation and testing parts of MODEST have been successfully implemented and tested in diagnosing possible faults in the domain of refrigeration plants, with promising results.<<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":"116056171","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
A comparative study of IDA*-style searches IDA*风格搜索的比较研究
Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94 Pub Date : 1994-11-06 DOI: 10.1109/TAI.1994.346478
B. Wah, Yi Shang
{"title":"A comparative study of IDA*-style searches","authors":"B. Wah, Yi Shang","doi":"10.1109/TAI.1994.346478","DOIUrl":"https://doi.org/10.1109/TAI.1994.346478","url":null,"abstract":"In this paper, we study the performance of various IDA*-style searches and investigate methods to improve their performance by predicting in each stage the threshold to use for pruning. We first present three models to approximate the distribution of number of search nodes by lower bounds: exponential, geometric, and linear, and illustrate these distributions based on some well-known combinatorial search problems. We then show the performance of an ideal IDA* algorithm and identify reasons why existing IDA*-style algorithms perform well. In practice, we will be able to know from previous experience the distribution for a given problem instance but will not be able to determine the parameters of the distribution. Hence, we develop RIDA*, a method that estimates dynamically the parameters of the distribution, and predicts the best threshold to use, Finally, we compare the performance of several IDA*-style algorithms-Korf's IDA*, RIDA*, IDA* CR and DFS*-on several application problems, and identify conditions under which each of these algorithms will perform well.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"154 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":"123094034","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}
引用次数: 5
Sequences constraint solving in constraint logic programming 约束逻辑规划中的序列约束求解
Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94 Pub Date : 1994-11-06 DOI: 10.1109/TAI.1994.346397
P. Baptiste, B. Legeard, H. Zidoum
{"title":"Sequences constraint solving in constraint logic programming","authors":"P. Baptiste, B. Legeard, H. Zidoum","doi":"10.1109/TAI.1994.346397","DOIUrl":"https://doi.org/10.1109/TAI.1994.346397","url":null,"abstract":"This paper deals with consistency techniques over sequences constraints embedded in Constraint Logic Programming CLPS. CLP Sequences constraints are defined over Hereditarily Homogeneous Finite Sets HHFS built on atomic elements to characterise a family of admissible sequences. The relations we are dealing with are classical sets relations (/spl isin/,/spl sub/,=,/spl ne/) and sequencing relations as potential, metric and range constraints. We define the semantics of these relations with a characteristic range function. The consistency techniques used are incremental reduction of the normal form based on a tree like representation called P-Q-R trees. This allows us to reduce the set of admissible sequences before generating solutions.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"63 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":"122858933","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学术官方微信